/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-simple/fibo_2calls_8-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 11:58:57,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 11:58:57,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 11:58:57,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 11:58:57,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 11:58:57,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 11:58:57,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 11:58:57,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 11:58:57,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 11:58:57,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 11:58:57,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 11:58:57,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 11:58:57,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 11:58:57,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 11:58:57,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 11:58:57,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 11:58:57,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 11:58:57,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 11:58:57,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 11:58:57,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 11:58:57,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 11:58:57,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 11:58:57,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 11:58:57,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 11:58:57,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 11:58:57,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 11:58:57,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 11:58:57,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 11:58:57,714 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 11:58:57,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 11:58:57,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 11:58:57,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 11:58:57,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 11:58:57,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 11:58:57,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 11:58:57,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 11:58:57,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 11:58:57,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 11:58:57,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 11:58:57,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 11:58:57,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 11:58:57,730 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-17 11:58:57,759 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 11:58:57,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 11:58:57,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 11:58:57,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 11:58:57,763 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 11:58:57,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 11:58:57,763 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 11:58:57,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 11:58:57,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 11:58:57,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 11:58:57,765 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 11:58:57,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 11:58:57,766 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 11:58:57,767 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 11:58:57,767 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 11:58:57,767 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 11:58:57,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 11:58:57,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 11:58:57,768 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 11:58:57,768 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 11:58:57,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 11:58:57,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 11:58:57,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 11:58:57,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 11:58:57,769 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 11:58:57,770 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 11:58:57,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 11:58:57,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 11:58:57,770 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 11:58:57,770 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 11:58:58,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 11:58:58,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 11:58:58,142 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 11:58:58,144 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 11:58:58,144 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 11:58:58,145 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c [2020-07-17 11:58:58,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7ced75d/d09432fa060d47ea911824c10e8b9baf/FLAGea2f08fc1 [2020-07-17 11:58:58,688 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 11:58:58,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c [2020-07-17 11:58:58,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7ced75d/d09432fa060d47ea911824c10e8b9baf/FLAGea2f08fc1 [2020-07-17 11:58:59,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7ced75d/d09432fa060d47ea911824c10e8b9baf [2020-07-17 11:58:59,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 11:58:59,110 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 11:58:59,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 11:58:59,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 11:58:59,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 11:58:59,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 11:58:59" (1/1) ... [2020-07-17 11:58:59,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d70fae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 11:58:59, skipping insertion in model container [2020-07-17 11:58:59,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 11:58:59" (1/1) ... [2020-07-17 11:58:59,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 11:58:59,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 11:58:59,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 11:58:59,312 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 11:58:59,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 11:58:59,347 INFO L208 MainTranslator]: Completed translation [2020-07-17 11:58:59,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 11:58:59 WrapperNode [2020-07-17 11:58:59,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 11:58:59,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 11:58:59,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 11:58:59,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 11:58:59,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 11:58:59" (1/1) ... [2020-07-17 11:58:59,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 11:58:59" (1/1) ... [2020-07-17 11:58:59,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 11:58:59" (1/1) ... [2020-07-17 11:58:59,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 11:58:59" (1/1) ... [2020-07-17 11:58:59,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 11:58:59" (1/1) ... [2020-07-17 11:58:59,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 11:58:59" (1/1) ... [2020-07-17 11:58:59,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 11:58:59" (1/1) ... [2020-07-17 11:58:59,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 11:58:59,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 11:58:59,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 11:58:59,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 11:58:59,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 11:58:59" (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-17 11:58:59,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 11:58:59,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 11:58:59,532 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-17 11:58:59,533 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-17 11:58:59,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 11:58:59,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 11:58:59,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 11:58:59,533 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-17 11:58:59,533 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-17 11:58:59,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 11:58:59,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 11:58:59,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 11:58:59,747 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 11:58:59,747 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 11:58:59,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 11:58:59 BoogieIcfgContainer [2020-07-17 11:58:59,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 11:58:59,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 11:58:59,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 11:58:59,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 11:58:59,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 11:58:59" (1/3) ... [2020-07-17 11:58:59,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9ae6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 11:58:59, skipping insertion in model container [2020-07-17 11:58:59,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 11:58:59" (2/3) ... [2020-07-17 11:58:59,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9ae6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 11:58:59, skipping insertion in model container [2020-07-17 11:58:59,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 11:58:59" (3/3) ... [2020-07-17 11:58:59,761 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2020-07-17 11:58:59,773 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 11:58:59,782 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 11:58:59,801 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 11:58:59,832 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 11:58:59,833 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 11:58:59,833 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 11:58:59,833 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 11:58:59,834 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 11:58:59,834 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 11:58:59,834 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 11:58:59,835 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 11:58:59,868 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-17 11:58:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 11:58:59,878 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:58:59,880 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:58:59,880 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:58:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:58:59,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-07-17 11:58:59,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:58:59,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151279647] [2020-07-17 11:58:59,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:00,184 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-17 11:59:00,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151279647] [2020-07-17 11:59:00,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 11:59:00,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 11:59:00,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109251855] [2020-07-17 11:59:00,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 11:59:00,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 11:59:00,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 11:59:00,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 11:59:00,208 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-17 11:59:00,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 11:59:00,326 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-17 11:59:00,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 11:59:00,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 11:59:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 11:59:00,355 INFO L225 Difference]: With dead ends: 44 [2020-07-17 11:59:00,355 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 11:59:00,366 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 11:59:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 11:59:00,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 11:59:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 11:59:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-17 11:59:00,436 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-07-17 11:59:00,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 11:59:00,436 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-17 11:59:00,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 11:59:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-17 11:59:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 11:59:00,439 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:59:00,440 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:59:00,440 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 11:59:00,440 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:59:00,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:59:00,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-07-17 11:59:00,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:59:00,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276373269] [2020-07-17 11:59:00,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:00,509 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-17 11:59:00,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276373269] [2020-07-17 11:59:00,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 11:59:00,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 11:59:00,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154333269] [2020-07-17 11:59:00,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 11:59:00,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 11:59:00,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 11:59:00,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 11:59:00,515 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-07-17 11:59:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 11:59:00,585 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-17 11:59:00,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 11:59:00,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-17 11:59:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 11:59:00,588 INFO L225 Difference]: With dead ends: 36 [2020-07-17 11:59:00,588 INFO L226 Difference]: Without dead ends: 32 [2020-07-17 11:59:00,590 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 11:59:00,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-17 11:59:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-17 11:59:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 11:59:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-17 11:59:00,600 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-07-17 11:59:00,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 11:59:00,601 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-17 11:59:00,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 11:59:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-17 11:59:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 11:59:00,603 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:59:00,603 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:59:00,603 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 11:59:00,604 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:59:00,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:59:00,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-07-17 11:59:00,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:59:00,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361135138] [2020-07-17 11:59:00,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 11:59:00,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361135138] [2020-07-17 11:59:00,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445159014] [2020-07-17 11:59:00,820 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-17 11:59:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:00,859 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 11:59:00,868 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 11:59:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 11:59:00,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 11:59:00,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-17 11:59:00,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132308294] [2020-07-17 11:59:00,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 11:59:00,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 11:59:00,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 11:59:00,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-17 11:59:00,957 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-07-17 11:59:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 11:59:01,193 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-17 11:59:01,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 11:59:01,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-17 11:59:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 11:59:01,195 INFO L225 Difference]: With dead ends: 58 [2020-07-17 11:59:01,196 INFO L226 Difference]: Without dead ends: 34 [2020-07-17 11:59:01,197 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-17 11:59:01,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-17 11:59:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-17 11:59:01,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 11:59:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-17 11:59:01,218 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-07-17 11:59:01,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 11:59:01,219 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-17 11:59:01,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 11:59:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-17 11:59:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 11:59:01,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:59:01,223 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:59:01,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 11:59:01,437 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:59:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:59:01,439 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-07-17 11:59:01,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:59:01,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862330763] [2020-07-17 11:59:01,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 11:59:01,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862330763] [2020-07-17 11:59:01,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691637738] [2020-07-17 11:59:01,577 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-17 11:59:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:01,617 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 11:59:01,622 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 11:59:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 11:59:01,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 11:59:01,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-17 11:59:01,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797109304] [2020-07-17 11:59:01,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 11:59:01,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 11:59:01,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 11:59:01,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-17 11:59:01,662 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 9 states. [2020-07-17 11:59:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 11:59:01,854 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-07-17 11:59:01,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 11:59:01,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-17 11:59:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 11:59:01,858 INFO L225 Difference]: With dead ends: 54 [2020-07-17 11:59:01,858 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 11:59:01,859 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-17 11:59:01,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 11:59:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-17 11:59:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-17 11:59:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-07-17 11:59:01,872 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-07-17 11:59:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 11:59:01,872 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-07-17 11:59:01,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 11:59:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-07-17 11:59:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-17 11:59:01,875 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:59:01,875 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:59:02,089 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 11:59:02,090 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:59:02,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:59:02,090 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-07-17 11:59:02,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:59:02,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175167126] [2020-07-17 11:59:02,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-17 11:59:02,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175167126] [2020-07-17 11:59:02,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019832596] [2020-07-17 11:59:02,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-17 11:59:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:02,234 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 11:59:02,237 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 11:59:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 11:59:02,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 11:59:02,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-07-17 11:59:02,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838449079] [2020-07-17 11:59:02,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 11:59:02,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 11:59:02,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 11:59:02,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-17 11:59:02,307 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 11 states. [2020-07-17 11:59:02,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 11:59:02,605 INFO L93 Difference]: Finished difference Result 108 states and 170 transitions. [2020-07-17 11:59:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 11:59:02,607 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-17 11:59:02,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 11:59:02,610 INFO L225 Difference]: With dead ends: 108 [2020-07-17 11:59:02,610 INFO L226 Difference]: Without dead ends: 66 [2020-07-17 11:59:02,615 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-07-17 11:59:02,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-17 11:59:02,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-17 11:59:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-17 11:59:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2020-07-17 11:59:02,648 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2020-07-17 11:59:02,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 11:59:02,648 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2020-07-17 11:59:02,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 11:59:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-07-17 11:59:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 11:59:02,653 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:59:02,653 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:59:02,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 11:59:02,872 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:59:02,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:59:02,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-07-17 11:59:02,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:59:02,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935886869] [2020-07-17 11:59:02,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-17 11:59:03,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935886869] [2020-07-17 11:59:03,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833713753] [2020-07-17 11:59:03,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-17 11:59:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:03,086 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 11:59:03,089 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 11:59:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-17 11:59:03,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 11:59:03,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-17 11:59:03,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996034683] [2020-07-17 11:59:03,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 11:59:03,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 11:59:03,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 11:59:03,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-17 11:59:03,176 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand 13 states. [2020-07-17 11:59:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 11:59:03,623 INFO L93 Difference]: Finished difference Result 180 states and 324 transitions. [2020-07-17 11:59:03,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 11:59:03,624 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-17 11:59:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 11:59:03,628 INFO L225 Difference]: With dead ends: 180 [2020-07-17 11:59:03,629 INFO L226 Difference]: Without dead ends: 120 [2020-07-17 11:59:03,631 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-07-17 11:59:03,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-17 11:59:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2020-07-17 11:59:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-17 11:59:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 169 transitions. [2020-07-17 11:59:03,664 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 169 transitions. Word has length 40 [2020-07-17 11:59:03,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 11:59:03,668 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 169 transitions. [2020-07-17 11:59:03,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 11:59:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 169 transitions. [2020-07-17 11:59:03,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-17 11:59:03,675 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:59:03,675 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:59:03,880 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 11:59:03,882 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:59:03,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:59:03,882 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-07-17 11:59:03,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:59:03,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43354260] [2020-07-17 11:59:03,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-17 11:59:04,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43354260] [2020-07-17 11:59:04,110 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224538956] [2020-07-17 11:59:04,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-17 11:59:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:04,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-17 11:59:04,187 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 11:59:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-17 11:59:04,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 11:59:04,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-07-17 11:59:04,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453150440] [2020-07-17 11:59:04,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 11:59:04,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 11:59:04,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 11:59:04,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-17 11:59:04,295 INFO L87 Difference]: Start difference. First operand 106 states and 169 transitions. Second operand 14 states. [2020-07-17 11:59:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 11:59:04,915 INFO L93 Difference]: Finished difference Result 258 states and 498 transitions. [2020-07-17 11:59:04,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 11:59:04,916 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-07-17 11:59:04,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 11:59:04,921 INFO L225 Difference]: With dead ends: 258 [2020-07-17 11:59:04,921 INFO L226 Difference]: Without dead ends: 158 [2020-07-17 11:59:04,925 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-07-17 11:59:04,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-17 11:59:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2020-07-17 11:59:04,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-17 11:59:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 180 transitions. [2020-07-17 11:59:04,960 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 180 transitions. Word has length 54 [2020-07-17 11:59:04,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 11:59:04,961 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 180 transitions. [2020-07-17 11:59:04,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 11:59:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 180 transitions. [2020-07-17 11:59:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-17 11:59:04,965 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:59:04,965 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:59:05,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-17 11:59:05,181 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:59:05,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:59:05,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1504181040, now seen corresponding path program 1 times [2020-07-17 11:59:05,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:59:05,182 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253469672] [2020-07-17 11:59:05,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-07-17 11:59:05,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253469672] [2020-07-17 11:59:05,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908501686] [2020-07-17 11:59:05,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-17 11:59:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:05,427 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-17 11:59:05,431 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 11:59:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-17 11:59:05,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 11:59:05,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-07-17 11:59:05,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561956178] [2020-07-17 11:59:05,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 11:59:05,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 11:59:05,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 11:59:05,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-07-17 11:59:05,541 INFO L87 Difference]: Start difference. First operand 112 states and 180 transitions. Second operand 16 states. [2020-07-17 11:59:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 11:59:06,216 INFO L93 Difference]: Finished difference Result 243 states and 465 transitions. [2020-07-17 11:59:06,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-17 11:59:06,220 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2020-07-17 11:59:06,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 11:59:06,222 INFO L225 Difference]: With dead ends: 243 [2020-07-17 11:59:06,222 INFO L226 Difference]: Without dead ends: 110 [2020-07-17 11:59:06,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2020-07-17 11:59:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-17 11:59:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2020-07-17 11:59:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-17 11:59:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2020-07-17 11:59:06,242 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 82 [2020-07-17 11:59:06,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 11:59:06,243 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2020-07-17 11:59:06,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 11:59:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2020-07-17 11:59:06,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-17 11:59:06,245 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:59:06,246 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:59:06,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 11:59:06,459 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:59:06,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:59:06,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2095197631, now seen corresponding path program 1 times [2020-07-17 11:59:06,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:59:06,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559985402] [2020-07-17 11:59:06,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 61 proven. 94 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2020-07-17 11:59:06,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559985402] [2020-07-17 11:59:06,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82551523] [2020-07-17 11:59:06,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-17 11:59:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:06,799 INFO L264 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-17 11:59:06,804 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 11:59:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2020-07-17 11:59:06,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 11:59:06,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2020-07-17 11:59:06,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034094476] [2020-07-17 11:59:06,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-17 11:59:06,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 11:59:06,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-17 11:59:06,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-07-17 11:59:06,928 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 17 states. [2020-07-17 11:59:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 11:59:07,666 INFO L93 Difference]: Finished difference Result 217 states and 375 transitions. [2020-07-17 11:59:07,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-17 11:59:07,667 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 123 [2020-07-17 11:59:07,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 11:59:07,674 INFO L225 Difference]: With dead ends: 217 [2020-07-17 11:59:07,674 INFO L226 Difference]: Without dead ends: 137 [2020-07-17 11:59:07,677 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2020-07-17 11:59:07,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-17 11:59:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2020-07-17 11:59:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-17 11:59:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2020-07-17 11:59:07,694 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 123 [2020-07-17 11:59:07,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 11:59:07,694 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2020-07-17 11:59:07,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-17 11:59:07,694 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2020-07-17 11:59:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-07-17 11:59:07,698 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:59:07,699 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:59:07,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 11:59:07,913 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:59:07,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:59:07,914 INFO L82 PathProgramCache]: Analyzing trace with hash 466415905, now seen corresponding path program 1 times [2020-07-17 11:59:07,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:59:07,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840719039] [2020-07-17 11:59:07,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 165 proven. 262 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2020-07-17 11:59:08,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840719039] [2020-07-17 11:59:08,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33973628] [2020-07-17 11:59:08,409 INFO L94 rtionOrderModulation]: Keeping assertion order 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-17 11:59:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:08,507 INFO L264 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-17 11:59:08,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 11:59:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 77 proven. 418 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2020-07-17 11:59:08,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 11:59:08,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2020-07-17 11:59:08,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529611663] [2020-07-17 11:59:08,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-17 11:59:08,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 11:59:08,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-17 11:59:08,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2020-07-17 11:59:08,715 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand 18 states. [2020-07-17 11:59:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 11:59:09,502 INFO L93 Difference]: Finished difference Result 263 states and 450 transitions. [2020-07-17 11:59:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-17 11:59:09,502 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 231 [2020-07-17 11:59:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 11:59:09,509 INFO L225 Difference]: With dead ends: 263 [2020-07-17 11:59:09,509 INFO L226 Difference]: Without dead ends: 158 [2020-07-17 11:59:09,512 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2020-07-17 11:59:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-17 11:59:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2020-07-17 11:59:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-07-17 11:59:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 227 transitions. [2020-07-17 11:59:09,555 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 227 transitions. Word has length 231 [2020-07-17 11:59:09,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 11:59:09,556 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 227 transitions. [2020-07-17 11:59:09,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-17 11:59:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 227 transitions. [2020-07-17 11:59:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2020-07-17 11:59:09,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:59:09,574 INFO L422 BasicCegarLoop]: trace histogram [28, 28, 25, 25, 21, 21, 14, 14, 14, 14, 14, 14, 14, 12, 12, 12, 12, 12, 12, 12, 9, 7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:59:09,776 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-17 11:59:09,777 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:59:09,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:59:09,778 INFO L82 PathProgramCache]: Analyzing trace with hash -80201483, now seen corresponding path program 2 times [2020-07-17 11:59:09,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:59:09,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048390099] [2020-07-17 11:59:09,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 243 proven. 571 refuted. 0 times theorem prover too weak. 2946 trivial. 0 not checked. [2020-07-17 11:59:10,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048390099] [2020-07-17 11:59:10,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964812608] [2020-07-17 11:59:10,655 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-17 11:59:10,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 11:59:10,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 11:59:10,791 INFO L264 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-17 11:59:10,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 11:59:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 193 proven. 574 refuted. 0 times theorem prover too weak. 2993 trivial. 0 not checked. [2020-07-17 11:59:10,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 11:59:10,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2020-07-17 11:59:10,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123260304] [2020-07-17 11:59:10,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-17 11:59:10,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 11:59:10,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-17 11:59:10,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-07-17 11:59:10,974 INFO L87 Difference]: Start difference. First operand 148 states and 227 transitions. Second operand 17 states. [2020-07-17 11:59:11,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 11:59:11,672 INFO L93 Difference]: Finished difference Result 326 states and 537 transitions. [2020-07-17 11:59:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-17 11:59:11,673 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 367 [2020-07-17 11:59:11,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 11:59:11,679 INFO L225 Difference]: With dead ends: 326 [2020-07-17 11:59:11,680 INFO L226 Difference]: Without dead ends: 191 [2020-07-17 11:59:11,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2020-07-17 11:59:11,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-07-17 11:59:11,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 148. [2020-07-17 11:59:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-07-17 11:59:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2020-07-17 11:59:11,715 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 367 [2020-07-17 11:59:11,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 11:59:11,717 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2020-07-17 11:59:11,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-17 11:59:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2020-07-17 11:59:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2020-07-17 11:59:11,734 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:59:11,735 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 28, 28, 25, 23, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 11, 8, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:59:11,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 11:59:11,950 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:59:11,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:59:11,951 INFO L82 PathProgramCache]: Analyzing trace with hash 725561814, now seen corresponding path program 3 times [2020-07-17 11:59:11,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:59:11,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636137116] [2020-07-17 11:59:11,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 314 proven. 923 refuted. 0 times theorem prover too weak. 3472 trivial. 0 not checked. [2020-07-17 11:59:13,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636137116] [2020-07-17 11:59:13,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829067526] [2020-07-17 11:59:13,171 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 11:59:13,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-07-17 11:59:13,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 11:59:13,259 INFO L264 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-17 11:59:13,269 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 11:59:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 612 proven. 96 refuted. 0 times theorem prover too weak. 4001 trivial. 0 not checked. [2020-07-17 11:59:13,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 11:59:13,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2020-07-17 11:59:13,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78412324] [2020-07-17 11:59:13,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-17 11:59:13,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 11:59:13,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-17 11:59:13,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2020-07-17 11:59:13,531 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand 21 states. [2020-07-17 11:59:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 11:59:14,714 INFO L93 Difference]: Finished difference Result 379 states and 615 transitions. [2020-07-17 11:59:14,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-07-17 11:59:14,715 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 409 [2020-07-17 11:59:14,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 11:59:14,718 INFO L225 Difference]: With dead ends: 379 [2020-07-17 11:59:14,719 INFO L226 Difference]: Without dead ends: 233 [2020-07-17 11:59:14,721 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=1944, Unknown=0, NotChecked=0, Total=2256 [2020-07-17 11:59:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-07-17 11:59:14,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 171. [2020-07-17 11:59:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-07-17 11:59:14,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 250 transitions. [2020-07-17 11:59:14,746 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 250 transitions. Word has length 409 [2020-07-17 11:59:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 11:59:14,748 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 250 transitions. [2020-07-17 11:59:14,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-17 11:59:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 250 transitions. [2020-07-17 11:59:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2020-07-17 11:59:14,759 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:59:14,759 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 25, 24, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:59:14,973 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 11:59:14,974 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:59:14,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:59:14,975 INFO L82 PathProgramCache]: Analyzing trace with hash -515597281, now seen corresponding path program 4 times [2020-07-17 11:59:14,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:59:14,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69907657] [2020-07-17 11:59:14,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 433 proven. 1032 refuted. 0 times theorem prover too weak. 3551 trivial. 0 not checked. [2020-07-17 11:59:16,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69907657] [2020-07-17 11:59:16,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988679055] [2020-07-17 11:59:16,242 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 11:59:16,355 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 11:59:16,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 11:59:16,358 INFO L264 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-17 11:59:16,365 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 11:59:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 397 proven. 499 refuted. 0 times theorem prover too weak. 4120 trivial. 0 not checked. [2020-07-17 11:59:16,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 11:59:16,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 20 [2020-07-17 11:59:16,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011451966] [2020-07-17 11:59:16,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 11:59:16,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 11:59:16,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 11:59:16,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2020-07-17 11:59:16,520 INFO L87 Difference]: Start difference. First operand 171 states and 250 transitions. Second operand 20 states. [2020-07-17 11:59:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 11:59:17,732 INFO L93 Difference]: Finished difference Result 409 states and 659 transitions. [2020-07-17 11:59:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2020-07-17 11:59:17,734 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 422 [2020-07-17 11:59:17,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 11:59:17,739 INFO L225 Difference]: With dead ends: 409 [2020-07-17 11:59:17,740 INFO L226 Difference]: Without dead ends: 241 [2020-07-17 11:59:17,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=313, Invalid=1849, Unknown=0, NotChecked=0, Total=2162 [2020-07-17 11:59:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-07-17 11:59:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 172. [2020-07-17 11:59:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-07-17 11:59:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2020-07-17 11:59:17,762 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 422 [2020-07-17 11:59:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 11:59:17,763 INFO L479 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2020-07-17 11:59:17,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 11:59:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2020-07-17 11:59:17,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2020-07-17 11:59:17,768 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:59:17,769 INFO L422 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 34, 33, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 14, 12, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:59:17,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-17 11:59:17,984 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:59:17,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:59:17,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2122481566, now seen corresponding path program 5 times [2020-07-17 11:59:17,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:59:17,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476442924] [2020-07-17 11:59:17,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 11:59:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 913 proven. 1781 refuted. 0 times theorem prover too weak. 6719 trivial. 0 not checked. [2020-07-17 11:59:20,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476442924] [2020-07-17 11:59:20,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456172852] [2020-07-17 11:59:20,261 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 11:59:20,511 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2020-07-17 11:59:20,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 11:59:20,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 1107 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-17 11:59:20,527 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 11:59:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 1177 proven. 1149 refuted. 0 times theorem prover too weak. 7087 trivial. 0 not checked. [2020-07-17 11:59:20,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 11:59:20,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 28 [2020-07-17 11:59:20,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978214680] [2020-07-17 11:59:20,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-07-17 11:59:20,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 11:59:20,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-07-17 11:59:20,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2020-07-17 11:59:20,845 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 28 states. [2020-07-17 11:59:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 11:59:22,570 INFO L93 Difference]: Finished difference Result 429 states and 741 transitions. [2020-07-17 11:59:22,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-07-17 11:59:22,571 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 572 [2020-07-17 11:59:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 11:59:22,576 INFO L225 Difference]: With dead ends: 429 [2020-07-17 11:59:22,576 INFO L226 Difference]: Without dead ends: 261 [2020-07-17 11:59:22,580 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 795 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=3601, Unknown=0, NotChecked=0, Total=4160 [2020-07-17 11:59:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-07-17 11:59:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 204. [2020-07-17 11:59:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-07-17 11:59:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 304 transitions. [2020-07-17 11:59:22,599 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 304 transitions. Word has length 572 [2020-07-17 11:59:22,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 11:59:22,600 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 304 transitions. [2020-07-17 11:59:22,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-07-17 11:59:22,600 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 304 transitions. [2020-07-17 11:59:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-17 11:59:22,604 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 11:59:22,604 INFO L422 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 11:59:22,819 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-17 11:59:22,819 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 11:59:22,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 11:59:22,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1326629730, now seen corresponding path program 6 times [2020-07-17 11:59:22,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 11:59:22,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517643669] [2020-07-17 11:59:22,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 11:59:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 11:59:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 11:59:23,060 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 11:59:23,060 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 11:59:23,061 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 11:59:23,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 11:59:23 BoogieIcfgContainer [2020-07-17 11:59:23,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 11:59:23,164 INFO L168 Benchmark]: Toolchain (without parser) took 24055.49 ms. Allocated memory was 142.6 MB in the beginning and 736.6 MB in the end (delta: 594.0 MB). Free memory was 107.5 MB in the beginning and 378.0 MB in the end (delta: -270.5 MB). Peak memory consumption was 323.5 MB. Max. memory is 7.1 GB. [2020-07-17 11:59:23,165 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 142.6 MB. Free memory was 125.7 MB in the beginning and 125.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 11:59:23,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.42 ms. Allocated memory is still 142.6 MB. Free memory was 107.2 MB in the beginning and 97.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-17 11:59:23,166 INFO L168 Benchmark]: Boogie Preprocessor took 112.42 ms. Allocated memory was 142.6 MB in the beginning and 205.5 MB in the end (delta: 62.9 MB). Free memory was 97.6 MB in the beginning and 184.8 MB in the end (delta: -87.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2020-07-17 11:59:23,167 INFO L168 Benchmark]: RCFGBuilder took 291.52 ms. Allocated memory is still 205.5 MB. Free memory was 184.8 MB in the beginning and 171.1 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-17 11:59:23,167 INFO L168 Benchmark]: TraceAbstraction took 23406.96 ms. Allocated memory was 205.5 MB in the beginning and 736.6 MB in the end (delta: 531.1 MB). Free memory was 170.5 MB in the beginning and 378.0 MB in the end (delta: -207.5 MB). Peak memory consumption was 323.6 MB. Max. memory is 7.1 GB. [2020-07-17 11:59:23,170 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.24 ms. Allocated memory is still 142.6 MB. Free memory was 125.7 MB in the beginning and 125.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 237.42 ms. Allocated memory is still 142.6 MB. Free memory was 107.2 MB in the beginning and 97.6 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.42 ms. Allocated memory was 142.6 MB in the beginning and 205.5 MB in the end (delta: 62.9 MB). Free memory was 97.6 MB in the beginning and 184.8 MB in the end (delta: -87.2 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 291.52 ms. Allocated memory is still 205.5 MB. Free memory was 184.8 MB in the beginning and 171.1 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23406.96 ms. Allocated memory was 205.5 MB in the beginning and 736.6 MB in the end (delta: 531.1 MB). Free memory was 170.5 MB in the beginning and 378.0 MB in the end (delta: -207.5 MB). Peak memory consumption was 323.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 8; VAL [x=8] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L37] int result = fibo1(x); [L38] COND TRUE result == 21 VAL [result=21, x=8] [L39] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.2s, OverallIterations: 15, TraceHistogramMax: 42, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 468 SDtfs, 965 SDslu, 3433 SDs, 0 SdLazy, 6133 SolverSat, 1055 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3450 GetRequests, 3084 SyntacticMatches, 0 SemanticMatches, 366 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2715 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 350 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 5274 NumberOfCodeBlocks, 4852 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 4785 ConstructedInterpolants, 0 QuantifiedInterpolants, 2295169 SizeOfPredicates, 72 NumberOfNonLiveVariables, 4350 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 42046/49770 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...