/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 05:43:42,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 05:43:42,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 05:43:42,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 05:43:42,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 05:43:42,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 05:43:42,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 05:43:42,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 05:43:42,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 05:43:42,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 05:43:42,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 05:43:42,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 05:43:42,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 05:43:42,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 05:43:42,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 05:43:42,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 05:43:42,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 05:43:42,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 05:43:42,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 05:43:42,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 05:43:42,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 05:43:42,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 05:43:42,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 05:43:42,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 05:43:42,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 05:43:42,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 05:43:42,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 05:43:42,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 05:43:42,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 05:43:42,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 05:43:42,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 05:43:42,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 05:43:42,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 05:43:42,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 05:43:42,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 05:43:42,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 05:43:42,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 05:43:42,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 05:43:42,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 05:43:42,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 05:43:42,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 05:43:42,243 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 05:43:42,268 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 05:43:42,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 05:43:42,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 05:43:42,272 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 05:43:42,272 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 05:43:42,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 05:43:42,272 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 05:43:42,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 05:43:42,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 05:43:42,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 05:43:42,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 05:43:42,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 05:43:42,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 05:43:42,275 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 05:43:42,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 05:43:42,275 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 05:43:42,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 05:43:42,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 05:43:42,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 05:43:42,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 05:43:42,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 05:43:42,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 05:43:42,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 05:43:42,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 05:43:42,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 05:43:42,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 05:43:42,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 05:43:42,278 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 05:43:42,278 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 05:43:42,278 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 05:43:42,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 05:43:42,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 05:43:42,616 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 05:43:42,618 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 05:43:42,618 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 05:43:42,619 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c [2020-07-20 05:43:42,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f92864e4e/4d1230830f944ad3b38563a30fd0c1ff/FLAGa6f24602a [2020-07-20 05:43:43,219 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 05:43:43,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c [2020-07-20 05:43:43,228 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f92864e4e/4d1230830f944ad3b38563a30fd0c1ff/FLAGa6f24602a [2020-07-20 05:43:43,633 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f92864e4e/4d1230830f944ad3b38563a30fd0c1ff [2020-07-20 05:43:43,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 05:43:43,651 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 05:43:43,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 05:43:43,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 05:43:43,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 05:43:43,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:43:43" (1/1) ... [2020-07-20 05:43:43,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eea5cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:43, skipping insertion in model container [2020-07-20 05:43:43,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:43:43" (1/1) ... [2020-07-20 05:43:43,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 05:43:43,695 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 05:43:43,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:43:43,901 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 05:43:43,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 05:43:43,944 INFO L208 MainTranslator]: Completed translation [2020-07-20 05:43:43,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:43 WrapperNode [2020-07-20 05:43:43,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 05:43:43,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 05:43:43,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 05:43:43,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 05:43:43,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:43" (1/1) ... [2020-07-20 05:43:43,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:43" (1/1) ... [2020-07-20 05:43:43,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:43" (1/1) ... [2020-07-20 05:43:43,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:43" (1/1) ... [2020-07-20 05:43:44,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:43" (1/1) ... [2020-07-20 05:43:44,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:43" (1/1) ... [2020-07-20 05:43:44,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:43" (1/1) ... [2020-07-20 05:43:44,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 05:43:44,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 05:43:44,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 05:43:44,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 05:43:44,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 05:43:44,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 05:43:44,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 05:43:44,188 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-20 05:43:44,188 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-20 05:43:44,188 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 05:43:44,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 05:43:44,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 05:43:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-20 05:43:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-20 05:43:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 05:43:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 05:43:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 05:43:44,479 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 05:43:44,479 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 05:43:44,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:43:44 BoogieIcfgContainer [2020-07-20 05:43:44,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 05:43:44,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 05:43:44,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 05:43:44,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 05:43:44,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:43:43" (1/3) ... [2020-07-20 05:43:44,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354f1501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:43:44, skipping insertion in model container [2020-07-20 05:43:44,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:43:43" (2/3) ... [2020-07-20 05:43:44,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354f1501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:43:44, skipping insertion in model container [2020-07-20 05:43:44,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:43:44" (3/3) ... [2020-07-20 05:43:44,495 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2020-07-20 05:43:44,510 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 05:43:44,520 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 05:43:44,537 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 05:43:44,600 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 05:43:44,600 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 05:43:44,600 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 05:43:44,600 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 05:43:44,601 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 05:43:44,601 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 05:43:44,601 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 05:43:44,604 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 05:43:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-20 05:43:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 05:43:44,677 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:44,678 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:44,678 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:44,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:44,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-07-20 05:43:44,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:44,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749199525] [2020-07-20 05:43:44,726 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5fca7099 [2020-07-20 05:43:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:43:44,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749199525] [2020-07-20 05:43:44,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:43:44,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:43:44,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124650387] [2020-07-20 05:43:44,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:43:44,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:44,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:43:44,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:43:44,998 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-20 05:43:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:45,129 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-20 05:43:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:43:45,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-20 05:43:45,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:45,143 INFO L225 Difference]: With dead ends: 44 [2020-07-20 05:43:45,144 INFO L226 Difference]: Without dead ends: 30 [2020-07-20 05:43:45,152 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 05:43:45,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-20 05:43:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-20 05:43:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-20 05:43:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-20 05:43:45,203 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-07-20 05:43:45,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:45,203 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-20 05:43:45,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:43:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-20 05:43:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 05:43:45,206 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:45,206 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:45,207 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 05:43:45,207 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:45,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-07-20 05:43:45,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:45,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460063674] [2020-07-20 05:43:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5fca7099 [2020-07-20 05:43:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 05:43:45,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460063674] [2020-07-20 05:43:45,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 05:43:45,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 05:43:45,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207201494] [2020-07-20 05:43:45,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 05:43:45,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:45,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 05:43:45,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 05:43:45,287 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-07-20 05:43:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:45,369 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-20 05:43:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 05:43:45,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 05:43:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:45,372 INFO L225 Difference]: With dead ends: 36 [2020-07-20 05:43:45,372 INFO L226 Difference]: Without dead ends: 32 [2020-07-20 05:43:45,374 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 05:43:45,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-20 05:43:45,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-20 05:43:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-20 05:43:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-20 05:43:45,386 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-07-20 05:43:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:45,387 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-20 05:43:45,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 05:43:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-20 05:43:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 05:43:45,390 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:45,390 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:45,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 05:43:45,391 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:45,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:45,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-07-20 05:43:45,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:45,392 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575714306] [2020-07-20 05:43:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5fca7099 [2020-07-20 05:43:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-20 05:43:45,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575714306] [2020-07-20 05:43:45,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492090754] [2020-07-20 05:43:45,533 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5583f90a No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:45,592 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5583f90a issued 3 check-sat command(s) [2020-07-20 05:43:45,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:45,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 05:43:45,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-20 05:43:45,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:45,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-20 05:43:45,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627915246] [2020-07-20 05:43:45,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-20 05:43:45,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:45,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-20 05:43:45,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-20 05:43:45,697 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-07-20 05:43:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:45,961 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-20 05:43:45,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 05:43:45,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-20 05:43:45,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:45,964 INFO L225 Difference]: With dead ends: 58 [2020-07-20 05:43:45,964 INFO L226 Difference]: Without dead ends: 34 [2020-07-20 05:43:45,966 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-20 05:43:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-20 05:43:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-20 05:43:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-20 05:43:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-20 05:43:45,975 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-07-20 05:43:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:45,976 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-20 05:43:45,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-20 05:43:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-20 05:43:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 05:43:45,978 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:45,978 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:46,192 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-20 05:43:46,192 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:46,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:46,194 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-07-20 05:43:46,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:46,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071962079] [2020-07-20 05:43:46,195 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5fca7099 [2020-07-20 05:43:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-20 05:43:46,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071962079] [2020-07-20 05:43:46,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17936596] [2020-07-20 05:43:46,323 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@29eb3798 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:46,356 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@29eb3798 issued 3 check-sat command(s) [2020-07-20 05:43:46,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:46,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 05:43:46,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-20 05:43:46,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:46,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-20 05:43:46,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347825763] [2020-07-20 05:43:46,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 05:43:46,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:46,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 05:43:46,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-20 05:43:46,401 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 9 states. [2020-07-20 05:43:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:46,589 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-07-20 05:43:46,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 05:43:46,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-20 05:43:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:46,594 INFO L225 Difference]: With dead ends: 54 [2020-07-20 05:43:46,594 INFO L226 Difference]: Without dead ends: 50 [2020-07-20 05:43:46,595 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-20 05:43:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-20 05:43:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-20 05:43:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-20 05:43:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-07-20 05:43:46,608 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-07-20 05:43:46,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:46,609 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-07-20 05:43:46,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 05:43:46,609 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-07-20 05:43:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-20 05:43:46,611 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:46,612 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:46,827 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:46,828 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:46,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:46,829 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-07-20 05:43:46,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:46,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366528113] [2020-07-20 05:43:46,830 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5fca7099 [2020-07-20 05:43:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-20 05:43:46,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366528113] [2020-07-20 05:43:46,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736470456] [2020-07-20 05:43:46,981 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5a4955a2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:47,029 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5a4955a2 issued 3 check-sat command(s) [2020-07-20 05:43:47,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:47,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 05:43:47,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-20 05:43:47,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:47,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-07-20 05:43:47,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891205602] [2020-07-20 05:43:47,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 05:43:47,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:47,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 05:43:47,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-20 05:43:47,113 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 11 states. [2020-07-20 05:43:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:47,490 INFO L93 Difference]: Finished difference Result 108 states and 170 transitions. [2020-07-20 05:43:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 05:43:47,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-20 05:43:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:47,501 INFO L225 Difference]: With dead ends: 108 [2020-07-20 05:43:47,501 INFO L226 Difference]: Without dead ends: 66 [2020-07-20 05:43:47,507 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-07-20 05:43:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-20 05:43:47,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-20 05:43:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-20 05:43:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2020-07-20 05:43:47,538 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2020-07-20 05:43:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:47,539 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2020-07-20 05:43:47,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 05:43:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-07-20 05:43:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-20 05:43:47,544 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:47,545 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:47,757 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:47,758 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:47,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:47,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-07-20 05:43:47,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:47,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735191376] [2020-07-20 05:43:47,760 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5fca7099 [2020-07-20 05:43:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-20 05:43:47,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735191376] [2020-07-20 05:43:47,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110184330] [2020-07-20 05:43:47,904 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4425c142 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:47,954 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4425c142 issued 3 check-sat command(s) [2020-07-20 05:43:47,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:47,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 05:43:47,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-20 05:43:48,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:48,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-20 05:43:48,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894583667] [2020-07-20 05:43:48,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 05:43:48,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:48,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 05:43:48,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-20 05:43:48,031 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand 13 states. [2020-07-20 05:43:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:48,468 INFO L93 Difference]: Finished difference Result 180 states and 324 transitions. [2020-07-20 05:43:48,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-20 05:43:48,468 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-20 05:43:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:48,472 INFO L225 Difference]: With dead ends: 180 [2020-07-20 05:43:48,473 INFO L226 Difference]: Without dead ends: 120 [2020-07-20 05:43:48,475 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-07-20 05:43:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-20 05:43:48,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2020-07-20 05:43:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-20 05:43:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 169 transitions. [2020-07-20 05:43:48,505 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 169 transitions. Word has length 40 [2020-07-20 05:43:48,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:48,505 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 169 transitions. [2020-07-20 05:43:48,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 05:43:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 169 transitions. [2020-07-20 05:43:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-20 05:43:48,509 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:48,510 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:48,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:48,725 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:48,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:48,726 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-07-20 05:43:48,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:48,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138299831] [2020-07-20 05:43:48,728 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5fca7099 [2020-07-20 05:43:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-20 05:43:48,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138299831] [2020-07-20 05:43:48,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139006943] [2020-07-20 05:43:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@50bbe4a3 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:48,946 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@50bbe4a3 issued 3 check-sat command(s) [2020-07-20 05:43:48,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:48,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 05:43:48,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-20 05:43:49,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:49,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-07-20 05:43:49,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900366746] [2020-07-20 05:43:49,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-20 05:43:49,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:49,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-20 05:43:49,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-20 05:43:49,086 INFO L87 Difference]: Start difference. First operand 106 states and 169 transitions. Second operand 14 states. [2020-07-20 05:43:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:49,702 INFO L93 Difference]: Finished difference Result 258 states and 498 transitions. [2020-07-20 05:43:49,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-20 05:43:49,703 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-07-20 05:43:49,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:49,708 INFO L225 Difference]: With dead ends: 258 [2020-07-20 05:43:49,708 INFO L226 Difference]: Without dead ends: 158 [2020-07-20 05:43:49,710 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-07-20 05:43:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-20 05:43:49,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2020-07-20 05:43:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-20 05:43:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 180 transitions. [2020-07-20 05:43:49,740 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 180 transitions. Word has length 54 [2020-07-20 05:43:49,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:49,740 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 180 transitions. [2020-07-20 05:43:49,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-20 05:43:49,741 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 180 transitions. [2020-07-20 05:43:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-20 05:43:49,745 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:49,745 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:49,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-20 05:43:49,959 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:49,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1504181040, now seen corresponding path program 1 times [2020-07-20 05:43:49,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:49,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117185036] [2020-07-20 05:43:49,962 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5fca7099 [2020-07-20 05:43:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:50,278 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-07-20 05:43:50,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117185036] [2020-07-20 05:43:50,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156873528] [2020-07-20 05:43:50,279 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d20be70 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:50,341 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d20be70 issued 3 check-sat command(s) [2020-07-20 05:43:50,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:50,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 05:43:50,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-20 05:43:50,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:50,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-07-20 05:43:50,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282438733] [2020-07-20 05:43:50,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 05:43:50,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:50,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 05:43:50,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-07-20 05:43:50,465 INFO L87 Difference]: Start difference. First operand 112 states and 180 transitions. Second operand 16 states. [2020-07-20 05:43:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:51,136 INFO L93 Difference]: Finished difference Result 243 states and 465 transitions. [2020-07-20 05:43:51,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-20 05:43:51,142 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2020-07-20 05:43:51,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:51,144 INFO L225 Difference]: With dead ends: 243 [2020-07-20 05:43:51,145 INFO L226 Difference]: Without dead ends: 110 [2020-07-20 05:43:51,147 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2020-07-20 05:43:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-20 05:43:51,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2020-07-20 05:43:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-20 05:43:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2020-07-20 05:43:51,165 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 82 [2020-07-20 05:43:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:51,166 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2020-07-20 05:43:51,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 05:43:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2020-07-20 05:43:51,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-20 05:43:51,169 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:51,170 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:51,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:51,385 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:51,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:51,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2095197631, now seen corresponding path program 1 times [2020-07-20 05:43:51,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:51,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778295760] [2020-07-20 05:43:51,388 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5fca7099 [2020-07-20 05:43:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 61 proven. 94 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2020-07-20 05:43:51,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778295760] [2020-07-20 05:43:51,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724449966] [2020-07-20 05:43:51,834 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@262cc1fa No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:51,909 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@262cc1fa issued 3 check-sat command(s) [2020-07-20 05:43:51,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:51,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 05:43:51,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2020-07-20 05:43:52,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:52,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2020-07-20 05:43:52,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483768915] [2020-07-20 05:43:52,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 05:43:52,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:52,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 05:43:52,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-07-20 05:43:52,060 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 17 states. [2020-07-20 05:43:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:52,801 INFO L93 Difference]: Finished difference Result 217 states and 375 transitions. [2020-07-20 05:43:52,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-20 05:43:52,802 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 123 [2020-07-20 05:43:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:52,805 INFO L225 Difference]: With dead ends: 217 [2020-07-20 05:43:52,805 INFO L226 Difference]: Without dead ends: 137 [2020-07-20 05:43:52,807 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2020-07-20 05:43:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-20 05:43:52,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2020-07-20 05:43:52,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-20 05:43:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2020-07-20 05:43:52,826 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 123 [2020-07-20 05:43:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:52,827 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2020-07-20 05:43:52,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 05:43:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2020-07-20 05:43:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-07-20 05:43:52,831 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:52,831 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:53,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:53,047 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:53,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:53,049 INFO L82 PathProgramCache]: Analyzing trace with hash 466415905, now seen corresponding path program 1 times [2020-07-20 05:43:53,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:53,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631936287] [2020-07-20 05:43:53,050 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5fca7099 [2020-07-20 05:43:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 165 proven. 262 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2020-07-20 05:43:53,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631936287] [2020-07-20 05:43:53,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206897712] [2020-07-20 05:43:53,661 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@73bf99b0 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:53,760 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@73bf99b0 issued 3 check-sat command(s) [2020-07-20 05:43:53,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:53,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 05:43:53,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 77 proven. 418 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2020-07-20 05:43:54,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:54,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2020-07-20 05:43:54,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256881219] [2020-07-20 05:43:54,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-20 05:43:54,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:54,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-20 05:43:54,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2020-07-20 05:43:54,016 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand 18 states. [2020-07-20 05:43:54,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:54,944 INFO L93 Difference]: Finished difference Result 263 states and 450 transitions. [2020-07-20 05:43:54,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-20 05:43:54,944 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 231 [2020-07-20 05:43:54,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:54,950 INFO L225 Difference]: With dead ends: 263 [2020-07-20 05:43:54,950 INFO L226 Difference]: Without dead ends: 158 [2020-07-20 05:43:54,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2020-07-20 05:43:54,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-20 05:43:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2020-07-20 05:43:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-07-20 05:43:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 227 transitions. [2020-07-20 05:43:55,005 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 227 transitions. Word has length 231 [2020-07-20 05:43:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:55,007 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 227 transitions. [2020-07-20 05:43:55,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-20 05:43:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 227 transitions. [2020-07-20 05:43:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2020-07-20 05:43:55,021 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:55,021 INFO L422 BasicCegarLoop]: trace histogram [28, 28, 25, 25, 21, 21, 14, 14, 14, 14, 14, 14, 14, 12, 12, 12, 12, 12, 12, 12, 9, 7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:55,236 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-20 05:43:55,237 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:55,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:55,238 INFO L82 PathProgramCache]: Analyzing trace with hash -80201483, now seen corresponding path program 2 times [2020-07-20 05:43:55,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:55,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282202648] [2020-07-20 05:43:55,239 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5fca7099 [2020-07-20 05:43:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 243 proven. 571 refuted. 0 times theorem prover too weak. 2946 trivial. 0 not checked. [2020-07-20 05:43:56,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282202648] [2020-07-20 05:43:56,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797061445] [2020-07-20 05:43:56,164 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f22cc96 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:56,276 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@3f22cc96 issued 3 check-sat command(s) [2020-07-20 05:43:56,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:56,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 05:43:56,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 193 proven. 574 refuted. 0 times theorem prover too weak. 2993 trivial. 0 not checked. [2020-07-20 05:43:56,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:56,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2020-07-20 05:43:56,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812664963] [2020-07-20 05:43:56,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 05:43:56,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:56,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 05:43:56,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-07-20 05:43:56,458 INFO L87 Difference]: Start difference. First operand 148 states and 227 transitions. Second operand 17 states. [2020-07-20 05:43:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:43:57,163 INFO L93 Difference]: Finished difference Result 326 states and 537 transitions. [2020-07-20 05:43:57,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-20 05:43:57,164 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 367 [2020-07-20 05:43:57,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:43:57,168 INFO L225 Difference]: With dead ends: 326 [2020-07-20 05:43:57,168 INFO L226 Difference]: Without dead ends: 191 [2020-07-20 05:43:57,170 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2020-07-20 05:43:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-07-20 05:43:57,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 148. [2020-07-20 05:43:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-07-20 05:43:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2020-07-20 05:43:57,187 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 367 [2020-07-20 05:43:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:43:57,188 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2020-07-20 05:43:57,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 05:43:57,188 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2020-07-20 05:43:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-20 05:43:57,204 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:43:57,205 INFO L422 BasicCegarLoop]: trace histogram [35, 35, 32, 32, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:43:57,418 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:57,419 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:43:57,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:43:57,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1329598340, now seen corresponding path program 3 times [2020-07-20 05:43:57,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:43:57,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172630689] [2020-07-20 05:43:57,421 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5fca7099 [2020-07-20 05:43:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:43:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 855 proven. 965 refuted. 0 times theorem prover too weak. 4270 trivial. 0 not checked. [2020-07-20 05:43:59,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172630689] [2020-07-20 05:43:59,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450642896] [2020-07-20 05:43:59,353 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@44b34af9 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:43:59,498 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@44b34af9 issued 3 check-sat command(s) [2020-07-20 05:43:59,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:43:59,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 05:43:59,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:43:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 653 proven. 650 refuted. 0 times theorem prover too weak. 4787 trivial. 0 not checked. [2020-07-20 05:43:59,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:43:59,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 23 [2020-07-20 05:43:59,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619473380] [2020-07-20 05:43:59,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-20 05:43:59,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:43:59,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-20 05:43:59,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2020-07-20 05:43:59,734 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand 23 states. [2020-07-20 05:44:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:44:01,081 INFO L93 Difference]: Finished difference Result 355 states and 605 transitions. [2020-07-20 05:44:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-07-20 05:44:01,082 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 463 [2020-07-20 05:44:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:44:01,088 INFO L225 Difference]: With dead ends: 355 [2020-07-20 05:44:01,088 INFO L226 Difference]: Without dead ends: 189 [2020-07-20 05:44:01,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=2130, Unknown=0, NotChecked=0, Total=2450 [2020-07-20 05:44:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-07-20 05:44:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 162. [2020-07-20 05:44:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-07-20 05:44:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 211 transitions. [2020-07-20 05:44:01,106 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 211 transitions. Word has length 463 [2020-07-20 05:44:01,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:44:01,107 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 211 transitions. [2020-07-20 05:44:01,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-20 05:44:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 211 transitions. [2020-07-20 05:44:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2020-07-20 05:44:01,116 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:44:01,116 INFO L422 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:44:01,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:44:01,332 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:44:01,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:44:01,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1740376526, now seen corresponding path program 4 times [2020-07-20 05:44:01,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:44:01,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951492051] [2020-07-20 05:44:01,334 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5fca7099 [2020-07-20 05:44:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 05:44:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1102 proven. 902 refuted. 0 times theorem prover too weak. 3365 trivial. 0 not checked. [2020-07-20 05:44:02,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951492051] [2020-07-20 05:44:02,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281103276] [2020-07-20 05:44:02,951 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@56991f8f No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 05:44:03,102 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@56991f8f issued 4 check-sat command(s) [2020-07-20 05:44:03,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 05:44:03,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 05:44:03,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 05:44:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 663 proven. 113 refuted. 0 times theorem prover too weak. 4593 trivial. 0 not checked. [2020-07-20 05:44:03,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 05:44:03,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 26 [2020-07-20 05:44:03,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310393599] [2020-07-20 05:44:03,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-07-20 05:44:03,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 05:44:03,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-07-20 05:44:03,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2020-07-20 05:44:03,280 INFO L87 Difference]: Start difference. First operand 162 states and 211 transitions. Second operand 26 states. [2020-07-20 05:44:05,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 05:44:05,260 INFO L93 Difference]: Finished difference Result 393 states and 561 transitions. [2020-07-20 05:44:05,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2020-07-20 05:44:05,261 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 436 [2020-07-20 05:44:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 05:44:05,265 INFO L225 Difference]: With dead ends: 393 [2020-07-20 05:44:05,265 INFO L226 Difference]: Without dead ends: 244 [2020-07-20 05:44:05,268 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=525, Invalid=3765, Unknown=0, NotChecked=0, Total=4290 [2020-07-20 05:44:05,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-07-20 05:44:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 207. [2020-07-20 05:44:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-07-20 05:44:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 259 transitions. [2020-07-20 05:44:05,285 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 259 transitions. Word has length 436 [2020-07-20 05:44:05,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 05:44:05,286 INFO L479 AbstractCegarLoop]: Abstraction has 207 states and 259 transitions. [2020-07-20 05:44:05,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-07-20 05:44:05,286 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 259 transitions. [2020-07-20 05:44:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-20 05:44:05,290 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 05:44:05,291 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 05:44:05,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-20 05:44:05,505 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 05:44:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 05:44:05,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1326629730, now seen corresponding path program 5 times [2020-07-20 05:44:05,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 05:44:05,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686099230] [2020-07-20 05:44:05,506 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5fca7099 [2020-07-20 05:44:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:44:05,638 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:44:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 05:44:05,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 05:44:05,823 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 05:44:05,823 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 05:44:05,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-20 05:44:05,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 05:44:05 BoogieIcfgContainer [2020-07-20 05:44:05,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 05:44:05,963 INFO L168 Benchmark]: Toolchain (without parser) took 22312.53 ms. Allocated memory was 137.4 MB in the beginning and 730.9 MB in the end (delta: 593.5 MB). Free memory was 100.6 MB in the beginning and 441.6 MB in the end (delta: -340.9 MB). Peak memory consumption was 252.6 MB. Max. memory is 7.1 GB. [2020-07-20 05:44:05,964 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-20 05:44:05,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.92 ms. Allocated memory is still 137.4 MB. Free memory was 100.2 MB in the beginning and 90.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-20 05:44:05,965 INFO L168 Benchmark]: Boogie Preprocessor took 140.47 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 90.6 MB in the beginning and 179.7 MB in the end (delta: -89.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2020-07-20 05:44:05,966 INFO L168 Benchmark]: RCFGBuilder took 397.67 ms. Allocated memory is still 201.3 MB. Free memory was 179.7 MB in the beginning and 167.0 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2020-07-20 05:44:05,967 INFO L168 Benchmark]: TraceAbstraction took 21474.04 ms. Allocated memory was 201.3 MB in the beginning and 730.9 MB in the end (delta: 529.5 MB). Free memory was 166.4 MB in the beginning and 441.6 MB in the end (delta: -275.2 MB). Peak memory consumption was 254.3 MB. Max. memory is 7.1 GB. [2020-07-20 05:44:05,970 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 287.92 ms. Allocated memory is still 137.4 MB. Free memory was 100.2 MB in the beginning and 90.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.47 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 90.6 MB in the beginning and 179.7 MB in the end (delta: -89.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 397.67 ms. Allocated memory is still 201.3 MB. Free memory was 179.7 MB in the beginning and 167.0 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21474.04 ms. Allocated memory was 201.3 MB in the beginning and 730.9 MB in the end (delta: 529.5 MB). Free memory was 166.4 MB in the beginning and 441.6 MB in the end (delta: -275.2 MB). Peak memory consumption was 254.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 8; VAL [x=8] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L37] int result = fibo1(x); [L38] COND TRUE result == 21 VAL [result=21, x=8] [L39] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.2s, OverallIterations: 14, TraceHistogramMax: 35, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 455 SDtfs, 807 SDslu, 3277 SDs, 0 SdLazy, 5548 SolverSat, 926 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2764 GetRequests, 2440 SyntacticMatches, 0 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2348 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 226 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 4266 NumberOfCodeBlocks, 3912 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3779 ConstructedInterpolants, 0 QuantifiedInterpolants, 1637837 SizeOfPredicates, 62 NumberOfNonLiveVariables, 3636 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 29538/34412 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...