16.21/7.19 MAYBE 16.21/7.19 16.21/7.19 Ultimate: Cannot open display: 16.21/7.19 This is Ultimate 0.1.24-8dc7c08-m 16.21/7.19 [2019-03-28 12:46:59,749 INFO L170 SettingsManager]: Resetting all preferences to default values... 16.21/7.19 [2019-03-28 12:46:59,751 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 16.21/7.19 [2019-03-28 12:46:59,762 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 16.21/7.19 [2019-03-28 12:46:59,762 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 16.21/7.19 [2019-03-28 12:46:59,763 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 16.21/7.19 [2019-03-28 12:46:59,765 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 16.21/7.19 [2019-03-28 12:46:59,766 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 16.21/7.19 [2019-03-28 12:46:59,768 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 16.21/7.19 [2019-03-28 12:46:59,768 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 16.21/7.19 [2019-03-28 12:46:59,769 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 16.21/7.19 [2019-03-28 12:46:59,769 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 16.21/7.19 [2019-03-28 12:46:59,770 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 16.21/7.19 [2019-03-28 12:46:59,771 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 16.21/7.19 [2019-03-28 12:46:59,772 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 16.21/7.19 [2019-03-28 12:46:59,773 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 16.21/7.19 [2019-03-28 12:46:59,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 16.21/7.19 [2019-03-28 12:46:59,775 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 16.21/7.19 [2019-03-28 12:46:59,777 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 16.21/7.19 [2019-03-28 12:46:59,779 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 16.21/7.19 [2019-03-28 12:46:59,780 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 16.21/7.19 [2019-03-28 12:46:59,781 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 16.21/7.19 [2019-03-28 12:46:59,783 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 16.21/7.19 [2019-03-28 12:46:59,783 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 16.21/7.19 [2019-03-28 12:46:59,783 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 16.21/7.19 [2019-03-28 12:46:59,784 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 16.21/7.19 [2019-03-28 12:46:59,784 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 16.21/7.19 [2019-03-28 12:46:59,785 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 16.21/7.19 [2019-03-28 12:46:59,785 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 16.21/7.19 [2019-03-28 12:46:59,786 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 16.21/7.19 [2019-03-28 12:46:59,787 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 16.21/7.19 [2019-03-28 12:46:59,787 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 16.21/7.19 [2019-03-28 12:46:59,788 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 16.21/7.19 [2019-03-28 12:46:59,789 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 16.21/7.19 [2019-03-28 12:46:59,789 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 16.21/7.19 [2019-03-28 12:46:59,789 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 16.21/7.19 [2019-03-28 12:46:59,790 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 16.21/7.19 [2019-03-28 12:46:59,791 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 16.21/7.19 [2019-03-28 12:46:59,791 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 16.21/7.19 [2019-03-28 12:46:59,792 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 16.21/7.19 [2019-03-28 12:46:59,806 INFO L110 SettingsManager]: Loading preferences was successful 16.21/7.19 [2019-03-28 12:46:59,806 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 16.21/7.19 [2019-03-28 12:46:59,807 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 16.21/7.19 [2019-03-28 12:46:59,807 INFO L133 SettingsManager]: * Rewrite not-equals=true 16.21/7.19 [2019-03-28 12:46:59,808 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 16.21/7.19 [2019-03-28 12:46:59,808 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 16.21/7.19 [2019-03-28 12:46:59,808 INFO L133 SettingsManager]: * Use SBE=true 16.21/7.19 [2019-03-28 12:46:59,808 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 16.21/7.19 [2019-03-28 12:46:59,808 INFO L133 SettingsManager]: * Use old map elimination=false 16.21/7.19 [2019-03-28 12:46:59,808 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 16.21/7.19 [2019-03-28 12:46:59,809 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 16.21/7.19 [2019-03-28 12:46:59,809 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 16.21/7.19 [2019-03-28 12:46:59,809 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 16.21/7.19 [2019-03-28 12:46:59,809 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 16.21/7.19 [2019-03-28 12:46:59,809 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 16.21/7.19 [2019-03-28 12:46:59,809 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 16.21/7.19 [2019-03-28 12:46:59,810 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 16.21/7.19 [2019-03-28 12:46:59,810 INFO L133 SettingsManager]: * Check division by zero=IGNORE 16.21/7.19 [2019-03-28 12:46:59,810 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 16.21/7.19 [2019-03-28 12:46:59,810 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 16.21/7.19 [2019-03-28 12:46:59,810 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 16.21/7.19 [2019-03-28 12:46:59,810 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 16.21/7.19 [2019-03-28 12:46:59,811 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 16.21/7.19 [2019-03-28 12:46:59,811 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 16.21/7.19 [2019-03-28 12:46:59,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 16.21/7.19 [2019-03-28 12:46:59,811 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 16.21/7.19 [2019-03-28 12:46:59,811 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 16.21/7.19 [2019-03-28 12:46:59,812 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 16.21/7.19 [2019-03-28 12:46:59,812 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 16.21/7.19 [2019-03-28 12:46:59,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 16.21/7.19 [2019-03-28 12:46:59,850 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 16.21/7.19 [2019-03-28 12:46:59,854 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 16.21/7.19 [2019-03-28 12:46:59,855 INFO L271 PluginConnector]: Initializing CDTParser... 16.21/7.19 [2019-03-28 12:46:59,856 INFO L276 PluginConnector]: CDTParser initialized 16.21/7.19 [2019-03-28 12:46:59,856 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 16.21/7.19 [2019-03-28 12:46:59,915 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/258e62519300477ca8a1aa649ca0d397/FLAG1747a1bec 16.21/7.19 [2019-03-28 12:47:00,258 INFO L307 CDTParser]: Found 1 translation units. 16.21/7.19 [2019-03-28 12:47:00,259 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 16.21/7.19 [2019-03-28 12:47:00,259 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 16.21/7.19 [2019-03-28 12:47:00,266 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/258e62519300477ca8a1aa649ca0d397/FLAG1747a1bec 16.21/7.19 [2019-03-28 12:47:00,660 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/258e62519300477ca8a1aa649ca0d397 16.21/7.19 [2019-03-28 12:47:00,671 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 16.21/7.19 [2019-03-28 12:47:00,673 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 16.21/7.19 [2019-03-28 12:47:00,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 16.21/7.19 [2019-03-28 12:47:00,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 16.21/7.19 [2019-03-28 12:47:00,677 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 16.21/7.19 [2019-03-28 12:47:00,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:47:00" (1/1) ... 16.21/7.19 [2019-03-28 12:47:00,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f461d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:47:00, skipping insertion in model container 16.21/7.19 [2019-03-28 12:47:00,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:47:00" (1/1) ... 16.21/7.19 [2019-03-28 12:47:00,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 16.21/7.19 [2019-03-28 12:47:00,707 INFO L176 MainTranslator]: Built tables and reachable declarations 16.21/7.19 [2019-03-28 12:47:00,875 INFO L206 PostProcessor]: Analyzing one entry point: main 16.21/7.19 [2019-03-28 12:47:00,887 INFO L191 MainTranslator]: Completed pre-run 16.21/7.19 [2019-03-28 12:47:00,971 INFO L206 PostProcessor]: Analyzing one entry point: main 16.21/7.19 [2019-03-28 12:47:00,988 INFO L195 MainTranslator]: Completed translation 16.21/7.19 [2019-03-28 12:47:00,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:47:00 WrapperNode 16.21/7.19 [2019-03-28 12:47:00,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 16.21/7.19 [2019-03-28 12:47:00,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 16.21/7.19 [2019-03-28 12:47:00,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 16.21/7.19 [2019-03-28 12:47:00,990 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 16.21/7.19 [2019-03-28 12:47:00,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:47:00" (1/1) ... 16.21/7.19 [2019-03-28 12:47:01,009 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:47:00" (1/1) ... 16.21/7.19 [2019-03-28 12:47:01,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 16.21/7.19 [2019-03-28 12:47:01,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 16.21/7.19 [2019-03-28 12:47:01,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 16.21/7.19 [2019-03-28 12:47:01,034 INFO L276 PluginConnector]: Boogie Preprocessor initialized 16.21/7.19 [2019-03-28 12:47:01,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:47:00" (1/1) ... 16.21/7.19 [2019-03-28 12:47:01,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:47:00" (1/1) ... 16.21/7.19 [2019-03-28 12:47:01,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:47:00" (1/1) ... 16.21/7.19 [2019-03-28 12:47:01,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:47:00" (1/1) ... 16.21/7.19 [2019-03-28 12:47:01,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:47:00" (1/1) ... 16.21/7.19 [2019-03-28 12:47:01,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:47:00" (1/1) ... 16.21/7.19 [2019-03-28 12:47:01,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:47:00" (1/1) ... 16.21/7.19 [2019-03-28 12:47:01,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 16.21/7.19 [2019-03-28 12:47:01,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 16.21/7.19 [2019-03-28 12:47:01,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... 16.21/7.19 [2019-03-28 12:47:01,063 INFO L276 PluginConnector]: RCFGBuilder initialized 16.21/7.19 [2019-03-28 12:47:01,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:47:00" (1/1) ... 16.21/7.19 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 16.21/7.19 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 16.21/7.19 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 16.21/7.19 [2019-03-28 12:47:01,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 16.21/7.19 [2019-03-28 12:47:01,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 16.21/7.19 [2019-03-28 12:47:01,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 16.21/7.19 [2019-03-28 12:47:01,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 16.21/7.19 [2019-03-28 12:47:01,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 16.21/7.19 [2019-03-28 12:47:01,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 16.21/7.19 [2019-03-28 12:47:01,466 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 16.21/7.19 [2019-03-28 12:47:01,466 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. 16.21/7.19 [2019-03-28 12:47:01,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:47:01 BoogieIcfgContainer 16.21/7.19 [2019-03-28 12:47:01,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 16.21/7.19 [2019-03-28 12:47:01,469 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 16.21/7.19 [2019-03-28 12:47:01,469 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 16.21/7.19 [2019-03-28 12:47:01,471 INFO L276 PluginConnector]: BlockEncodingV2 initialized 16.21/7.19 [2019-03-28 12:47:01,472 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:47:01" (1/1) ... 16.21/7.19 [2019-03-28 12:47:01,491 INFO L313 BlockEncoder]: Initial Icfg 52 locations, 59 edges 16.21/7.19 [2019-03-28 12:47:01,493 INFO L258 BlockEncoder]: Using Remove infeasible edges 16.21/7.19 [2019-03-28 12:47:01,494 INFO L263 BlockEncoder]: Using Maximize final states 16.21/7.19 [2019-03-28 12:47:01,494 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 16.21/7.19 [2019-03-28 12:47:01,495 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 16.21/7.19 [2019-03-28 12:47:01,497 INFO L296 BlockEncoder]: Using Remove sink states 16.21/7.19 [2019-03-28 12:47:01,497 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 16.21/7.19 [2019-03-28 12:47:01,498 INFO L179 BlockEncoder]: Using Rewrite not-equals 16.21/7.19 [2019-03-28 12:47:01,536 INFO L185 BlockEncoder]: Using Use SBE 16.21/7.19 [2019-03-28 12:47:01,594 INFO L200 BlockEncoder]: SBE split 27 edges 16.21/7.19 [2019-03-28 12:47:01,600 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility 16.21/7.19 [2019-03-28 12:47:01,602 INFO L71 MaximizeFinalStates]: 0 new accepting states 16.21/7.19 [2019-03-28 12:47:01,649 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding 16.21/7.19 [2019-03-28 12:47:01,652 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 16.21/7.19 [2019-03-28 12:47:01,654 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 16.21/7.19 [2019-03-28 12:47:01,654 INFO L71 MaximizeFinalStates]: 0 new accepting states 16.21/7.19 [2019-03-28 12:47:01,655 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 16.21/7.19 [2019-03-28 12:47:01,655 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 16.21/7.19 [2019-03-28 12:47:01,656 INFO L313 BlockEncoder]: Encoded RCFG 42 locations, 145 edges 16.21/7.19 [2019-03-28 12:47:01,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:47:01 BasicIcfg 16.21/7.19 [2019-03-28 12:47:01,657 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 16.21/7.19 [2019-03-28 12:47:01,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 16.21/7.19 [2019-03-28 12:47:01,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... 16.21/7.19 [2019-03-28 12:47:01,661 INFO L276 PluginConnector]: TraceAbstraction initialized 16.21/7.19 [2019-03-28 12:47:01,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:47:00" (1/4) ... 16.21/7.19 [2019-03-28 12:47:01,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e57d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:47:01, skipping insertion in model container 16.21/7.19 [2019-03-28 12:47:01,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:47:00" (2/4) ... 16.21/7.19 [2019-03-28 12:47:01,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e57d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:47:01, skipping insertion in model container 16.21/7.19 [2019-03-28 12:47:01,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:47:01" (3/4) ... 16.21/7.19 [2019-03-28 12:47:01,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58e57d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:47:01, skipping insertion in model container 16.21/7.19 [2019-03-28 12:47:01,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:47:01" (4/4) ... 16.21/7.19 [2019-03-28 12:47:01,665 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 16.21/7.19 [2019-03-28 12:47:01,675 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 16.21/7.19 [2019-03-28 12:47:01,683 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. 16.21/7.19 [2019-03-28 12:47:01,700 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. 16.21/7.19 [2019-03-28 12:47:01,729 INFO L133 ementStrategyFactory]: Using default assertion order modulation 16.21/7.19 [2019-03-28 12:47:01,730 INFO L382 AbstractCegarLoop]: Interprodecural is true 16.21/7.19 [2019-03-28 12:47:01,730 INFO L383 AbstractCegarLoop]: Hoare is true 16.21/7.19 [2019-03-28 12:47:01,730 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 16.21/7.19 [2019-03-28 12:47:01,731 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 16.21/7.19 [2019-03-28 12:47:01,731 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 16.21/7.19 [2019-03-28 12:47:01,731 INFO L387 AbstractCegarLoop]: Difference is false 16.21/7.19 [2019-03-28 12:47:01,731 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 16.21/7.19 [2019-03-28 12:47:01,731 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 16.21/7.19 [2019-03-28 12:47:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. 16.21/7.19 [2019-03-28 12:47:01,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 16.21/7.19 [2019-03-28 12:47:01,754 INFO L394 BasicCegarLoop]: Found error trace 16.21/7.19 [2019-03-28 12:47:01,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 16.21/7.19 [2019-03-28 12:47:01,755 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 16.21/7.19 [2019-03-28 12:47:01,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.21/7.19 [2019-03-28 12:47:01,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1183140613, now seen corresponding path program 1 times 16.21/7.19 [2019-03-28 12:47:01,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.21/7.19 [2019-03-28 12:47:01,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.21/7.19 [2019-03-28 12:47:01,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:01,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:01,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.21/7.19 [2019-03-28 12:47:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.21/7.19 [2019-03-28 12:47:01,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 16.21/7.19 [2019-03-28 12:47:01,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 16.21/7.19 [2019-03-28 12:47:01,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 16.21/7.19 [2019-03-28 12:47:01,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 16.21/7.19 [2019-03-28 12:47:01,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 16.21/7.19 [2019-03-28 12:47:01,935 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. 16.21/7.19 [2019-03-28 12:47:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 16.21/7.19 [2019-03-28 12:47:02,246 INFO L93 Difference]: Finished difference Result 81 states and 268 transitions. 16.21/7.19 [2019-03-28 12:47:02,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 16.21/7.19 [2019-03-28 12:47:02,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 16.21/7.19 [2019-03-28 12:47:02,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 16.21/7.19 [2019-03-28 12:47:02,283 INFO L225 Difference]: With dead ends: 81 16.21/7.19 [2019-03-28 12:47:02,283 INFO L226 Difference]: Without dead ends: 42 16.21/7.19 [2019-03-28 12:47:02,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 16.21/7.19 [2019-03-28 12:47:02,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. 16.21/7.19 [2019-03-28 12:47:02,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. 16.21/7.19 [2019-03-28 12:47:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 16.21/7.19 [2019-03-28 12:47:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 80 transitions. 16.21/7.19 [2019-03-28 12:47:02,328 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 80 transitions. Word has length 6 16.21/7.19 [2019-03-28 12:47:02,328 INFO L84 Accepts]: Finished accepts. word is rejected. 16.21/7.19 [2019-03-28 12:47:02,329 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 80 transitions. 16.21/7.19 [2019-03-28 12:47:02,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 16.21/7.19 [2019-03-28 12:47:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 80 transitions. 16.21/7.19 [2019-03-28 12:47:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 16.21/7.19 [2019-03-28 12:47:02,330 INFO L394 BasicCegarLoop]: Found error trace 16.21/7.19 [2019-03-28 12:47:02,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 16.21/7.19 [2019-03-28 12:47:02,330 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 16.21/7.19 [2019-03-28 12:47:02,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.21/7.19 [2019-03-28 12:47:02,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1182872494, now seen corresponding path program 1 times 16.21/7.19 [2019-03-28 12:47:02,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.21/7.19 [2019-03-28 12:47:02,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.21/7.19 [2019-03-28 12:47:02,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:02,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:02,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.21/7.19 [2019-03-28 12:47:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.21/7.19 [2019-03-28 12:47:02,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 16.21/7.19 [2019-03-28 12:47:02,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 16.21/7.19 [2019-03-28 12:47:02,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 16.21/7.19 [2019-03-28 12:47:02,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 16.21/7.19 [2019-03-28 12:47:02,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 16.21/7.19 [2019-03-28 12:47:02,370 INFO L87 Difference]: Start difference. First operand 42 states and 80 transitions. Second operand 3 states. 16.21/7.19 [2019-03-28 12:47:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 16.21/7.19 [2019-03-28 12:47:02,479 INFO L93 Difference]: Finished difference Result 42 states and 80 transitions. 16.21/7.19 [2019-03-28 12:47:02,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 16.21/7.19 [2019-03-28 12:47:02,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 16.21/7.19 [2019-03-28 12:47:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 16.21/7.19 [2019-03-28 12:47:02,481 INFO L225 Difference]: With dead ends: 42 16.21/7.19 [2019-03-28 12:47:02,481 INFO L226 Difference]: Without dead ends: 38 16.21/7.19 [2019-03-28 12:47:02,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 16.21/7.19 [2019-03-28 12:47:02,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. 16.21/7.19 [2019-03-28 12:47:02,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. 16.21/7.19 [2019-03-28 12:47:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. 16.21/7.19 [2019-03-28 12:47:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 72 transitions. 16.21/7.19 [2019-03-28 12:47:02,488 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 72 transitions. Word has length 6 16.21/7.19 [2019-03-28 12:47:02,488 INFO L84 Accepts]: Finished accepts. word is rejected. 16.21/7.19 [2019-03-28 12:47:02,488 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 72 transitions. 16.21/7.19 [2019-03-28 12:47:02,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 16.21/7.19 [2019-03-28 12:47:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 72 transitions. 16.21/7.19 [2019-03-28 12:47:02,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 16.21/7.19 [2019-03-28 12:47:02,489 INFO L394 BasicCegarLoop]: Found error trace 16.21/7.19 [2019-03-28 12:47:02,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 16.21/7.19 [2019-03-28 12:47:02,490 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 16.21/7.19 [2019-03-28 12:47:02,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.21/7.19 [2019-03-28 12:47:02,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1182872496, now seen corresponding path program 1 times 16.21/7.19 [2019-03-28 12:47:02,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.21/7.19 [2019-03-28 12:47:02,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.21/7.19 [2019-03-28 12:47:02,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:02,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:02,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.21/7.19 [2019-03-28 12:47:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.21/7.19 [2019-03-28 12:47:02,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 16.21/7.19 [2019-03-28 12:47:02,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 16.21/7.19 [2019-03-28 12:47:02,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 16.21/7.19 [2019-03-28 12:47:02,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 16.21/7.19 [2019-03-28 12:47:02,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 16.21/7.19 [2019-03-28 12:47:02,536 INFO L87 Difference]: Start difference. First operand 38 states and 72 transitions. Second operand 3 states. 16.21/7.19 [2019-03-28 12:47:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 16.21/7.19 [2019-03-28 12:47:02,734 INFO L93 Difference]: Finished difference Result 109 states and 207 transitions. 16.21/7.19 [2019-03-28 12:47:02,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 16.21/7.19 [2019-03-28 12:47:02,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 16.21/7.19 [2019-03-28 12:47:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 16.21/7.19 [2019-03-28 12:47:02,736 INFO L225 Difference]: With dead ends: 109 16.21/7.19 [2019-03-28 12:47:02,736 INFO L226 Difference]: Without dead ends: 74 16.21/7.19 [2019-03-28 12:47:02,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 16.21/7.19 [2019-03-28 12:47:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. 16.21/7.19 [2019-03-28 12:47:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 47. 16.21/7.19 [2019-03-28 12:47:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 16.21/7.19 [2019-03-28 12:47:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 96 transitions. 16.21/7.19 [2019-03-28 12:47:02,746 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 96 transitions. Word has length 6 16.21/7.19 [2019-03-28 12:47:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. 16.21/7.19 [2019-03-28 12:47:02,746 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 96 transitions. 16.21/7.19 [2019-03-28 12:47:02,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 16.21/7.19 [2019-03-28 12:47:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 96 transitions. 16.21/7.19 [2019-03-28 12:47:02,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 16.21/7.19 [2019-03-28 12:47:02,747 INFO L394 BasicCegarLoop]: Found error trace 16.21/7.19 [2019-03-28 12:47:02,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 16.21/7.19 [2019-03-28 12:47:02,747 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 16.21/7.19 [2019-03-28 12:47:02,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.21/7.19 [2019-03-28 12:47:02,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1182932078, now seen corresponding path program 1 times 16.21/7.19 [2019-03-28 12:47:02,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.21/7.19 [2019-03-28 12:47:02,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.21/7.19 [2019-03-28 12:47:02,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:02,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:02,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.21/7.19 [2019-03-28 12:47:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.21/7.19 [2019-03-28 12:47:02,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 16.21/7.19 [2019-03-28 12:47:02,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 16.21/7.19 [2019-03-28 12:47:02,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 16.21/7.19 [2019-03-28 12:47:02,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 16.21/7.19 [2019-03-28 12:47:02,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 16.21/7.19 [2019-03-28 12:47:02,795 INFO L87 Difference]: Start difference. First operand 47 states and 96 transitions. Second operand 4 states. 16.21/7.19 [2019-03-28 12:47:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 16.21/7.19 [2019-03-28 12:47:02,966 INFO L93 Difference]: Finished difference Result 51 states and 96 transitions. 16.21/7.19 [2019-03-28 12:47:02,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 16.21/7.19 [2019-03-28 12:47:02,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 16.21/7.19 [2019-03-28 12:47:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 16.21/7.19 [2019-03-28 12:47:02,969 INFO L225 Difference]: With dead ends: 51 16.21/7.19 [2019-03-28 12:47:02,969 INFO L226 Difference]: Without dead ends: 47 16.21/7.19 [2019-03-28 12:47:02,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 16.21/7.19 [2019-03-28 12:47:02,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. 16.21/7.19 [2019-03-28 12:47:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. 16.21/7.19 [2019-03-28 12:47:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. 16.21/7.19 [2019-03-28 12:47:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 88 transitions. 16.21/7.19 [2019-03-28 12:47:02,975 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 88 transitions. Word has length 6 16.21/7.19 [2019-03-28 12:47:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. 16.21/7.19 [2019-03-28 12:47:02,975 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 88 transitions. 16.21/7.19 [2019-03-28 12:47:02,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 16.21/7.19 [2019-03-28 12:47:02,975 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 88 transitions. 16.21/7.19 [2019-03-28 12:47:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 16.21/7.19 [2019-03-28 12:47:02,976 INFO L394 BasicCegarLoop]: Found error trace 16.21/7.19 [2019-03-28 12:47:02,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 16.21/7.19 [2019-03-28 12:47:02,976 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 16.21/7.19 [2019-03-28 12:47:02,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.21/7.19 [2019-03-28 12:47:02,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1182932079, now seen corresponding path program 1 times 16.21/7.19 [2019-03-28 12:47:02,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.21/7.19 [2019-03-28 12:47:02,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.21/7.19 [2019-03-28 12:47:02,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:02,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:02,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.21/7.19 [2019-03-28 12:47:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.21/7.19 [2019-03-28 12:47:03,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 16.21/7.19 [2019-03-28 12:47:03,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 16.21/7.19 [2019-03-28 12:47:03,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 16.21/7.19 [2019-03-28 12:47:03,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 16.21/7.19 [2019-03-28 12:47:03,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 16.21/7.19 [2019-03-28 12:47:03,003 INFO L87 Difference]: Start difference. First operand 47 states and 88 transitions. Second operand 3 states. 16.21/7.19 [2019-03-28 12:47:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 16.21/7.19 [2019-03-28 12:47:03,146 INFO L93 Difference]: Finished difference Result 88 states and 164 transitions. 16.21/7.19 [2019-03-28 12:47:03,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 16.21/7.19 [2019-03-28 12:47:03,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 16.21/7.19 [2019-03-28 12:47:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 16.21/7.19 [2019-03-28 12:47:03,148 INFO L225 Difference]: With dead ends: 88 16.21/7.19 [2019-03-28 12:47:03,148 INFO L226 Difference]: Without dead ends: 85 16.21/7.19 [2019-03-28 12:47:03,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 16.21/7.19 [2019-03-28 12:47:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. 16.21/7.19 [2019-03-28 12:47:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. 16.21/7.19 [2019-03-28 12:47:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. 16.21/7.19 [2019-03-28 12:47:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 104 transitions. 16.21/7.19 [2019-03-28 12:47:03,156 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 104 transitions. Word has length 6 16.21/7.19 [2019-03-28 12:47:03,157 INFO L84 Accepts]: Finished accepts. word is rejected. 16.21/7.19 [2019-03-28 12:47:03,157 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 104 transitions. 16.21/7.19 [2019-03-28 12:47:03,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 16.21/7.19 [2019-03-28 12:47:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 104 transitions. 16.21/7.19 [2019-03-28 12:47:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 16.21/7.19 [2019-03-28 12:47:03,158 INFO L394 BasicCegarLoop]: Found error trace 16.21/7.19 [2019-03-28 12:47:03,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 16.21/7.19 [2019-03-28 12:47:03,158 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 16.21/7.19 [2019-03-28 12:47:03,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.21/7.19 [2019-03-28 12:47:03,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1182933126, now seen corresponding path program 1 times 16.21/7.19 [2019-03-28 12:47:03,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.21/7.19 [2019-03-28 12:47:03,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.21/7.19 [2019-03-28 12:47:03,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:03,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:03,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.21/7.19 [2019-03-28 12:47:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.21/7.19 [2019-03-28 12:47:03,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 16.21/7.19 [2019-03-28 12:47:03,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 16.21/7.19 [2019-03-28 12:47:03,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 16.21/7.19 [2019-03-28 12:47:03,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 16.21/7.19 [2019-03-28 12:47:03,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 16.21/7.19 [2019-03-28 12:47:03,187 INFO L87 Difference]: Start difference. First operand 57 states and 104 transitions. Second operand 4 states. 16.21/7.19 [2019-03-28 12:47:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 16.21/7.19 [2019-03-28 12:47:03,292 INFO L93 Difference]: Finished difference Result 85 states and 158 transitions. 16.21/7.19 [2019-03-28 12:47:03,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 16.21/7.19 [2019-03-28 12:47:03,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 16.21/7.19 [2019-03-28 12:47:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 16.21/7.19 [2019-03-28 12:47:03,294 INFO L225 Difference]: With dead ends: 85 16.21/7.19 [2019-03-28 12:47:03,294 INFO L226 Difference]: Without dead ends: 59 16.21/7.19 [2019-03-28 12:47:03,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 16.21/7.19 [2019-03-28 12:47:03,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. 16.21/7.19 [2019-03-28 12:47:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. 16.21/7.19 [2019-03-28 12:47:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. 16.21/7.19 [2019-03-28 12:47:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 102 transitions. 16.21/7.19 [2019-03-28 12:47:03,302 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 102 transitions. Word has length 6 16.21/7.19 [2019-03-28 12:47:03,302 INFO L84 Accepts]: Finished accepts. word is rejected. 16.21/7.19 [2019-03-28 12:47:03,302 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 102 transitions. 16.21/7.19 [2019-03-28 12:47:03,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 16.21/7.19 [2019-03-28 12:47:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 102 transitions. 16.21/7.19 [2019-03-28 12:47:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 16.21/7.19 [2019-03-28 12:47:03,303 INFO L394 BasicCegarLoop]: Found error trace 16.21/7.19 [2019-03-28 12:47:03,303 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] 16.21/7.19 [2019-03-28 12:47:03,304 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 16.21/7.19 [2019-03-28 12:47:03,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.21/7.19 [2019-03-28 12:47:03,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1071726976, now seen corresponding path program 1 times 16.21/7.19 [2019-03-28 12:47:03,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.21/7.19 [2019-03-28 12:47:03,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.21/7.19 [2019-03-28 12:47:03,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:03,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:03,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 16.21/7.19 [2019-03-28 12:47:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 16.21/7.19 [2019-03-28 12:47:03,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 16.21/7.19 [2019-03-28 12:47:03,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 16.21/7.19 [2019-03-28 12:47:03,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 16.21/7.19 [2019-03-28 12:47:03,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 16.21/7.19 [2019-03-28 12:47:03,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 16.21/7.19 [2019-03-28 12:47:03,335 INFO L87 Difference]: Start difference. First operand 57 states and 102 transitions. Second operand 4 states. 16.21/7.19 [2019-03-28 12:47:03,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 16.21/7.19 [2019-03-28 12:47:03,417 INFO L93 Difference]: Finished difference Result 59 states and 104 transitions. 16.21/7.19 [2019-03-28 12:47:03,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 16.21/7.19 [2019-03-28 12:47:03,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 16.21/7.19 [2019-03-28 12:47:03,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 16.21/7.19 [2019-03-28 12:47:03,418 INFO L225 Difference]: With dead ends: 59 16.21/7.19 [2019-03-28 12:47:03,419 INFO L226 Difference]: Without dead ends: 56 16.21/7.19 [2019-03-28 12:47:03,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 16.21/7.19 [2019-03-28 12:47:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. 16.21/7.19 [2019-03-28 12:47:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. 16.21/7.19 [2019-03-28 12:47:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. 16.21/7.19 [2019-03-28 12:47:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 84 transitions. 16.21/7.19 [2019-03-28 12:47:03,425 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 84 transitions. Word has length 10 16.21/7.19 [2019-03-28 12:47:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. 16.21/7.19 [2019-03-28 12:47:03,425 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 84 transitions. 16.21/7.19 [2019-03-28 12:47:03,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 16.21/7.19 [2019-03-28 12:47:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 84 transitions. 16.21/7.19 [2019-03-28 12:47:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 16.21/7.19 [2019-03-28 12:47:03,426 INFO L394 BasicCegarLoop]: Found error trace 16.21/7.19 [2019-03-28 12:47:03,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 16.21/7.19 [2019-03-28 12:47:03,426 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION]=== 16.21/7.19 [2019-03-28 12:47:03,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 16.21/7.19 [2019-03-28 12:47:03,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1071725929, now seen corresponding path program 1 times 16.21/7.19 [2019-03-28 12:47:03,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 16.21/7.19 [2019-03-28 12:47:03,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 16.21/7.19 [2019-03-28 12:47:03,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:03,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:03,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 16.21/7.19 [2019-03-28 12:47:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.21/7.19 [2019-03-28 12:47:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 16.21/7.19 [2019-03-28 12:47:03,487 INFO L469 BasicCegarLoop]: Counterexample might be feasible 16.21/7.19 [2019-03-28 12:47:03,510 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 16.21/7.19 [2019-03-28 12:47:03,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:47:03 BasicIcfg 16.21/7.19 [2019-03-28 12:47:03,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 16.21/7.19 [2019-03-28 12:47:03,514 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 16.21/7.19 [2019-03-28 12:47:03,514 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 16.21/7.19 [2019-03-28 12:47:03,517 INFO L276 PluginConnector]: BuchiAutomizer initialized 16.21/7.19 [2019-03-28 12:47:03,518 INFO L99 BuchiAutomizer]: Another Plugin discovered errors, I will not analyze termination 16.21/7.19 [2019-03-28 12:47:03,518 INFO L99 BuchiAutomizer]: Another Plugin discovered errors, I will not analyze termination 16.21/7.19 [2019-03-28 12:47:03,518 INFO L99 BuchiAutomizer]: Another Plugin discovered errors, I will not analyze termination 16.21/7.19 [2019-03-28 12:47:03,518 INFO L99 BuchiAutomizer]: Another Plugin discovered errors, I will not analyze termination 16.21/7.19 [2019-03-28 12:47:03,518 INFO L99 BuchiAutomizer]: Another Plugin discovered errors, I will not analyze termination 16.21/7.19 [2019-03-28 12:47:03,518 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 16.21/7.19 [2019-03-28 12:47:03,519 INFO L168 Benchmark]: Toolchain (without parser) took 2847.19 ms. Allocated memory was 649.6 MB in the beginning and 748.7 MB in the end (delta: 99.1 MB). Free memory was 558.5 MB in the beginning and 701.5 MB in the end (delta: -143.0 MB). There was no memory consumed. Max. memory is 50.3 GB. 16.21/7.19 [2019-03-28 12:47:03,520 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 16.21/7.19 [2019-03-28 12:47:03,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.23 ms. Allocated memory was 649.6 MB in the beginning and 682.1 MB in the end (delta: 32.5 MB). Free memory was 558.5 MB in the beginning and 646.5 MB in the end (delta: -88.1 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 16.21/7.19 [2019-03-28 12:47:03,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.74 ms. Allocated memory is still 682.1 MB. Free memory was 646.5 MB in the beginning and 645.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 16.21/7.19 [2019-03-28 12:47:03,522 INFO L168 Benchmark]: Boogie Preprocessor took 28.53 ms. Allocated memory is still 682.1 MB. Free memory was 645.2 MB in the beginning and 642.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 16.21/7.19 [2019-03-28 12:47:03,523 INFO L168 Benchmark]: RCFGBuilder took 404.96 ms. Allocated memory is still 682.1 MB. Free memory was 642.5 MB in the beginning and 616.1 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 50.3 GB. 16.21/7.19 [2019-03-28 12:47:03,524 INFO L168 Benchmark]: BlockEncodingV2 took 188.05 ms. Allocated memory is still 682.1 MB. Free memory was 616.1 MB in the beginning and 601.3 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. 16.21/7.19 [2019-03-28 12:47:03,524 INFO L168 Benchmark]: TraceAbstraction took 1855.76 ms. Allocated memory was 682.1 MB in the beginning and 748.7 MB in the end (delta: 66.6 MB). Free memory was 601.3 MB in the beginning and 705.5 MB in the end (delta: -104.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 16.21/7.19 [2019-03-28 12:47:03,525 INFO L168 Benchmark]: BuchiAutomizer took 4.53 ms. Allocated memory is still 748.7 MB. Free memory was 705.5 MB in the beginning and 701.5 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 50.3 GB. 16.21/7.19 [2019-03-28 12:47:03,529 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 16.21/7.19 --- Results --- 16.21/7.19 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 16.21/7.19 - StatisticsResult: Initial Icfg 16.21/7.19 52 locations, 59 edges 16.21/7.19 - StatisticsResult: Encoded RCFG 16.21/7.19 42 locations, 145 edges 16.21/7.19 * Results from de.uni_freiburg.informatik.ultimate.core: 16.21/7.19 - StatisticsResult: Toolchain Benchmarks 16.21/7.19 Benchmark results are: 16.21/7.19 * CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 16.21/7.19 * CACSL2BoogieTranslator took 315.23 ms. Allocated memory was 649.6 MB in the beginning and 682.1 MB in the end (delta: 32.5 MB). Free memory was 558.5 MB in the beginning and 646.5 MB in the end (delta: -88.1 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. 16.21/7.19 * Boogie Procedure Inliner took 44.74 ms. Allocated memory is still 682.1 MB. Free memory was 646.5 MB in the beginning and 645.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. 16.21/7.19 * Boogie Preprocessor took 28.53 ms. Allocated memory is still 682.1 MB. Free memory was 645.2 MB in the beginning and 642.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 16.21/7.19 * RCFGBuilder took 404.96 ms. Allocated memory is still 682.1 MB. Free memory was 642.5 MB in the beginning and 616.1 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 50.3 GB. 16.21/7.19 * BlockEncodingV2 took 188.05 ms. Allocated memory is still 682.1 MB. Free memory was 616.1 MB in the beginning and 601.3 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 50.3 GB. 16.21/7.19 * TraceAbstraction took 1855.76 ms. Allocated memory was 682.1 MB in the beginning and 748.7 MB in the end (delta: 66.6 MB). Free memory was 601.3 MB in the beginning and 705.5 MB in the end (delta: -104.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 16.21/7.19 * BuchiAutomizer took 4.53 ms. Allocated memory is still 748.7 MB. Free memory was 705.5 MB in the beginning and 701.5 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 50.3 GB. 16.21/7.19 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 16.21/7.19 - CounterExampleResult [Line: 16]: pointer dereference may fail 16.21/7.19 pointer dereference may fail 16.21/7.19 We found a FailurePath: 16.21/7.19 [L5] int i, j, tmp; 16.21/7.19 [L6] int length = __VERIFIER_nondet_int(); 16.21/7.19 [L7] COND TRUE length < 1 16.21/7.19 [L7] length = 1 16.21/7.19 [L9] COND FALSE !(length % 2 == 0) 16.21/7.19 [L10] int *arr = alloca(length*sizeof(int)); 16.21/7.19 [L12] i=0 16.21/7.19 [L12] COND TRUE i