/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 10:56:50,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 10:56:50,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 10:56:50,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 10:56:50,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 10:56:50,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 10:56:50,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 10:56:50,564 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 10:56:50,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 10:56:50,566 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 10:56:50,567 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 10:56:50,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 10:56:50,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 10:56:50,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 10:56:50,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 10:56:50,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 10:56:50,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 10:56:50,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 10:56:50,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 10:56:50,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 10:56:50,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 10:56:50,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 10:56:50,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 10:56:50,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 10:56:50,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 10:56:50,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 10:56:50,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 10:56:50,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 10:56:50,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 10:56:50,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 10:56:50,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 10:56:50,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 10:56:50,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 10:56:50,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 10:56:50,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 10:56:50,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 10:56:50,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 10:56:50,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 10:56:50,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 10:56:50,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 10:56:50,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 10:56:50,592 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-07 10:56:50,606 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 10:56:50,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 10:56:50,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 10:56:50,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 10:56:50,607 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 10:56:50,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 10:56:50,608 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 10:56:50,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 10:56:50,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 10:56:50,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 10:56:50,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 10:56:50,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 10:56:50,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 10:56:50,609 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 10:56:50,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 10:56:50,609 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 10:56:50,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 10:56:50,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 10:56:50,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 10:56:50,610 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 10:56:50,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 10:56:50,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 10:56:50,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 10:56:50,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 10:56:50,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 10:56:50,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 10:56:50,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 10:56:50,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 10:56:50,612 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 10:56:50,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 10:56:50,913 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 10:56:50,930 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 10:56:50,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 10:56:50,934 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 10:56:50,934 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 10:56:50,935 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-07 10:56:50,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212cd313e/5698d699245a4446879ba28fc19ccea9/FLAG605c0435c [2020-07-07 10:56:51,408 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 10:56:51,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-07 10:56:51,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212cd313e/5698d699245a4446879ba28fc19ccea9/FLAG605c0435c [2020-07-07 10:56:51,802 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212cd313e/5698d699245a4446879ba28fc19ccea9 [2020-07-07 10:56:51,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 10:56:51,814 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 10:56:51,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 10:56:51,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 10:56:51,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 10:56:51,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 10:56:51" (1/1) ... [2020-07-07 10:56:51,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58bb5dcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:56:51, skipping insertion in model container [2020-07-07 10:56:51,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 10:56:51" (1/1) ... [2020-07-07 10:56:51,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 10:56:51,849 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 10:56:52,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 10:56:52,015 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 10:56:52,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 10:56:52,045 INFO L208 MainTranslator]: Completed translation [2020-07-07 10:56:52,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:56:52 WrapperNode [2020-07-07 10:56:52,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 10:56:52,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 10:56:52,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 10:56:52,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 10:56:52,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:56:52" (1/1) ... [2020-07-07 10:56:52,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:56:52" (1/1) ... [2020-07-07 10:56:52,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:56:52" (1/1) ... [2020-07-07 10:56:52,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:56:52" (1/1) ... [2020-07-07 10:56:52,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:56:52" (1/1) ... [2020-07-07 10:56:52,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:56:52" (1/1) ... [2020-07-07 10:56:52,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:56:52" (1/1) ... [2020-07-07 10:56:52,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 10:56:52,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 10:56:52,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 10:56:52,073 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 10:56:52,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:56:52" (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-07 10:56:52,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 10:56:52,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 10:56:52,225 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-07 10:56:52,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 10:56:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 10:56:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 10:56:52,226 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-07 10:56:52,226 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 10:56:52,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 10:56:52,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 10:56:52,399 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 10:56:52,400 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-07 10:56:52,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 10:56:52 BoogieIcfgContainer [2020-07-07 10:56:52,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 10:56:52,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 10:56:52,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 10:56:52,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 10:56:52,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 10:56:51" (1/3) ... [2020-07-07 10:56:52,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22498d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 10:56:52, skipping insertion in model container [2020-07-07 10:56:52,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 10:56:52" (2/3) ... [2020-07-07 10:56:52,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22498d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 10:56:52, skipping insertion in model container [2020-07-07 10:56:52,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 10:56:52" (3/3) ... [2020-07-07 10:56:52,431 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-07-07 10:56:52,445 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 10:56:52,454 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 10:56:52,471 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 10:56:52,508 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 10:56:52,508 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 10:56:52,508 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 10:56:52,509 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 10:56:52,509 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 10:56:52,509 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 10:56:52,509 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 10:56:52,509 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 10:56:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-07 10:56:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-07 10:56:52,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:56:52,536 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:56:52,536 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:56:52,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:56:52,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-07-07 10:56:52,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:56:52,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048617578] [2020-07-07 10:56:52,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:56:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:52,750 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-07 10:56:52,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048617578] [2020-07-07 10:56:52,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 10:56:52,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 10:56:52,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516686085] [2020-07-07 10:56:52,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 10:56:52,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:56:52,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 10:56:52,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 10:56:52,779 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-07-07 10:56:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:56:52,899 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-07 10:56:52,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 10:56:52,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-07 10:56:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:56:52,911 INFO L225 Difference]: With dead ends: 35 [2020-07-07 10:56:52,912 INFO L226 Difference]: Without dead ends: 21 [2020-07-07 10:56:52,915 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-07 10:56:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-07 10:56:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-07 10:56:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-07 10:56:52,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-07 10:56:52,953 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-07 10:56:52,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:56:52,954 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-07 10:56:52,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 10:56:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-07 10:56:52,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-07 10:56:52,956 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:56:52,956 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:56:52,957 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 10:56:52,957 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:56:52,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:56:52,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-07-07 10:56:52,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:56:52,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642270138] [2020-07-07 10:56:52,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:56:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:53,027 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-07 10:56:53,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642270138] [2020-07-07 10:56:53,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 10:56:53,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 10:56:53,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880002104] [2020-07-07 10:56:53,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 10:56:53,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:56:53,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 10:56:53,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 10:56:53,032 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-07 10:56:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:56:53,101 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-07 10:56:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 10:56:53,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-07 10:56:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:56:53,103 INFO L225 Difference]: With dead ends: 27 [2020-07-07 10:56:53,103 INFO L226 Difference]: Without dead ends: 23 [2020-07-07 10:56:53,105 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-07 10:56:53,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-07 10:56:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-07 10:56:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-07 10:56:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-07 10:56:53,113 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-07 10:56:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:56:53,113 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-07 10:56:53,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 10:56:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-07 10:56:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-07 10:56:53,115 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:56:53,116 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:56:53,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 10:56:53,116 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:56:53,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:56:53,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-07-07 10:56:53,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:56:53,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998767238] [2020-07-07 10:56:53,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:56:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 10:56:53,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998767238] [2020-07-07 10:56:53,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433707888] [2020-07-07 10:56:53,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-07 10:56:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:53,305 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-07 10:56:53,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:56:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 10:56:53,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:56:53,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-07 10:56:53,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379497401] [2020-07-07 10:56:53,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 10:56:53,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:56:53,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 10:56:53,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-07 10:56:53,386 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-07 10:56:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:56:53,505 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-07 10:56:53,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 10:56:53,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-07 10:56:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:56:53,507 INFO L225 Difference]: With dead ends: 38 [2020-07-07 10:56:53,507 INFO L226 Difference]: Without dead ends: 23 [2020-07-07 10:56:53,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-07 10:56:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-07 10:56:53,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-07 10:56:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-07 10:56:53,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-07 10:56:53,515 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-07-07 10:56:53,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:56:53,516 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-07 10:56:53,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 10:56:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-07 10:56:53,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-07 10:56:53,518 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:56:53,518 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:56:53,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-07 10:56:53,733 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:56:53,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:56:53,734 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-07-07 10:56:53,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:56:53,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546411515] [2020-07-07 10:56:53,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:56:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-07 10:56:53,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546411515] [2020-07-07 10:56:53,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742514434] [2020-07-07 10:56:53,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-07 10:56:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:53,914 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-07 10:56:53,916 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:56:53,936 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-07 10:56:53,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:56:53,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-07 10:56:53,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185660593] [2020-07-07 10:56:53,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 10:56:53,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:56:53,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 10:56:53,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-07 10:56:53,939 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 8 states. [2020-07-07 10:56:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:56:54,037 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-07-07 10:56:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 10:56:54,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-07-07 10:56:54,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:56:54,040 INFO L225 Difference]: With dead ends: 41 [2020-07-07 10:56:54,041 INFO L226 Difference]: Without dead ends: 37 [2020-07-07 10:56:54,041 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-07 10:56:54,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-07 10:56:54,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-07 10:56:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-07 10:56:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-07-07 10:56:54,052 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-07-07 10:56:54,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:56:54,052 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-07-07 10:56:54,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 10:56:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-07-07 10:56:54,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-07 10:56:54,055 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:56:54,055 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:56:54,270 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 10:56:54,271 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:56:54,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:56:54,271 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-07-07 10:56:54,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:56:54,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632001657] [2020-07-07 10:56:54,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:56:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:54,457 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-07 10:56:54,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632001657] [2020-07-07 10:56:54,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754393018] [2020-07-07 10:56:54,459 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-07 10:56:54,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-07 10:56:54,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 10:56:54,492 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-07 10:56:54,494 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:56:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-07 10:56:54,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:56:54,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-07-07 10:56:54,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264300468] [2020-07-07 10:56:54,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 10:56:54,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:56:54,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 10:56:54,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-07-07 10:56:54,556 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 13 states. [2020-07-07 10:56:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:56:54,761 INFO L93 Difference]: Finished difference Result 71 states and 106 transitions. [2020-07-07 10:56:54,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 10:56:54,761 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-07 10:56:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:56:54,763 INFO L225 Difference]: With dead ends: 71 [2020-07-07 10:56:54,763 INFO L226 Difference]: Without dead ends: 38 [2020-07-07 10:56:54,765 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-07-07 10:56:54,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-07 10:56:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-07 10:56:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-07 10:56:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-07-07 10:56:54,774 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 40 [2020-07-07 10:56:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:56:54,774 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-07-07 10:56:54,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 10:56:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-07-07 10:56:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-07 10:56:54,778 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:56:54,778 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:56:54,992 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 10:56:54,993 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:56:54,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:56:54,993 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 3 times [2020-07-07 10:56:54,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:56:54,994 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999159661] [2020-07-07 10:56:54,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:56:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-07-07 10:56:55,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999159661] [2020-07-07 10:56:55,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609931863] [2020-07-07 10:56:55,361 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-07 10:56:55,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-07-07 10:56:55,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 10:56:55,405 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-07 10:56:55,410 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:56:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2020-07-07 10:56:55,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:56:55,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2020-07-07 10:56:55,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90231734] [2020-07-07 10:56:55,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-07 10:56:55,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:56:55,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-07 10:56:55,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-07-07 10:56:55,485 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 16 states. [2020-07-07 10:56:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:56:55,774 INFO L93 Difference]: Finished difference Result 86 states and 121 transitions. [2020-07-07 10:56:55,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-07 10:56:55,775 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2020-07-07 10:56:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:56:55,778 INFO L225 Difference]: With dead ends: 86 [2020-07-07 10:56:55,778 INFO L226 Difference]: Without dead ends: 52 [2020-07-07 10:56:55,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2020-07-07 10:56:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-07 10:56:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2020-07-07 10:56:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-07 10:56:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2020-07-07 10:56:55,789 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 96 [2020-07-07 10:56:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:56:55,790 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2020-07-07 10:56:55,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-07 10:56:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2020-07-07 10:56:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-07-07 10:56:55,792 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:56:55,792 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:56:56,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 10:56:56,007 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:56:56,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:56:56,008 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 4 times [2020-07-07 10:56:56,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:56:56,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079040562] [2020-07-07 10:56:56,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:56:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-07-07 10:56:56,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079040562] [2020-07-07 10:56:56,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639437150] [2020-07-07 10:56:56,299 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-07 10:56:56,355 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-07 10:56:56,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 10:56:56,356 INFO L264 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-07 10:56:56,361 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:56:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-07-07 10:56:56,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:56:56,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 14 [2020-07-07 10:56:56,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161503264] [2020-07-07 10:56:56,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 10:56:56,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:56:56,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 10:56:56,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-07 10:56:56,415 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand 14 states. [2020-07-07 10:56:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:56:56,610 INFO L93 Difference]: Finished difference Result 121 states and 168 transitions. [2020-07-07 10:56:56,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 10:56:56,610 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2020-07-07 10:56:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:56:56,614 INFO L225 Difference]: With dead ends: 121 [2020-07-07 10:56:56,614 INFO L226 Difference]: Without dead ends: 117 [2020-07-07 10:56:56,615 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-07-07 10:56:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-07-07 10:56:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2020-07-07 10:56:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-07-07 10:56:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 151 transitions. [2020-07-07 10:56:56,634 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 151 transitions. Word has length 109 [2020-07-07 10:56:56,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:56:56,635 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 151 transitions. [2020-07-07 10:56:56,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 10:56:56,635 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 151 transitions. [2020-07-07 10:56:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2020-07-07 10:56:56,640 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:56:56,640 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:56:56,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-07 10:56:56,856 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:56:56,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:56:56,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1120272490, now seen corresponding path program 5 times [2020-07-07 10:56:56,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:56:56,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710064126] [2020-07-07 10:56:56,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:56:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 393 proven. 617 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked. [2020-07-07 10:56:57,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710064126] [2020-07-07 10:56:57,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569486980] [2020-07-07 10:56:57,467 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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-07 10:56:57,550 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2020-07-07 10:56:57,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 10:56:57,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-07 10:56:57,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:56:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 620 proven. 476 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2020-07-07 10:56:57,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:56:57,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 24 [2020-07-07 10:56:57,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317844017] [2020-07-07 10:56:57,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-07 10:56:57,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:56:57,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-07 10:56:57,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2020-07-07 10:56:57,692 INFO L87 Difference]: Start difference. First operand 108 states and 151 transitions. Second operand 24 states. [2020-07-07 10:56:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:56:58,283 INFO L93 Difference]: Finished difference Result 194 states and 318 transitions. [2020-07-07 10:56:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-07 10:56:58,284 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 204 [2020-07-07 10:56:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:56:58,286 INFO L225 Difference]: With dead ends: 194 [2020-07-07 10:56:58,286 INFO L226 Difference]: Without dead ends: 92 [2020-07-07 10:56:58,289 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=370, Invalid=1270, Unknown=0, NotChecked=0, Total=1640 [2020-07-07 10:56:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-07 10:56:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2020-07-07 10:56:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-07 10:56:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2020-07-07 10:56:58,301 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 204 [2020-07-07 10:56:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:56:58,302 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2020-07-07 10:56:58,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-07 10:56:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2020-07-07 10:56:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-07-07 10:56:58,307 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:56:58,307 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:56:58,521 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 10:56:58,521 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:56:58,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:56:58,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 6 times [2020-07-07 10:56:58,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:56:58,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137393470] [2020-07-07 10:56:58,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:56:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-07-07 10:56:58,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137393470] [2020-07-07 10:56:58,932 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384899885] [2020-07-07 10:56:58,932 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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-07 10:56:59,004 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2020-07-07 10:56:59,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 10:56:59,005 INFO L264 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-07 10:56:59,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:56:59,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2020-07-07 10:56:59,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:56:59,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 16 [2020-07-07 10:56:59,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412658054] [2020-07-07 10:56:59,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-07 10:56:59,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:56:59,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-07 10:56:59,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-07-07 10:56:59,052 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand 16 states. [2020-07-07 10:56:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:56:59,245 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2020-07-07 10:56:59,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 10:56:59,245 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 177 [2020-07-07 10:56:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:56:59,248 INFO L225 Difference]: With dead ends: 85 [2020-07-07 10:56:59,248 INFO L226 Difference]: Without dead ends: 81 [2020-07-07 10:56:59,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2020-07-07 10:56:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-07 10:56:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-07 10:56:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-07 10:56:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2020-07-07 10:56:59,266 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 177 [2020-07-07 10:56:59,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:56:59,267 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2020-07-07 10:56:59,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-07 10:56:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2020-07-07 10:56:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-07 10:56:59,273 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:56:59,273 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:56:59,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 10:56:59,488 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:56:59,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:56:59,488 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 7 times [2020-07-07 10:56:59,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:56:59,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247960295] [2020-07-07 10:56:59,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:56:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:56:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-07-07 10:57:00,237 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247960295] [2020-07-07 10:57:00,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694190796] [2020-07-07 10:57:00,238 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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-07 10:57:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:00,330 INFO L264 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-07 10:57:00,335 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:57:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-07-07 10:57:00,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:57:00,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 18 [2020-07-07 10:57:00,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284945754] [2020-07-07 10:57:00,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-07 10:57:00,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:57:00,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-07 10:57:00,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2020-07-07 10:57:00,413 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand 18 states. [2020-07-07 10:57:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:57:00,645 INFO L93 Difference]: Finished difference Result 263 states and 389 transitions. [2020-07-07 10:57:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-07 10:57:00,651 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 286 [2020-07-07 10:57:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:57:00,655 INFO L225 Difference]: With dead ends: 263 [2020-07-07 10:57:00,655 INFO L226 Difference]: Without dead ends: 259 [2020-07-07 10:57:00,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2020-07-07 10:57:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-07-07 10:57:00,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 244. [2020-07-07 10:57:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-07-07 10:57:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 361 transitions. [2020-07-07 10:57:00,686 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 361 transitions. Word has length 286 [2020-07-07 10:57:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:57:00,687 INFO L479 AbstractCegarLoop]: Abstraction has 244 states and 361 transitions. [2020-07-07 10:57:00,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-07 10:57:00,688 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 361 transitions. [2020-07-07 10:57:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-07-07 10:57:00,704 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:57:00,704 INFO L422 BasicCegarLoop]: trace histogram [87, 87, 70, 43, 43, 43, 43, 43, 43, 43, 27, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:57:00,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-07 10:57:00,918 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:57:00,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:57:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash 146593647, now seen corresponding path program 8 times [2020-07-07 10:57:00,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:57:00,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396369431] [2020-07-07 10:57:00,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:57:01,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 10:57:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3423 proven. 3437 refuted. 0 times theorem prover too weak. 14131 trivial. 0 not checked. [2020-07-07 10:57:03,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396369431] [2020-07-07 10:57:03,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896294406] [2020-07-07 10:57:03,409 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-07 10:57:03,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-07 10:57:03,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 10:57:03,577 INFO L264 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-07 10:57:03,586 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 10:57:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 2164 proven. 4045 refuted. 0 times theorem prover too weak. 14782 trivial. 0 not checked. [2020-07-07 10:57:03,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 10:57:03,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19] total 31 [2020-07-07 10:57:03,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205386660] [2020-07-07 10:57:03,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-07-07 10:57:03,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 10:57:03,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-07-07 10:57:03,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2020-07-07 10:57:03,912 INFO L87 Difference]: Start difference. First operand 244 states and 361 transitions. Second operand 31 states. [2020-07-07 10:57:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 10:57:04,762 INFO L93 Difference]: Finished difference Result 377 states and 646 transitions. [2020-07-07 10:57:04,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-07 10:57:04,763 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 599 [2020-07-07 10:57:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 10:57:04,767 INFO L225 Difference]: With dead ends: 377 [2020-07-07 10:57:04,767 INFO L226 Difference]: Without dead ends: 141 [2020-07-07 10:57:04,770 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 836 GetRequests, 780 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=670, Invalid=2636, Unknown=0, NotChecked=0, Total=3306 [2020-07-07 10:57:04,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-07-07 10:57:04,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2020-07-07 10:57:04,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-07 10:57:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-07-07 10:57:04,782 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 599 [2020-07-07 10:57:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 10:57:04,784 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-07-07 10:57:04,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-07-07 10:57:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-07-07 10:57:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-07 10:57:04,786 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 10:57:04,787 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 10:57:04,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 10:57:05,000 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 10:57:05,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 10:57:05,001 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 9 times [2020-07-07 10:57:05,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 10:57:05,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417019992] [2020-07-07 10:57:05,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 10:57:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 10:57:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 10:57:05,233 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-07 10:57:05,233 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 10:57:05,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 10:57:05,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 10:57:05 BoogieIcfgContainer [2020-07-07 10:57:05,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 10:57:05,313 INFO L168 Benchmark]: Toolchain (without parser) took 13498.84 ms. Allocated memory was 145.8 MB in the beginning and 633.9 MB in the end (delta: 488.1 MB). Free memory was 103.3 MB in the beginning and 510.0 MB in the end (delta: -406.7 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. [2020-07-07 10:57:05,314 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-07 10:57:05,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.04 ms. Allocated memory is still 145.8 MB. Free memory was 102.9 MB in the beginning and 93.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-07 10:57:05,315 INFO L168 Benchmark]: Boogie Preprocessor took 26.67 ms. Allocated memory is still 145.8 MB. Free memory was 93.7 MB in the beginning and 92.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-07 10:57:05,316 INFO L168 Benchmark]: RCFGBuilder took 331.70 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 92.3 MB in the beginning and 170.3 MB in the end (delta: -78.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-07 10:57:05,316 INFO L168 Benchmark]: TraceAbstraction took 12904.67 ms. Allocated memory was 202.4 MB in the beginning and 633.9 MB in the end (delta: 431.5 MB). Free memory was 169.7 MB in the beginning and 510.0 MB in the end (delta: -340.4 MB). Peak memory consumption was 91.1 MB. Max. memory is 7.1 GB. [2020-07-07 10:57:05,320 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.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 231.04 ms. Allocated memory is still 145.8 MB. Free memory was 102.9 MB in the beginning and 93.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.67 ms. Allocated memory is still 145.8 MB. Free memory was 93.7 MB in the beginning and 92.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 331.70 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 92.3 MB in the beginning and 170.3 MB in the end (delta: -78.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12904.67 ms. Allocated memory was 202.4 MB in the beginning and 633.9 MB in the end (delta: 431.5 MB). Free memory was 169.7 MB in the beginning and 510.0 MB in the end (delta: -340.4 MB). Peak memory consumption was 91.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.7s, OverallIterations: 12, TraceHistogramMax: 87, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 241 SDtfs, 731 SDslu, 881 SDs, 0 SdLazy, 1725 SolverSat, 780 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2240 GetRequests, 2034 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 72 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 3618 NumberOfCodeBlocks, 3547 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 3135 ConstructedInterpolants, 0 QuantifiedInterpolants, 1625631 SizeOfPredicates, 58 NumberOfNonLiveVariables, 3349 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 48747/61046 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...