/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-86f66a4 [2020-07-07 11:11:32,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 11:11:32,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 11:11:32,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 11:11:32,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 11:11:32,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 11:11:32,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 11:11:32,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 11:11:32,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 11:11:32,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 11:11:32,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 11:11:32,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 11:11:32,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 11:11:32,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 11:11:32,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 11:11:32,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 11:11:32,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 11:11:32,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 11:11:32,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 11:11:32,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 11:11:32,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 11:11:32,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 11:11:32,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 11:11:32,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 11:11:32,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 11:11:32,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 11:11:32,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 11:11:32,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 11:11:32,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 11:11:32,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 11:11:32,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 11:11:32,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 11:11:32,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 11:11:32,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 11:11:32,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 11:11:32,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 11:11:32,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 11:11:32,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 11:11:32,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 11:11:32,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 11:11:32,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 11:11:32,481 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-07 11:11:32,502 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 11:11:32,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 11:11:32,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 11:11:32,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 11:11:32,505 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 11:11:32,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 11:11:32,505 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 11:11:32,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 11:11:32,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 11:11:32,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 11:11:32,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 11:11:32,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 11:11:32,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 11:11:32,507 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 11:11:32,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 11:11:32,507 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 11:11:32,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 11:11:32,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 11:11:32,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 11:11:32,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 11:11:32,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 11:11:32,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:11:32,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 11:11:32,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 11:11:32,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 11:11:32,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 11:11:32,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 11:11:32,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 11:11:32,511 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 11:11:32,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 11:11:32,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 11:11:32,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 11:11:32,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 11:11:32,833 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 11:11:32,833 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 11:11:32,834 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-07 11:11:32,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14ddf0b96/b4fc97d127f14a08857fd3adb4db6707/FLAG56c74ecf5 [2020-07-07 11:11:33,385 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 11:11:33,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c [2020-07-07 11:11:33,393 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14ddf0b96/b4fc97d127f14a08857fd3adb4db6707/FLAG56c74ecf5 [2020-07-07 11:11:33,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14ddf0b96/b4fc97d127f14a08857fd3adb4db6707 [2020-07-07 11:11:33,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 11:11:33,752 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 11:11:33,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 11:11:33,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 11:11:33,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 11:11:33,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:11:33" (1/1) ... [2020-07-07 11:11:33,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af4d6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:33, skipping insertion in model container [2020-07-07 11:11:33,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:11:33" (1/1) ... [2020-07-07 11:11:33,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 11:11:33,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 11:11:33,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:11:33,975 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 11:11:33,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:11:34,009 INFO L208 MainTranslator]: Completed translation [2020-07-07 11:11:34,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:34 WrapperNode [2020-07-07 11:11:34,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 11:11:34,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 11:11:34,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 11:11:34,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 11:11:34,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:34" (1/1) ... [2020-07-07 11:11:34,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:34" (1/1) ... [2020-07-07 11:11:34,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:34" (1/1) ... [2020-07-07 11:11:34,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:34" (1/1) ... [2020-07-07 11:11:34,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:34" (1/1) ... [2020-07-07 11:11:34,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:34" (1/1) ... [2020-07-07 11:11:34,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:34" (1/1) ... [2020-07-07 11:11:34,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 11:11:34,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 11:11:34,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 11:11:34,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 11:11:34,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:11:34,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 11:11:34,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 11:11:34,210 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-07 11:11:34,211 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-07 11:11:34,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 11:11:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 11:11:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 11:11:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-07 11:11:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-07 11:11:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 11:11:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 11:11:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 11:11:34,426 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 11:11:34,427 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-07 11:11:34,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:11:34 BoogieIcfgContainer [2020-07-07 11:11:34,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 11:11:34,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 11:11:34,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 11:11:34,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 11:11:34,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 11:11:33" (1/3) ... [2020-07-07 11:11:34,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff08a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:11:34, skipping insertion in model container [2020-07-07 11:11:34,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:11:34" (2/3) ... [2020-07-07 11:11:34,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff08a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:11:34, skipping insertion in model container [2020-07-07 11:11:34,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:11:34" (3/3) ... [2020-07-07 11:11:34,440 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2020-07-07 11:11:34,453 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 11:11:34,462 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 11:11:34,479 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 11:11:34,508 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 11:11:34,509 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 11:11:34,509 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 11:11:34,509 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 11:11:34,509 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 11:11:34,510 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 11:11:34,510 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 11:11:34,510 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 11:11:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-07 11:11:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-07 11:11:34,546 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:34,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:34,550 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:34,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:34,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-07-07 11:11:34,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:34,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476487674] [2020-07-07 11:11:34,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:11:34,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476487674] [2020-07-07 11:11:34,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:11:34,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:11:34,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59410851] [2020-07-07 11:11:34,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:11:34,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:34,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:11:34,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:11:34,871 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-07 11:11:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:34,985 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-07 11:11:34,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:11:34,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-07 11:11:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:35,000 INFO L225 Difference]: With dead ends: 44 [2020-07-07 11:11:35,000 INFO L226 Difference]: Without dead ends: 30 [2020-07-07 11:11:35,004 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-07 11:11:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-07 11:11:35,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-07 11:11:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-07 11:11:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-07 11:11:35,059 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-07-07 11:11:35,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:35,059 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-07 11:11:35,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:11:35,060 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-07 11:11:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-07 11:11:35,062 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:35,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:35,063 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 11:11:35,064 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:35,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:35,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-07-07 11:11:35,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:35,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420602936] [2020-07-07 11:11:35,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:11:35,132 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420602936] [2020-07-07 11:11:35,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:11:35,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:11:35,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293289990] [2020-07-07 11:11:35,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:11:35,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:35,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:11:35,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:11:35,137 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-07-07 11:11:35,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:35,216 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-07 11:11:35,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:11:35,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-07 11:11:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:35,218 INFO L225 Difference]: With dead ends: 36 [2020-07-07 11:11:35,219 INFO L226 Difference]: Without dead ends: 32 [2020-07-07 11:11:35,220 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-07 11:11:35,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-07 11:11:35,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-07 11:11:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-07 11:11:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-07 11:11:35,231 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-07-07 11:11:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:35,231 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-07 11:11:35,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:11:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-07 11:11:35,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-07 11:11:35,233 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:35,234 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-07 11:11:35,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 11:11:35,234 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:35,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:35,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-07-07 11:11:35,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:35,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436758630] [2020-07-07 11:11:35,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:35,392 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-07 11:11:35,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436758630] [2020-07-07 11:11:35,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855308240] [2020-07-07 11:11:35,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:35,436 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-07 11:11:35,443 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:35,533 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-07 11:11:35,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:35,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-07 11:11:35,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118905210] [2020-07-07 11:11:35,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:11:35,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:35,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:11:35,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:11:35,537 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-07-07 11:11:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:35,777 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-07 11:11:35,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-07 11:11:35,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-07 11:11:35,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:35,780 INFO L225 Difference]: With dead ends: 58 [2020-07-07 11:11:35,780 INFO L226 Difference]: Without dead ends: 34 [2020-07-07 11:11:35,781 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 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-07 11:11:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-07 11:11:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-07 11:11:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-07 11:11:35,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-07 11:11:35,791 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-07-07 11:11:35,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:35,791 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-07 11:11:35,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:11:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-07 11:11:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-07 11:11:35,794 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:35,794 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-07 11:11:36,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-07 11:11:36,010 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:36,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:36,012 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-07-07 11:11:36,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:36,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016498344] [2020-07-07 11:11:36,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:36,160 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-07 11:11:36,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016498344] [2020-07-07 11:11:36,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328684164] [2020-07-07 11:11:36,161 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) [2020-07-07 11:11:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:36,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-07 11:11:36,194 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:36,241 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-07 11:11:36,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:36,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-07-07 11:11:36,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458394542] [2020-07-07 11:11:36,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-07 11:11:36,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:36,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-07 11:11:36,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-07 11:11:36,246 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 10 states. [2020-07-07 11:11:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:36,458 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-07-07 11:11:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 11:11:36,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-07 11:11:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:36,462 INFO L225 Difference]: With dead ends: 54 [2020-07-07 11:11:36,463 INFO L226 Difference]: Without dead ends: 50 [2020-07-07 11:11:36,464 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:11:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-07 11:11:36,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-07 11:11:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-07 11:11:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-07-07 11:11:36,477 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-07-07 11:11:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:36,477 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-07-07 11:11:36,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-07 11:11:36,478 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-07-07 11:11:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-07 11:11:36,480 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:36,480 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-07 11:11:36,693 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:36,695 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:36,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:36,696 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-07-07 11:11:36,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:36,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518106276] [2020-07-07 11:11:36,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:36,855 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-07 11:11:36,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518106276] [2020-07-07 11:11:36,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625677435] [2020-07-07 11:11:36,856 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-07 11:11:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:36,899 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-07 11:11:36,902 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:36,983 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-07 11:11:36,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:36,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-07-07 11:11:36,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003667834] [2020-07-07 11:11:36,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 11:11:36,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:36,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 11:11:36,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:11:36,987 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 11 states. [2020-07-07 11:11:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:37,323 INFO L93 Difference]: Finished difference Result 108 states and 170 transitions. [2020-07-07 11:11:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-07 11:11:37,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-07 11:11:37,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:37,327 INFO L225 Difference]: With dead ends: 108 [2020-07-07 11:11:37,327 INFO L226 Difference]: Without dead ends: 66 [2020-07-07 11:11:37,329 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 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-07 11:11:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-07 11:11:37,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-07 11:11:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-07 11:11:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2020-07-07 11:11:37,345 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2020-07-07 11:11:37,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:37,346 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2020-07-07 11:11:37,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 11:11:37,346 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-07-07 11:11:37,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-07 11:11:37,349 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:37,349 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-07 11:11:37,564 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:37,565 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:37,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:37,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-07-07 11:11:37,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:37,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642876439] [2020-07-07 11:11:37,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:37,770 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-07 11:11:37,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642876439] [2020-07-07 11:11:37,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321971357] [2020-07-07 11:11:37,772 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-07 11:11:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:37,811 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-07 11:11:37,814 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:37,907 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-07 11:11:37,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:37,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-07 11:11:37,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816174607] [2020-07-07 11:11:37,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 11:11:37,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:37,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 11:11:37,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:11:37,910 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand 14 states. [2020-07-07 11:11:38,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:38,422 INFO L93 Difference]: Finished difference Result 180 states and 324 transitions. [2020-07-07 11:11:38,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-07 11:11:38,422 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2020-07-07 11:11:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:38,429 INFO L225 Difference]: With dead ends: 180 [2020-07-07 11:11:38,429 INFO L226 Difference]: Without dead ends: 120 [2020-07-07 11:11:38,434 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-07-07 11:11:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-07 11:11:38,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2020-07-07 11:11:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-07 11:11:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 169 transitions. [2020-07-07 11:11:38,461 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 169 transitions. Word has length 40 [2020-07-07 11:11:38,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:38,462 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 169 transitions. [2020-07-07 11:11:38,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 11:11:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 169 transitions. [2020-07-07 11:11:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-07 11:11:38,467 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:38,467 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-07 11:11:38,684 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:38,685 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:38,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:38,686 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-07-07 11:11:38,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:38,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248760591] [2020-07-07 11:11:38,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:38,883 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-07 11:11:38,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248760591] [2020-07-07 11:11:38,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245529762] [2020-07-07 11:11:38,884 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-07 11:11:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:38,929 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-07 11:11:38,949 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:39,081 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-07 11:11:39,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:39,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-07-07 11:11:39,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105120590] [2020-07-07 11:11:39,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-07 11:11:39,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:39,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-07 11:11:39,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-07-07 11:11:39,084 INFO L87 Difference]: Start difference. First operand 106 states and 169 transitions. Second operand 15 states. [2020-07-07 11:11:39,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:39,799 INFO L93 Difference]: Finished difference Result 258 states and 498 transitions. [2020-07-07 11:11:39,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 11:11:39,804 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2020-07-07 11:11:39,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:39,809 INFO L225 Difference]: With dead ends: 258 [2020-07-07 11:11:39,809 INFO L226 Difference]: Without dead ends: 158 [2020-07-07 11:11:39,811 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-07-07 11:11:39,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-07 11:11:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2020-07-07 11:11:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-07 11:11:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 180 transitions. [2020-07-07 11:11:39,878 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 180 transitions. Word has length 54 [2020-07-07 11:11:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:39,879 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 180 transitions. [2020-07-07 11:11:39,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-07 11:11:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 180 transitions. [2020-07-07 11:11:39,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-07 11:11:39,893 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:39,894 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:40,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-07 11:11:40,095 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:40,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1229769625, now seen corresponding path program 1 times [2020-07-07 11:11:40,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:40,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457308504] [2020-07-07 11:11:40,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 40 proven. 57 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-07-07 11:11:40,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457308504] [2020-07-07 11:11:40,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325001341] [2020-07-07 11:11:40,435 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-07 11:11:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:40,493 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-07 11:11:40,498 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2020-07-07 11:11:40,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:40,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2020-07-07 11:11:40,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591847601] [2020-07-07 11:11:40,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-07 11:11:40,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:40,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-07 11:11:40,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2020-07-07 11:11:40,669 INFO L87 Difference]: Start difference. First operand 112 states and 180 transitions. Second operand 18 states. [2020-07-07 11:11:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:41,482 INFO L93 Difference]: Finished difference Result 243 states and 465 transitions. [2020-07-07 11:11:41,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-07 11:11:41,484 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2020-07-07 11:11:41,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:41,487 INFO L225 Difference]: With dead ends: 243 [2020-07-07 11:11:41,487 INFO L226 Difference]: Without dead ends: 110 [2020-07-07 11:11:41,490 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2020-07-07 11:11:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-07 11:11:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2020-07-07 11:11:41,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-07 11:11:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2020-07-07 11:11:41,507 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 96 [2020-07-07 11:11:41,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:41,508 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2020-07-07 11:11:41,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-07 11:11:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2020-07-07 11:11:41,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-07-07 11:11:41,511 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:41,511 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:41,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:41,726 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:41,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:41,727 INFO L82 PathProgramCache]: Analyzing trace with hash 665434804, now seen corresponding path program 1 times [2020-07-07 11:11:41,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:41,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874091606] [2020-07-07 11:11:41,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 62 proven. 123 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2020-07-07 11:11:42,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874091606] [2020-07-07 11:11:42,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653650622] [2020-07-07 11:11:42,221 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-07 11:11:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:42,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-07 11:11:42,313 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 25 proven. 190 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2020-07-07 11:11:42,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:42,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2020-07-07 11:11:42,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984100604] [2020-07-07 11:11:42,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-07 11:11:42,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:42,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-07 11:11:42,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-07-07 11:11:42,493 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 19 states. [2020-07-07 11:11:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:43,410 INFO L93 Difference]: Finished difference Result 217 states and 375 transitions. [2020-07-07 11:11:43,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-07 11:11:43,411 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 137 [2020-07-07 11:11:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:43,415 INFO L225 Difference]: With dead ends: 217 [2020-07-07 11:11:43,415 INFO L226 Difference]: Without dead ends: 137 [2020-07-07 11:11:43,418 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2020-07-07 11:11:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-07 11:11:43,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2020-07-07 11:11:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-07 11:11:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2020-07-07 11:11:43,437 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 137 [2020-07-07 11:11:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:43,437 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2020-07-07 11:11:43,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-07 11:11:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2020-07-07 11:11:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2020-07-07 11:11:43,445 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:43,446 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 26, 26, 22, 21, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 8, 8, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:43,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:43,662 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:43,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:43,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1635105538, now seen corresponding path program 2 times [2020-07-07 11:11:43,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:43,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827006176] [2020-07-07 11:11:43,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4041 backedges. 203 proven. 574 refuted. 0 times theorem prover too weak. 3264 trivial. 0 not checked. [2020-07-07 11:11:45,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827006176] [2020-07-07 11:11:45,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364412191] [2020-07-07 11:11:45,227 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:45,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-07 11:11:45,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 11:11:45,401 INFO L264 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-07 11:11:45,419 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4041 backedges. 113 proven. 807 refuted. 0 times theorem prover too weak. 3121 trivial. 0 not checked. [2020-07-07 11:11:45,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:45,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2020-07-07 11:11:45,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750979885] [2020-07-07 11:11:45,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-07 11:11:45,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:45,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-07 11:11:45,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2020-07-07 11:11:45,810 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand 20 states. [2020-07-07 11:11:46,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:46,909 INFO L93 Difference]: Finished difference Result 263 states and 450 transitions. [2020-07-07 11:11:46,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-07 11:11:46,911 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 380 [2020-07-07 11:11:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:46,920 INFO L225 Difference]: With dead ends: 263 [2020-07-07 11:11:46,920 INFO L226 Difference]: Without dead ends: 158 [2020-07-07 11:11:46,925 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2020-07-07 11:11:46,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-07 11:11:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2020-07-07 11:11:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-07-07 11:11:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 227 transitions. [2020-07-07 11:11:46,983 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 227 transitions. Word has length 380 [2020-07-07 11:11:46,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:46,984 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 227 transitions. [2020-07-07 11:11:46,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-07 11:11:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 227 transitions. [2020-07-07 11:11:47,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2020-07-07 11:11:47,010 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:47,011 INFO L422 BasicCegarLoop]: trace histogram [36, 36, 31, 31, 27, 26, 18, 18, 18, 18, 18, 18, 18, 15, 15, 15, 15, 15, 15, 15, 12, 9, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:47,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-07 11:11:47,228 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:47,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:47,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2116007060, now seen corresponding path program 3 times [2020-07-07 11:11:47,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:47,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074449205] [2020-07-07 11:11:47,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6088 backedges. 288 proven. 774 refuted. 0 times theorem prover too weak. 5026 trivial. 0 not checked. [2020-07-07 11:11:48,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074449205] [2020-07-07 11:11:48,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150320653] [2020-07-07 11:11:48,924 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:49,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2020-07-07 11:11:49,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 11:11:49,028 INFO L264 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-07 11:11:49,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6088 backedges. 910 proven. 42 refuted. 0 times theorem prover too weak. 5136 trivial. 0 not checked. [2020-07-07 11:11:49,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:49,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2020-07-07 11:11:49,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969500951] [2020-07-07 11:11:49,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-07 11:11:49,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:49,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-07 11:11:49,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2020-07-07 11:11:49,515 INFO L87 Difference]: Start difference. First operand 148 states and 227 transitions. Second operand 21 states. [2020-07-07 11:11:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:50,262 INFO L93 Difference]: Finished difference Result 311 states and 523 transitions. [2020-07-07 11:11:50,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-07 11:11:50,263 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 462 [2020-07-07 11:11:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:50,268 INFO L225 Difference]: With dead ends: 311 [2020-07-07 11:11:50,268 INFO L226 Difference]: Without dead ends: 171 [2020-07-07 11:11:50,271 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2020-07-07 11:11:50,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-07 11:11:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2020-07-07 11:11:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-07-07 11:11:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 246 transitions. [2020-07-07 11:11:50,291 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 246 transitions. Word has length 462 [2020-07-07 11:11:50,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:50,292 INFO L479 AbstractCegarLoop]: Abstraction has 168 states and 246 transitions. [2020-07-07 11:11:50,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-07 11:11:50,292 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 246 transitions. [2020-07-07 11:11:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2020-07-07 11:11:50,299 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:50,300 INFO L422 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 30, 29, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 12, 11, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:11:50,515 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:50,516 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:50,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:50,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1110022815, now seen corresponding path program 4 times [2020-07-07 11:11:50,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:50,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745392999] [2020-07-07 11:11:50,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7249 backedges. 395 proven. 1348 refuted. 0 times theorem prover too weak. 5506 trivial. 0 not checked. [2020-07-07 11:11:53,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745392999] [2020-07-07 11:11:53,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137259192] [2020-07-07 11:11:53,223 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 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-07 11:11:53,450 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-07 11:11:53,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 11:11:53,459 INFO L264 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-07 11:11:53,488 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:53,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7249 backedges. 455 proven. 987 refuted. 0 times theorem prover too weak. 5807 trivial. 0 not checked. [2020-07-07 11:11:53,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:53,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13] total 29 [2020-07-07 11:11:53,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365665386] [2020-07-07 11:11:53,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-07-07 11:11:53,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:53,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-07-07 11:11:53,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2020-07-07 11:11:53,967 INFO L87 Difference]: Start difference. First operand 168 states and 246 transitions. Second operand 29 states. [2020-07-07 11:11:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:55,866 INFO L93 Difference]: Finished difference Result 391 states and 657 transitions. [2020-07-07 11:11:55,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-07-07 11:11:55,867 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 504 [2020-07-07 11:11:55,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:55,876 INFO L225 Difference]: With dead ends: 391 [2020-07-07 11:11:55,876 INFO L226 Difference]: Without dead ends: 186 [2020-07-07 11:11:55,881 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 646 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=348, Invalid=2202, Unknown=0, NotChecked=0, Total=2550 [2020-07-07 11:11:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-07-07 11:11:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 167. [2020-07-07 11:11:55,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-07-07 11:11:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 226 transitions. [2020-07-07 11:11:55,913 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 226 transitions. Word has length 504 [2020-07-07 11:11:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:55,915 INFO L479 AbstractCegarLoop]: Abstraction has 167 states and 226 transitions. [2020-07-07 11:11:55,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-07-07 11:11:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 226 transitions. [2020-07-07 11:11:55,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2020-07-07 11:11:55,921 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:55,922 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-07 11:11:56,136 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:11:56,137 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:56,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:56,138 INFO L82 PathProgramCache]: Analyzing trace with hash 725561814, now seen corresponding path program 5 times [2020-07-07 11:11:56,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:56,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580408969] [2020-07-07 11:11:56,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 332 proven. 772 refuted. 0 times theorem prover too weak. 3605 trivial. 0 not checked. [2020-07-07 11:11:57,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580408969] [2020-07-07 11:11:57,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540447381] [2020-07-07 11:11:57,847 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 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-07 11:11:58,010 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2020-07-07 11:11:58,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 11:11:58,015 INFO L264 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-07 11:11:58,026 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:11:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4709 backedges. 2424 proven. 63 refuted. 0 times theorem prover too weak. 2222 trivial. 0 not checked. [2020-07-07 11:11:58,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:11:58,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 24 [2020-07-07 11:11:58,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757709365] [2020-07-07 11:11:58,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-07 11:11:58,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:11:58,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-07 11:11:58,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2020-07-07 11:11:58,304 INFO L87 Difference]: Start difference. First operand 167 states and 226 transitions. Second operand 24 states. [2020-07-07 11:11:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:11:58,975 INFO L93 Difference]: Finished difference Result 330 states and 456 transitions. [2020-07-07 11:11:58,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-07 11:11:58,975 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 409 [2020-07-07 11:11:58,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:11:58,979 INFO L225 Difference]: With dead ends: 330 [2020-07-07 11:11:58,979 INFO L226 Difference]: Without dead ends: 173 [2020-07-07 11:11:58,981 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 524 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2020-07-07 11:11:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-07-07 11:11:59,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 167. [2020-07-07 11:11:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-07-07 11:11:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 219 transitions. [2020-07-07 11:11:59,005 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 219 transitions. Word has length 409 [2020-07-07 11:11:59,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:11:59,006 INFO L479 AbstractCegarLoop]: Abstraction has 167 states and 219 transitions. [2020-07-07 11:11:59,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-07 11:11:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 219 transitions. [2020-07-07 11:11:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2020-07-07 11:11:59,010 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:11:59,010 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-07 11:11:59,225 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-07 11:11:59,225 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:11:59,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:11:59,226 INFO L82 PathProgramCache]: Analyzing trace with hash -515597281, now seen corresponding path program 6 times [2020-07-07 11:11:59,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:11:59,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576219495] [2020-07-07 11:11:59,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:11:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:11:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 461 proven. 880 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2020-07-07 11:12:00,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576219495] [2020-07-07 11:12:00,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244893054] [2020-07-07 11:12:00,903 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:12:01,119 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2020-07-07 11:12:01,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 11:12:01,124 INFO L264 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-07 11:12:01,134 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:12:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 5016 backedges. 341 proven. 409 refuted. 0 times theorem prover too weak. 4266 trivial. 0 not checked. [2020-07-07 11:12:01,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:12:01,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10] total 26 [2020-07-07 11:12:01,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616100933] [2020-07-07 11:12:01,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-07-07 11:12:01,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:12:01,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-07-07 11:12:01,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2020-07-07 11:12:01,381 INFO L87 Difference]: Start difference. First operand 167 states and 219 transitions. Second operand 26 states. [2020-07-07 11:12:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:12:02,535 INFO L93 Difference]: Finished difference Result 374 states and 514 transitions. [2020-07-07 11:12:02,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-07-07 11:12:02,539 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 422 [2020-07-07 11:12:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:12:02,543 INFO L225 Difference]: With dead ends: 374 [2020-07-07 11:12:02,543 INFO L226 Difference]: Without dead ends: 207 [2020-07-07 11:12:02,546 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=252, Invalid=1554, Unknown=0, NotChecked=0, Total=1806 [2020-07-07 11:12:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-07-07 11:12:02,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 178. [2020-07-07 11:12:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-07-07 11:12:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 231 transitions. [2020-07-07 11:12:02,563 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 231 transitions. Word has length 422 [2020-07-07 11:12:02,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:12:02,564 INFO L479 AbstractCegarLoop]: Abstraction has 178 states and 231 transitions. [2020-07-07 11:12:02,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-07-07 11:12:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 231 transitions. [2020-07-07 11:12:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-07-07 11:12:02,570 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:12:02,571 INFO L422 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 31, 31, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 12, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:12:02,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-07 11:12:02,787 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:12:02,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:12:02,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1759823621, now seen corresponding path program 7 times [2020-07-07 11:12:02,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:12:02,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429435663] [2020-07-07 11:12:02,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:12:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 702 proven. 1548 refuted. 0 times theorem prover too weak. 5824 trivial. 0 not checked. [2020-07-07 11:12:05,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429435663] [2020-07-07 11:12:05,530 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601997580] [2020-07-07 11:12:05,530 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:12:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:05,771 INFO L264 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-07 11:12:05,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:12:06,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8074 backedges. 760 proven. 830 refuted. 0 times theorem prover too weak. 6484 trivial. 0 not checked. [2020-07-07 11:12:06,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:12:06,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13] total 33 [2020-07-07 11:12:06,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076490861] [2020-07-07 11:12:06,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-07-07 11:12:06,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:12:06,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-07-07 11:12:06,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2020-07-07 11:12:06,197 INFO L87 Difference]: Start difference. First operand 178 states and 231 transitions. Second operand 33 states. [2020-07-07 11:12:08,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:12:08,127 INFO L93 Difference]: Finished difference Result 403 states and 605 transitions. [2020-07-07 11:12:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-07-07 11:12:08,128 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 531 [2020-07-07 11:12:08,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:12:08,133 INFO L225 Difference]: With dead ends: 403 [2020-07-07 11:12:08,133 INFO L226 Difference]: Without dead ends: 218 [2020-07-07 11:12:08,138 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 681 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1381 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=556, Invalid=3866, Unknown=0, NotChecked=0, Total=4422 [2020-07-07 11:12:08,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2020-07-07 11:12:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 175. [2020-07-07 11:12:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-07-07 11:12:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2020-07-07 11:12:08,155 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 531 [2020-07-07 11:12:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:12:08,156 INFO L479 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2020-07-07 11:12:08,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-07-07 11:12:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2020-07-07 11:12:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2020-07-07 11:12:08,161 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:12:08,161 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 23, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:12:08,375 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-07 11:12:08,376 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:12:08,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:12:08,377 INFO L82 PathProgramCache]: Analyzing trace with hash 634662915, now seen corresponding path program 8 times [2020-07-07 11:12:08,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:12:08,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767200013] [2020-07-07 11:12:08,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:12:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 726 proven. 662 refuted. 0 times theorem prover too weak. 2982 trivial. 0 not checked. [2020-07-07 11:12:10,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767200013] [2020-07-07 11:12:10,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147268737] [2020-07-07 11:12:10,128 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:12:10,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-07 11:12:10,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 11:12:10,325 INFO L264 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-07 11:12:10,353 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:12:10,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4370 backedges. 655 proven. 176 refuted. 0 times theorem prover too weak. 3539 trivial. 0 not checked. [2020-07-07 11:12:10,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:12:10,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 11] total 28 [2020-07-07 11:12:10,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817509256] [2020-07-07 11:12:10,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-07-07 11:12:10,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:12:10,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-07-07 11:12:10,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2020-07-07 11:12:10,555 INFO L87 Difference]: Start difference. First operand 175 states and 216 transitions. Second operand 28 states. [2020-07-07 11:12:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:12:11,598 INFO L93 Difference]: Finished difference Result 374 states and 476 transitions. [2020-07-07 11:12:11,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-07-07 11:12:11,599 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 395 [2020-07-07 11:12:11,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:12:11,603 INFO L225 Difference]: With dead ends: 374 [2020-07-07 11:12:11,603 INFO L226 Difference]: Without dead ends: 210 [2020-07-07 11:12:11,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=1557, Unknown=0, NotChecked=0, Total=1806 [2020-07-07 11:12:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-07-07 11:12:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 176. [2020-07-07 11:12:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-07-07 11:12:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 210 transitions. [2020-07-07 11:12:11,621 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 210 transitions. Word has length 395 [2020-07-07 11:12:11,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:12:11,622 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 210 transitions. [2020-07-07 11:12:11,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-07-07 11:12:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 210 transitions. [2020-07-07 11:12:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2020-07-07 11:12:11,629 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:12:11,630 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-07 11:12:11,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:12:11,845 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:12:11,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:12:11,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2122481566, now seen corresponding path program 9 times [2020-07-07 11:12:11,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:12:11,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402790868] [2020-07-07 11:12:11,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:12:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:12:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 835 proven. 1688 refuted. 0 times theorem prover too weak. 6890 trivial. 0 not checked. [2020-07-07 11:12:14,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402790868] [2020-07-07 11:12:14,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698089216] [2020-07-07 11:12:14,492 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:12:14,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2020-07-07 11:12:14,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 11:12:14,672 INFO L264 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-07 11:12:14,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:12:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 874 proven. 170 refuted. 0 times theorem prover too weak. 8369 trivial. 0 not checked. [2020-07-07 11:12:15,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:12:15,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 10] total 35 [2020-07-07 11:12:15,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031312437] [2020-07-07 11:12:15,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-07-07 11:12:15,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:12:15,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-07-07 11:12:15,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2020-07-07 11:12:15,085 INFO L87 Difference]: Start difference. First operand 176 states and 210 transitions. Second operand 35 states. [2020-07-07 11:12:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:12:17,096 INFO L93 Difference]: Finished difference Result 376 states and 467 transitions. [2020-07-07 11:12:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-07-07 11:12:17,097 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 572 [2020-07-07 11:12:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:12:17,102 INFO L225 Difference]: With dead ends: 376 [2020-07-07 11:12:17,102 INFO L226 Difference]: Without dead ends: 242 [2020-07-07 11:12:17,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=551, Invalid=3871, Unknown=0, NotChecked=0, Total=4422 [2020-07-07 11:12:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-07-07 11:12:17,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 185. [2020-07-07 11:12:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-07-07 11:12:17,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 216 transitions. [2020-07-07 11:12:17,125 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 216 transitions. Word has length 572 [2020-07-07 11:12:17,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:12:17,126 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 216 transitions. [2020-07-07 11:12:17,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-07-07 11:12:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 216 transitions. [2020-07-07 11:12:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-07-07 11:12:17,132 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:12:17,133 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-07 11:12:17,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-07-07 11:12:17,348 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:12:17,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:12:17,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1326629730, now seen corresponding path program 10 times [2020-07-07 11:12:17,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:12:17,350 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016098593] [2020-07-07 11:12:17,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:12:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:12:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:12:17,727 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-07 11:12:17,728 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 11:12:17,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-07 11:12:17,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 11:12:17 BoogieIcfgContainer [2020-07-07 11:12:17,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 11:12:17,911 INFO L168 Benchmark]: Toolchain (without parser) took 44158.04 ms. Allocated memory was 144.2 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 102.7 MB in the beginning and 574.7 MB in the end (delta: -471.9 MB). Peak memory consumption was 570.9 MB. Max. memory is 7.1 GB. [2020-07-07 11:12:17,912 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-07 11:12:17,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.08 ms. Allocated memory is still 144.2 MB. Free memory was 102.5 MB in the beginning and 92.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-07 11:12:17,913 INFO L168 Benchmark]: Boogie Preprocessor took 135.41 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 92.9 MB in the beginning and 180.1 MB in the end (delta: -87.2 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-07 11:12:17,914 INFO L168 Benchmark]: RCFGBuilder took 284.36 ms. Allocated memory is still 201.3 MB. Free memory was 180.1 MB in the beginning and 166.3 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-07 11:12:17,915 INFO L168 Benchmark]: TraceAbstraction took 43475.28 ms. Allocated memory was 201.3 MB in the beginning and 1.2 GB in the end (delta: 985.7 MB). Free memory was 166.3 MB in the beginning and 574.7 MB in the end (delta: -408.3 MB). Peak memory consumption was 577.3 MB. Max. memory is 7.1 GB. [2020-07-07 11:12:17,922 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.48 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 257.08 ms. Allocated memory is still 144.2 MB. Free memory was 102.5 MB in the beginning and 92.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.41 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 92.9 MB in the beginning and 180.1 MB in the end (delta: -87.2 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 284.36 ms. Allocated memory is still 201.3 MB. Free memory was 180.1 MB in the beginning and 166.3 MB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43475.28 ms. Allocated memory was 201.3 MB in the beginning and 1.2 GB in the end (delta: 985.7 MB). Free memory was 166.3 MB in the beginning and 574.7 MB in the end (delta: -408.3 MB). Peak memory consumption was 577.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 8; VAL [x=8] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=21, x=8] [L37] int result = fibo1(x); [L38] COND TRUE result == 21 VAL [result=21, x=8] [L39] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 43.2s, OverallIterations: 18, TraceHistogramMax: 42, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 597 SDtfs, 1422 SDslu, 5034 SDs, 0 SdLazy, 8758 SolverSat, 1645 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5765 GetRequests, 5265 SyntacticMatches, 0 SemanticMatches, 500 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5513 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 310 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 8678 NumberOfCodeBlocks, 7794 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 8183 ConstructedInterpolants, 0 QuantifiedInterpolants, 4565855 SizeOfPredicates, 89 NumberOfNonLiveVariables, 7102 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 32 InterpolantComputations, 2 PerfectInterpolantSequences, 87174/99430 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...