/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 17:18:58,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 17:18:58,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 17:18:58,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 17:18:58,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 17:18:58,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 17:18:58,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 17:18:58,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 17:18:58,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 17:18:58,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 17:18:58,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 17:18:58,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 17:18:58,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 17:18:58,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 17:18:58,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 17:18:58,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 17:18:58,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 17:18:58,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 17:18:58,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 17:18:58,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 17:18:58,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 17:18:58,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 17:18:58,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 17:18:58,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 17:18:58,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 17:18:58,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 17:18:58,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 17:18:58,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 17:18:58,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 17:18:58,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 17:18:58,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 17:18:58,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 17:18:58,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 17:18:58,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 17:18:58,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 17:18:58,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 17:18:58,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 17:18:58,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 17:18:58,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 17:18:58,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 17:18:58,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 17:18:58,397 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 17:18:58,416 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 17:18:58,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 17:18:58,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 17:18:58,419 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 17:18:58,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 17:18:58,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 17:18:58,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 17:18:58,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 17:18:58,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 17:18:58,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 17:18:58,421 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 17:18:58,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 17:18:58,422 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 17:18:58,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 17:18:58,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 17:18:58,422 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 17:18:58,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 17:18:58,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 17:18:58,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:18:58,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 17:18:58,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 17:18:58,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 17:18:58,424 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-17 17:18:58,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 17:18:58,707 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 17:18:58,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 17:18:58,712 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 17:18:58,712 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 17:18:58,713 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-07-17 17:18:58,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e985e5c/6829e562c9af431e82b26ecaa70894a9/FLAG9dc70c10b [2020-07-17 17:18:59,249 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 17:18:59,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-1.c [2020-07-17 17:18:59,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e985e5c/6829e562c9af431e82b26ecaa70894a9/FLAG9dc70c10b [2020-07-17 17:18:59,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e985e5c/6829e562c9af431e82b26ecaa70894a9 [2020-07-17 17:18:59,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 17:18:59,701 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 17:18:59,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 17:18:59,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 17:18:59,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 17:18:59,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:18:59" (1/1) ... [2020-07-17 17:18:59,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@708afeb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:18:59, skipping insertion in model container [2020-07-17 17:18:59,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:18:59" (1/1) ... [2020-07-17 17:18:59,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 17:18:59,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 17:18:59,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:18:59,960 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 17:18:59,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:18:59,993 INFO L208 MainTranslator]: Completed translation [2020-07-17 17:18:59,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:18:59 WrapperNode [2020-07-17 17:18:59,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 17:18:59,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 17:18:59,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 17:18:59,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 17:19:00,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:18:59" (1/1) ... [2020-07-17 17:19:00,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:18:59" (1/1) ... [2020-07-17 17:19:00,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:18:59" (1/1) ... [2020-07-17 17:19:00,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:18:59" (1/1) ... [2020-07-17 17:19:00,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:18:59" (1/1) ... [2020-07-17 17:19:00,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:18:59" (1/1) ... [2020-07-17 17:19:00,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:18:59" (1/1) ... [2020-07-17 17:19:00,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 17:19:00,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 17:19:00,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 17:19:00,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 17:19:00,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:18:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:19:00,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 17:19:00,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 17:19:00,180 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-17 17:19:00,180 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-17 17:19:00,180 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 17:19:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 17:19:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 17:19:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-17 17:19:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-17 17:19:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 17:19:00,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 17:19:00,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 17:19:00,427 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 17:19:00,427 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 17:19:00,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:19:00 BoogieIcfgContainer [2020-07-17 17:19:00,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 17:19:00,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 17:19:00,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 17:19:00,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 17:19:00,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 05:18:59" (1/3) ... [2020-07-17 17:19:00,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1aa1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:19:00, skipping insertion in model container [2020-07-17 17:19:00,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:18:59" (2/3) ... [2020-07-17 17:19:00,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1aa1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:19:00, skipping insertion in model container [2020-07-17 17:19:00,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:19:00" (3/3) ... [2020-07-17 17:19:00,441 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2020-07-17 17:19:00,453 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 17:19:00,462 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 17:19:00,491 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 17:19:00,556 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 17:19:00,557 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 17:19:00,557 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-17 17:19:00,557 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 17:19:00,557 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 17:19:00,558 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 17:19:00,558 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 17:19:00,558 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 17:19:00,581 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2020-07-17 17:19:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 17:19:00,593 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:00,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:00,595 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:00,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:00,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1089710179, now seen corresponding path program 1 times [2020-07-17 17:19:00,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:00,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1095578265] [2020-07-17 17:19:00,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:19:00,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1095578265] [2020-07-17 17:19:00,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:19:00,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:19:00,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167158254] [2020-07-17 17:19:00,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:19:00,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:00,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:19:00,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:19:00,843 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2020-07-17 17:19:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:00,967 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-17 17:19:00,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:19:00,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-17 17:19:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:00,983 INFO L225 Difference]: With dead ends: 58 [2020-07-17 17:19:00,984 INFO L226 Difference]: Without dead ends: 42 [2020-07-17 17:19:00,988 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:19:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-17 17:19:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-17 17:19:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 17:19:01,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-17 17:19:01,052 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2020-07-17 17:19:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:01,053 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-17 17:19:01,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:19:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-17 17:19:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 17:19:01,056 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:01,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:01,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 17:19:01,057 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:01,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:01,058 INFO L82 PathProgramCache]: Analyzing trace with hash -653728005, now seen corresponding path program 1 times [2020-07-17 17:19:01,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:01,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [622687101] [2020-07-17 17:19:01,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:19:01,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [622687101] [2020-07-17 17:19:01,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:19:01,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:19:01,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738467713] [2020-07-17 17:19:01,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:19:01,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:01,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:19:01,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:19:01,146 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 5 states. [2020-07-17 17:19:01,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:01,262 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-17 17:19:01,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:19:01,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 17:19:01,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:01,266 INFO L225 Difference]: With dead ends: 50 [2020-07-17 17:19:01,268 INFO L226 Difference]: Without dead ends: 44 [2020-07-17 17:19:01,271 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:19:01,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-17 17:19:01,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-17 17:19:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 17:19:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-07-17 17:19:01,289 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2020-07-17 17:19:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:01,290 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-07-17 17:19:01,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:19:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-07-17 17:19:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 17:19:01,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:01,292 INFO L422 BasicCegarLoop]: trace histogram [2, 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] [2020-07-17 17:19:01,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 17:19:01,293 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:01,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1617834856, now seen corresponding path program 1 times [2020-07-17 17:19:01,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:01,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1360543750] [2020-07-17 17:19:01,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 17:19:01,444 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1360543750] [2020-07-17 17:19:01,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:01,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:19:01,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620237969] [2020-07-17 17:19:01,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:19:01,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:01,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:19:01,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:19:01,447 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 7 states. [2020-07-17 17:19:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:01,547 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2020-07-17 17:19:01,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 17:19:01,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-17 17:19:01,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:01,550 INFO L225 Difference]: With dead ends: 82 [2020-07-17 17:19:01,550 INFO L226 Difference]: Without dead ends: 46 [2020-07-17 17:19:01,552 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:19:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-17 17:19:01,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2020-07-17 17:19:01,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-17 17:19:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-07-17 17:19:01,570 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 33 [2020-07-17 17:19:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:01,570 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-07-17 17:19:01,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:19:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-17 17:19:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 17:19:01,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:01,573 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:01,574 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 17:19:01,574 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash 887160861, now seen corresponding path program 1 times [2020-07-17 17:19:01,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:01,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1924982219] [2020-07-17 17:19:01,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 17:19:01,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1924982219] [2020-07-17 17:19:01,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:01,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:19:01,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916709799] [2020-07-17 17:19:01,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:19:01,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:01,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:19:01,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:19:01,740 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2020-07-17 17:19:01,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:01,926 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2020-07-17 17:19:01,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 17:19:01,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-07-17 17:19:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:01,930 INFO L225 Difference]: With dead ends: 74 [2020-07-17 17:19:01,930 INFO L226 Difference]: Without dead ends: 68 [2020-07-17 17:19:01,931 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-17 17:19:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-17 17:19:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-07-17 17:19:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-17 17:19:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2020-07-17 17:19:01,949 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 34 [2020-07-17 17:19:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:01,950 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2020-07-17 17:19:01,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:19:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2020-07-17 17:19:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-17 17:19:01,953 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:01,953 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:01,953 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 17:19:01,953 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:01,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:01,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1875452576, now seen corresponding path program 1 times [2020-07-17 17:19:01,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:01,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1822696052] [2020-07-17 17:19:01,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-17 17:19:02,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1822696052] [2020-07-17 17:19:02,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:02,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 17:19:02,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477332106] [2020-07-17 17:19:02,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 17:19:02,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:02,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 17:19:02,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:19:02,075 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2020-07-17 17:19:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:02,161 INFO L93 Difference]: Finished difference Result 130 states and 178 transitions. [2020-07-17 17:19:02,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 17:19:02,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2020-07-17 17:19:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:02,164 INFO L225 Difference]: With dead ends: 130 [2020-07-17 17:19:02,164 INFO L226 Difference]: Without dead ends: 70 [2020-07-17 17:19:02,166 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:19:02,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-17 17:19:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-17 17:19:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 17:19:02,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-07-17 17:19:02,182 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 50 [2020-07-17 17:19:02,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:02,183 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-07-17 17:19:02,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 17:19:02,183 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-07-17 17:19:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-17 17:19:02,186 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:02,186 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:02,186 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 17:19:02,187 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:02,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:02,187 INFO L82 PathProgramCache]: Analyzing trace with hash 104828256, now seen corresponding path program 1 times [2020-07-17 17:19:02,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:02,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1151335881] [2020-07-17 17:19:02,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-17 17:19:02,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1151335881] [2020-07-17 17:19:02,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:02,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:19:02,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319821987] [2020-07-17 17:19:02,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:19:02,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:02,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:19:02,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:19:02,404 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 8 states. [2020-07-17 17:19:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:02,524 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2020-07-17 17:19:02,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 17:19:02,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-17 17:19:02,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:02,527 INFO L225 Difference]: With dead ends: 142 [2020-07-17 17:19:02,528 INFO L226 Difference]: Without dead ends: 78 [2020-07-17 17:19:02,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:19:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-17 17:19:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2020-07-17 17:19:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-07-17 17:19:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2020-07-17 17:19:02,546 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2020-07-17 17:19:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:02,547 INFO L479 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2020-07-17 17:19:02,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:19:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2020-07-17 17:19:02,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-17 17:19:02,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:02,550 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:02,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 17:19:02,551 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:02,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:02,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1703786405, now seen corresponding path program 1 times [2020-07-17 17:19:02,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:02,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [302790414] [2020-07-17 17:19:02,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,667 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-17 17:19:02,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [302790414] [2020-07-17 17:19:02,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:02,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:19:02,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81835666] [2020-07-17 17:19:02,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:19:02,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:02,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:19:02,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:19:02,670 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 8 states. [2020-07-17 17:19:02,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:02,860 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2020-07-17 17:19:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 17:19:02,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-07-17 17:19:02,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:02,863 INFO L225 Difference]: With dead ends: 118 [2020-07-17 17:19:02,864 INFO L226 Difference]: Without dead ends: 112 [2020-07-17 17:19:02,865 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:19:02,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-17 17:19:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2020-07-17 17:19:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-17 17:19:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2020-07-17 17:19:02,887 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 52 [2020-07-17 17:19:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:02,887 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2020-07-17 17:19:02,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:19:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2020-07-17 17:19:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-07-17 17:19:02,893 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:02,893 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:02,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 17:19:02,896 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:02,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:02,896 INFO L82 PathProgramCache]: Analyzing trace with hash -521446491, now seen corresponding path program 1 times [2020-07-17 17:19:02,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:02,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [404578337] [2020-07-17 17:19:02,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-17 17:19:03,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [404578337] [2020-07-17 17:19:03,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:03,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:19:03,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148457296] [2020-07-17 17:19:03,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:19:03,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:03,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:19:03,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:19:03,106 INFO L87 Difference]: Start difference. First operand 106 states and 145 transitions. Second operand 8 states. [2020-07-17 17:19:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:03,252 INFO L93 Difference]: Finished difference Result 227 states and 348 transitions. [2020-07-17 17:19:03,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 17:19:03,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2020-07-17 17:19:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:03,258 INFO L225 Difference]: With dead ends: 227 [2020-07-17 17:19:03,258 INFO L226 Difference]: Without dead ends: 127 [2020-07-17 17:19:03,261 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:19:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-17 17:19:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2020-07-17 17:19:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-07-17 17:19:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2020-07-17 17:19:03,306 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 69 [2020-07-17 17:19:03,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:03,308 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2020-07-17 17:19:03,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:19:03,309 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2020-07-17 17:19:03,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-07-17 17:19:03,314 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:03,314 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:03,314 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 17:19:03,314 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:03,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:03,315 INFO L82 PathProgramCache]: Analyzing trace with hash -439633211, now seen corresponding path program 1 times [2020-07-17 17:19:03,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:03,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [364858119] [2020-07-17 17:19:03,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-17 17:19:03,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [364858119] [2020-07-17 17:19:03,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:03,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:19:03,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498447272] [2020-07-17 17:19:03,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:19:03,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:03,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:19:03,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:19:03,481 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand 10 states. [2020-07-17 17:19:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:03,698 INFO L93 Difference]: Finished difference Result 257 states and 400 transitions. [2020-07-17 17:19:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 17:19:03,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2020-07-17 17:19:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:03,701 INFO L225 Difference]: With dead ends: 257 [2020-07-17 17:19:03,701 INFO L226 Difference]: Without dead ends: 151 [2020-07-17 17:19:03,702 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:19:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-07-17 17:19:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2020-07-17 17:19:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-07-17 17:19:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2020-07-17 17:19:03,724 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 70 [2020-07-17 17:19:03,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:03,724 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2020-07-17 17:19:03,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:19:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2020-07-17 17:19:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-07-17 17:19:03,727 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:03,727 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:03,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 17:19:03,728 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:03,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:03,728 INFO L82 PathProgramCache]: Analyzing trace with hash 307755032, now seen corresponding path program 2 times [2020-07-17 17:19:03,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:03,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1660057953] [2020-07-17 17:19:03,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-07-17 17:19:04,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1660057953] [2020-07-17 17:19:04,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:04,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-17 17:19:04,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390491519] [2020-07-17 17:19:04,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 17:19:04,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:04,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 17:19:04,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:19:04,062 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand 12 states. [2020-07-17 17:19:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:04,498 INFO L93 Difference]: Finished difference Result 265 states and 420 transitions. [2020-07-17 17:19:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 17:19:04,501 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2020-07-17 17:19:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:04,507 INFO L225 Difference]: With dead ends: 265 [2020-07-17 17:19:04,507 INFO L226 Difference]: Without dead ends: 116 [2020-07-17 17:19:04,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-17 17:19:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-17 17:19:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 95. [2020-07-17 17:19:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-17 17:19:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2020-07-17 17:19:04,533 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 105 [2020-07-17 17:19:04,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:04,534 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2020-07-17 17:19:04,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 17:19:04,534 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2020-07-17 17:19:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-17 17:19:04,542 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:04,542 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:04,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 17:19:04,542 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:04,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:04,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1534580400, now seen corresponding path program 1 times [2020-07-17 17:19:04,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:04,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [403753063] [2020-07-17 17:19:04,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 50 proven. 67 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2020-07-17 17:19:04,810 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [403753063] [2020-07-17 17:19:04,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:04,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:19:04,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670477359] [2020-07-17 17:19:04,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:19:04,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:04,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:19:04,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:19:04,813 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 10 states. [2020-07-17 17:19:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:05,005 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2020-07-17 17:19:05,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 17:19:05,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-07-17 17:19:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:05,009 INFO L225 Difference]: With dead ends: 193 [2020-07-17 17:19:05,009 INFO L226 Difference]: Without dead ends: 105 [2020-07-17 17:19:05,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:19:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-17 17:19:05,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-07-17 17:19:05,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-17 17:19:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2020-07-17 17:19:05,023 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 123 [2020-07-17 17:19:05,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:05,025 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2020-07-17 17:19:05,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:19:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2020-07-17 17:19:05,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-07-17 17:19:05,027 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:05,028 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:05,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 17:19:05,028 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:05,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:05,029 INFO L82 PathProgramCache]: Analyzing trace with hash 822116120, now seen corresponding path program 2 times [2020-07-17 17:19:05,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:05,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1972844525] [2020-07-17 17:19:05,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 72 proven. 111 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2020-07-17 17:19:05,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1972844525] [2020-07-17 17:19:05,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:05,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-17 17:19:05,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982203014] [2020-07-17 17:19:05,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 17:19:05,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:05,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 17:19:05,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:19:05,387 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand 12 states. [2020-07-17 17:19:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:05,810 INFO L93 Difference]: Finished difference Result 241 states and 326 transitions. [2020-07-17 17:19:05,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 17:19:05,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2020-07-17 17:19:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:05,813 INFO L225 Difference]: With dead ends: 241 [2020-07-17 17:19:05,813 INFO L226 Difference]: Without dead ends: 141 [2020-07-17 17:19:05,816 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-17 17:19:05,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-07-17 17:19:05,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 123. [2020-07-17 17:19:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-17 17:19:05,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2020-07-17 17:19:05,845 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 140 [2020-07-17 17:19:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:05,845 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2020-07-17 17:19:05,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 17:19:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2020-07-17 17:19:05,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-07-17 17:19:05,848 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:05,849 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:05,849 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 17:19:05,849 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:05,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1260071360, now seen corresponding path program 2 times [2020-07-17 17:19:05,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:05,850 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [74718003] [2020-07-17 17:19:05,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-07-17 17:19:06,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [74718003] [2020-07-17 17:19:06,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:06,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-07-17 17:19:06,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54281629] [2020-07-17 17:19:06,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-17 17:19:06,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:06,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-17 17:19:06,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2020-07-17 17:19:06,546 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand 22 states. [2020-07-17 17:19:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:07,370 INFO L93 Difference]: Finished difference Result 147 states and 181 transitions. [2020-07-17 17:19:07,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-07-17 17:19:07,371 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 140 [2020-07-17 17:19:07,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:07,375 INFO L225 Difference]: With dead ends: 147 [2020-07-17 17:19:07,376 INFO L226 Difference]: Without dead ends: 141 [2020-07-17 17:19:07,378 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=1505, Unknown=0, NotChecked=0, Total=1640 [2020-07-17 17:19:07,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-07-17 17:19:07,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2020-07-17 17:19:07,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-07-17 17:19:07,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 164 transitions. [2020-07-17 17:19:07,405 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 164 transitions. Word has length 140 [2020-07-17 17:19:07,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:07,406 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 164 transitions. [2020-07-17 17:19:07,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-17 17:19:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 164 transitions. [2020-07-17 17:19:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-07-17 17:19:07,408 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:07,408 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:07,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 17:19:07,409 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:07,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:07,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1930099232, now seen corresponding path program 3 times [2020-07-17 17:19:07,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:07,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1781879693] [2020-07-17 17:19:07,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 93 proven. 27 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-07-17 17:19:07,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1781879693] [2020-07-17 17:19:07,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:07,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-17 17:19:07,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627963536] [2020-07-17 17:19:07,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 17:19:07,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:07,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 17:19:07,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:19:07,670 INFO L87 Difference]: Start difference. First operand 131 states and 164 transitions. Second operand 11 states. [2020-07-17 17:19:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:07,949 INFO L93 Difference]: Finished difference Result 257 states and 342 transitions. [2020-07-17 17:19:07,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 17:19:07,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 122 [2020-07-17 17:19:07,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:07,952 INFO L225 Difference]: With dead ends: 257 [2020-07-17 17:19:07,952 INFO L226 Difference]: Without dead ends: 138 [2020-07-17 17:19:07,955 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-07-17 17:19:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-17 17:19:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-07-17 17:19:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-07-17 17:19:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions. [2020-07-17 17:19:07,978 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 122 [2020-07-17 17:19:07,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:07,979 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 174 transitions. [2020-07-17 17:19:07,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 17:19:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions. [2020-07-17 17:19:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-17 17:19:07,982 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:07,983 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:07,983 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 17:19:07,983 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:07,984 INFO L82 PathProgramCache]: Analyzing trace with hash 235403762, now seen corresponding path program 4 times [2020-07-17 17:19:07,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:07,984 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1840120491] [2020-07-17 17:19:07,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 107 proven. 178 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2020-07-17 17:19:08,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1840120491] [2020-07-17 17:19:08,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:08,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:19:08,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86917129] [2020-07-17 17:19:08,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:19:08,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:08,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:19:08,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:19:08,377 INFO L87 Difference]: Start difference. First operand 138 states and 174 transitions. Second operand 14 states. [2020-07-17 17:19:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:08,950 INFO L93 Difference]: Finished difference Result 279 states and 385 transitions. [2020-07-17 17:19:08,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-17 17:19:08,952 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 175 [2020-07-17 17:19:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:08,955 INFO L225 Difference]: With dead ends: 279 [2020-07-17 17:19:08,955 INFO L226 Difference]: Without dead ends: 149 [2020-07-17 17:19:08,960 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2020-07-17 17:19:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-07-17 17:19:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 142. [2020-07-17 17:19:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-17 17:19:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2020-07-17 17:19:08,994 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 175 [2020-07-17 17:19:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:08,995 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2020-07-17 17:19:08,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:19:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2020-07-17 17:19:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-07-17 17:19:08,997 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:08,998 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:08,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 17:19:08,998 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:08,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:08,999 INFO L82 PathProgramCache]: Analyzing trace with hash -866656818, now seen corresponding path program 5 times [2020-07-17 17:19:08,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:08,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1608367094] [2020-07-17 17:19:08,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 137 proven. 104 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2020-07-17 17:19:09,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1608367094] [2020-07-17 17:19:09,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:09,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-17 17:19:09,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102296391] [2020-07-17 17:19:09,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 17:19:09,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:09,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 17:19:09,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:19:09,327 INFO L87 Difference]: Start difference. First operand 142 states and 178 transitions. Second operand 11 states. [2020-07-17 17:19:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:09,663 INFO L93 Difference]: Finished difference Result 271 states and 352 transitions. [2020-07-17 17:19:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 17:19:09,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 176 [2020-07-17 17:19:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:09,669 INFO L225 Difference]: With dead ends: 271 [2020-07-17 17:19:09,669 INFO L226 Difference]: Without dead ends: 141 [2020-07-17 17:19:09,671 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2020-07-17 17:19:09,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-07-17 17:19:09,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2020-07-17 17:19:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-07-17 17:19:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2020-07-17 17:19:09,698 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 176 [2020-07-17 17:19:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:09,699 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2020-07-17 17:19:09,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 17:19:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2020-07-17 17:19:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2020-07-17 17:19:09,705 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:09,705 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 12, 11, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:09,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-17 17:19:09,706 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:09,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1198333484, now seen corresponding path program 6 times [2020-07-17 17:19:09,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:09,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1474185986] [2020-07-17 17:19:09,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 179 proven. 407 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2020-07-17 17:19:10,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1474185986] [2020-07-17 17:19:10,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:10,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:19:10,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20624746] [2020-07-17 17:19:10,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:19:10,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:10,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:19:10,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:19:10,388 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand 14 states. [2020-07-17 17:19:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:10,969 INFO L93 Difference]: Finished difference Result 295 states and 399 transitions. [2020-07-17 17:19:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-17 17:19:10,970 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 263 [2020-07-17 17:19:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:10,973 INFO L225 Difference]: With dead ends: 295 [2020-07-17 17:19:10,973 INFO L226 Difference]: Without dead ends: 162 [2020-07-17 17:19:10,975 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2020-07-17 17:19:10,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-07-17 17:19:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 142. [2020-07-17 17:19:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-07-17 17:19:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2020-07-17 17:19:10,992 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 263 [2020-07-17 17:19:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:10,993 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2020-07-17 17:19:10,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:19:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2020-07-17 17:19:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-07-17 17:19:10,997 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:10,997 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:10,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-17 17:19:10,998 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:10,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:10,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2113087688, now seen corresponding path program 7 times [2020-07-17 17:19:10,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:10,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1985641139] [2020-07-17 17:19:10,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1423 backedges. 261 proven. 446 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2020-07-17 17:19:11,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1985641139] [2020-07-17 17:19:11,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:11,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-17 17:19:11,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917710775] [2020-07-17 17:19:11,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 17:19:11,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:11,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 17:19:11,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:19:11,651 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand 16 states. [2020-07-17 17:19:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:12,356 INFO L93 Difference]: Finished difference Result 308 states and 420 transitions. [2020-07-17 17:19:12,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-07-17 17:19:12,357 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 281 [2020-07-17 17:19:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:12,360 INFO L225 Difference]: With dead ends: 308 [2020-07-17 17:19:12,361 INFO L226 Difference]: Without dead ends: 171 [2020-07-17 17:19:12,363 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2020-07-17 17:19:12,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-07-17 17:19:12,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2020-07-17 17:19:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-07-17 17:19:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 198 transitions. [2020-07-17 17:19:12,385 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 198 transitions. Word has length 281 [2020-07-17 17:19:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:12,386 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 198 transitions. [2020-07-17 17:19:12,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 17:19:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 198 transitions. [2020-07-17 17:19:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-07-17 17:19:12,389 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:19:12,389 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:19:12,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-17 17:19:12,389 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:19:12,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:19:12,390 INFO L82 PathProgramCache]: Analyzing trace with hash -88380307, now seen corresponding path program 8 times [2020-07-17 17:19:12,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:19:12,392 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [409084028] [2020-07-17 17:19:12,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:19:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:19:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 179 proven. 163 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2020-07-17 17:19:12,754 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [409084028] [2020-07-17 17:19:12,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:19:12,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:19:12,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231859864] [2020-07-17 17:19:12,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:19:12,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:19:12,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:19:12,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:19:12,758 INFO L87 Difference]: Start difference. First operand 158 states and 198 transitions. Second operand 14 states. [2020-07-17 17:19:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:19:13,269 INFO L93 Difference]: Finished difference Result 310 states and 404 transitions. [2020-07-17 17:19:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-17 17:19:13,270 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 193 [2020-07-17 17:19:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:19:13,272 INFO L225 Difference]: With dead ends: 310 [2020-07-17 17:19:13,272 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 17:19:13,278 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2020-07-17 17:19:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 17:19:13,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 17:19:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 17:19:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 17:19:13,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 193 [2020-07-17 17:19:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:19:13,279 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 17:19:13,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:19:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 17:19:13,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 17:19:13,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-17 17:19:13,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 17:19:19,291 WARN L193 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 35 [2020-07-17 17:19:19,592 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 23 [2020-07-17 17:19:19,968 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 23 [2020-07-17 17:19:20,931 WARN L193 SmtUtils]: Spent 895.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 47 [2020-07-17 17:19:21,337 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 32 [2020-07-17 17:19:21,913 WARN L193 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 35 [2020-07-17 17:19:22,300 WARN L193 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 37 [2020-07-17 17:19:22,806 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 37 [2020-07-17 17:19:23,297 WARN L193 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 44 [2020-07-17 17:19:23,851 WARN L193 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 38 [2020-07-17 17:19:24,365 WARN L193 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 38 [2020-07-17 17:19:24,789 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 24 [2020-07-17 17:19:25,630 WARN L193 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 47 [2020-07-17 17:19:25,923 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 24 [2020-07-17 17:19:26,697 WARN L193 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 44 [2020-07-17 17:19:27,282 WARN L193 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 38 [2020-07-17 17:19:27,334 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:19:27,334 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:19:27,334 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:19:27,334 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 17:19:27,334 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 17:19:27,334 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:19:27,334 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false [2020-07-17 17:19:27,335 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-07-17 17:19:27,335 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 35 42) the Hoare annotation is: (<= 5 main_~x~0) [2020-07-17 17:19:27,335 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 35 42) the Hoare annotation is: (<= 5 main_~x~0) [2020-07-17 17:19:27,335 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false [2020-07-17 17:19:27,336 INFO L264 CegarLoopResult]: At program point L38(lines 38 40) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (< 4 main_~result~0) (<= main_~result~0 5)) [2020-07-17 17:19:27,336 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0)) [2020-07-17 17:19:27,336 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= 5 |main_#t~ret4|) (<= |main_#t~ret4| 5)) [2020-07-17 17:19:27,337 INFO L264 CegarLoopResult]: At program point L38-2(lines 38 40) the Hoare annotation is: (<= 5 main_~x~0) [2020-07-17 17:19:27,337 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= 5 |main_#t~ret4|) (<= |main_#t~ret4| 5)) [2020-07-17 17:19:27,337 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= 5 |main_#t~ret4|) (<= |main_#t~ret4| 5) (< 4 main_~result~0) (<= main_~result~0 5)) [2020-07-17 17:19:27,337 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-07-17 17:19:27,337 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (< 1 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-17 17:19:27,337 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (or (not (<= 3 |fibo2_#in~n|)) (<= 5 fibo2_~n) (and (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2))) (= fibo2_~n |fibo2_#in~n|) (or (and (<= |fibo2_#t~ret2| 1) (<= 1 |fibo2_#t~ret2|) (< 1 fibo2_~n)) (not (<= |fibo2_#in~n| 3)))) [2020-07-17 17:19:27,338 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (< 0 fibo2_~n) (<= |fibo2_#in~n| 1) (= fibo2_~n |fibo2_#in~n|)) [2020-07-17 17:19:27,338 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (or (not (<= 3 |fibo2_#in~n|)) (<= 5 fibo2_~n) (and (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 2))) (= fibo2_~n |fibo2_#in~n|) (or (and (<= |fibo2_#t~ret2| 1) (<= 1 |fibo2_#t~ret2|) (< 1 fibo2_~n)) (not (<= |fibo2_#in~n| 3)))) [2020-07-17 17:19:27,338 INFO L264 CegarLoopResult]: At program point L20(lines 20 24) the Hoare annotation is: (and (< 0 fibo2_~n) (= fibo2_~n |fibo2_#in~n|)) [2020-07-17 17:19:27,338 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (let ((.cse1 (<= |fibo2_#t~ret2| 1)) (.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse2 (<= 1 |fibo2_#t~ret2|)) (.cse3 (= fibo2_~n |fibo2_#in~n|))) (and (or (not (<= |fibo2_#in~n| 2)) (and (<= 1 .cse0) .cse1 .cse2 (<= .cse0 1) .cse3)) (not (<= |fibo2_#in~n| 1)) (or (and (<= 2 |fibo2_#t~ret2|) (<= 3 .cse0) (<= |fibo2_#t~ret2| 2) (<= .cse0 3) .cse3 (<= 4 fibo2_~n)) (not (<= 3 |fibo2_#in~n|)) (and (<= 2 .cse0) .cse1 (<= .cse0 2) (<= |fibo2_#in~n| 3) .cse2 .cse3) (and (<= 5 fibo2_~n) .cse3)))) [2020-07-17 17:19:27,338 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= |fibo2_#in~n| 0) (= fibo2_~n |fibo2_#in~n|)) [2020-07-17 17:19:27,339 INFO L264 CegarLoopResult]: At program point L23-4(line 23) the Hoare annotation is: (let ((.cse1 (<= |fibo2_#t~ret2| 1)) (.cse0 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse2 (<= 1 |fibo2_#t~ret2|)) (.cse3 (= fibo2_~n |fibo2_#in~n|))) (and (or (not (<= |fibo2_#in~n| 2)) (and (<= 1 .cse0) .cse1 .cse2 (<= .cse0 1) .cse3)) (not (<= |fibo2_#in~n| 1)) (or (and (<= 2 |fibo2_#t~ret2|) (<= 3 .cse0) (<= |fibo2_#t~ret2| 2) (<= .cse0 3) .cse3 (<= 4 fibo2_~n)) (not (<= 3 |fibo2_#in~n|)) (and (<= 2 .cse0) .cse1 (<= .cse0 2) (<= |fibo2_#in~n| 3) .cse2 .cse3) (and (<= 5 fibo2_~n) .cse3)))) [2020-07-17 17:19:27,339 INFO L264 CegarLoopResult]: At program point L18(lines 18 24) the Hoare annotation is: (= fibo2_~n |fibo2_#in~n|) [2020-07-17 17:19:27,339 INFO L264 CegarLoopResult]: At program point L23-5(line 23) the Hoare annotation is: (let ((.cse0 (<= |fibo2_#in~n| 2)) (.cse3 (+ |fibo2_#t~ret3| |fibo2_#t~ret2|)) (.cse2 (<= 3 fibo2_~n))) (and (let ((.cse1 (= fibo2_~n |fibo2_#in~n|))) (or (and .cse0 (< 1 fibo2_~n) .cse1) (and (<= |fibo2_#in~n| 3) .cse1 .cse2) (and (<= 3 |fibo2_#res|) (<= 2 |fibo2_#t~ret2|) (<= 3 .cse3) (<= |fibo2_#res| 3) (<= |fibo2_#t~ret2| 2) (<= .cse3 3) .cse1) (and (<= 5 fibo2_~n) .cse1))) (let ((.cse4 (<= |fibo2_#t~ret2| 1)) (.cse5 (<= 1 |fibo2_#t~ret2|))) (or (and (<= 1 .cse3) .cse0 .cse4 (<= 1 |fibo2_#res|) .cse5 (<= .cse3 1) (<= |fibo2_#res| 1)) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= 2 .cse3) .cse4 (<= .cse3 2) .cse5 .cse2) (<= 4 fibo2_~n))))) [2020-07-17 17:19:27,339 INFO L264 CegarLoopResult]: At program point L23-6(line 23) the Hoare annotation is: (let ((.cse0 (<= |fibo2_#t~ret2| 1)) (.cse1 (<= 1 |fibo2_#t~ret2|)) (.cse2 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) .cse0 (<= |fibo2_#in~n| 3) .cse1 .cse2 (<= 3 fibo2_~n)) (and (<= |fibo2_#in~n| 2) .cse0 (<= 1 |fibo2_#res|) .cse1 (<= |fibo2_#res| 1) (< 1 fibo2_~n) .cse2) (and (<= 3 |fibo2_#res|) (<= 2 |fibo2_#t~ret2|) (<= |fibo2_#res| 3) (<= |fibo2_#t~ret2| 2) .cse2 (<= 4 fibo2_~n)) (and (<= 5 fibo2_~n) .cse2))) [2020-07-17 17:19:27,340 INFO L264 CegarLoopResult]: At program point fibo2FINAL(lines 17 25) the Hoare annotation is: (and (or (< 0 fibo2_~n) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))) (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#in~n| 2) (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse0) (and (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3) .cse0 (<= 4 fibo2_~n)) (and (<= |fibo2_#in~n| 0) .cse0) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= |fibo2_#in~n| 3) .cse0 (<= 3 fibo2_~n)) (and (<= 5 fibo2_~n) .cse0)))) [2020-07-17 17:19:27,340 INFO L264 CegarLoopResult]: At program point fibo2EXIT(lines 17 25) the Hoare annotation is: (and (or (< 0 fibo2_~n) (and (<= |fibo2_#res| 0) (<= 0 |fibo2_#res|))) (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#in~n| 2) (<= 1 |fibo2_#res|) (<= |fibo2_#res| 1) .cse0) (and (<= 3 |fibo2_#res|) (<= |fibo2_#res| 3) .cse0 (<= 4 fibo2_~n)) (and (<= |fibo2_#in~n| 0) .cse0) (and (<= |fibo2_#res| 2) (<= 2 |fibo2_#res|) (<= |fibo2_#in~n| 3) .cse0 (<= 3 fibo2_~n)) (and (<= 5 fibo2_~n) .cse0)))) [2020-07-17 17:19:27,340 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-07-17 17:19:27,340 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 1)) (= fibo1_~n |fibo1_#in~n|)) [2020-07-17 17:19:27,340 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (or (<= 4 |fibo1_#in~n|) (and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))) (not (<= |fibo1_#in~n| 1)) (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 6 fibo1_~n) .cse0) (and (<= 3 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 3) .cse0) (and (<= fibo1_~n 4) .cse0)))) [2020-07-17 17:19:27,340 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= |fibo1_#in~n| 1) (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-07-17 17:19:27,341 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (or (<= 4 |fibo1_#in~n|) (and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1))) (not (<= |fibo1_#in~n| 1)) (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 6 fibo1_~n) .cse0) (and (<= 3 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 3) .cse0) (and (<= fibo1_~n 4) .cse0)))) [2020-07-17 17:19:27,341 INFO L264 CegarLoopResult]: At program point fibo1FINAL(lines 7 15) the Hoare annotation is: (let ((.cse7 (<= |fibo1_#in~n| 1)) (.cse3 (<= 1 |fibo1_#res|)) (.cse5 (<= |fibo1_#res| 1))) (let ((.cse4 (<= 2 |fibo1_#in~n|)) (.cse2 (<= |fibo1_#in~n| 2)) (.cse6 (and .cse7 (< 0 fibo1_~n) .cse3 .cse5))) (and (let ((.cse0 (and (<= fibo1_~n 4) (<= 4 fibo1_~n))) (.cse1 (and .cse4 (<= |fibo1_#in~n| 3)))) (or (and (or (and (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5)) .cse0 .cse1) (<= 4 |fibo1_#in~n|)) (and .cse2 .cse3) (and (or .cse0 .cse1) (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2)) (not .cse4) (<= 6 fibo1_~n))) (or (and .cse4 .cse5) (not .cse2) .cse6 (<= |fibo1_#in~n| 0)) (or (and (<= |fibo1_#res| 0) (<= 0 |fibo1_#res|)) (not .cse7) .cse6) (= fibo1_~n |fibo1_#in~n|)))) [2020-07-17 17:19:27,341 INFO L264 CegarLoopResult]: At program point L10(lines 10 14) the Hoare annotation is: (and (< 0 fibo1_~n) (= fibo1_~n |fibo1_#in~n|)) [2020-07-17 17:19:27,341 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (let ((.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (let ((.cse0 (<= 1 |fibo1_#t~ret0|)) (.cse2 (<= |fibo1_#t~ret0| 1))) (or (not (<= |fibo1_#in~n| 3)) (and .cse0 (<= .cse1 2) (<= 3 |fibo1_#in~n|) .cse2 (<= 2 .cse1)) (and (<= |fibo1_#in~n| 2) .cse0 (< 1 fibo1_~n) .cse2 (<= 1 .cse1) (<= .cse1 1)))) (let ((.cse3 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 6 fibo1_~n) .cse3) (and (<= 3 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 3) (<= 5 .cse1) (<= .cse1 5) .cse3) (and (<= fibo1_~n 4) .cse3))))) [2020-07-17 17:19:27,341 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (= fibo1_~n |fibo1_#in~n|) (<= |fibo1_#in~n| 0)) [2020-07-17 17:19:27,342 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse1 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (let ((.cse0 (<= 1 |fibo1_#t~ret0|)) (.cse2 (<= |fibo1_#t~ret0| 1))) (or (not (<= |fibo1_#in~n| 3)) (and .cse0 (<= .cse1 2) (<= 3 |fibo1_#in~n|) .cse2 (<= 2 .cse1)) (and (<= |fibo1_#in~n| 2) .cse0 (< 1 fibo1_~n) .cse2 (<= 1 .cse1) (<= .cse1 1)))) (let ((.cse3 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 6 fibo1_~n) .cse3) (and (<= 3 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 3) (<= 5 .cse1) (<= .cse1 5) .cse3) (and (<= fibo1_~n 4) .cse3))))) [2020-07-17 17:19:27,342 INFO L264 CegarLoopResult]: At program point L8(lines 8 14) the Hoare annotation is: (= fibo1_~n |fibo1_#in~n|) [2020-07-17 17:19:27,342 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse2 (+ |fibo1_#t~ret1| |fibo1_#t~ret0|))) (and (let ((.cse0 (<= 1 |fibo1_#t~ret0|)) (.cse1 (<= |fibo1_#t~ret0| 1))) (or (and (<= |fibo1_#in~n| 2) .cse0 (< 1 fibo1_~n) .cse1 (<= 1 .cse2) (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1) (<= .cse2 1)) (and .cse0 (<= .cse2 2) (<= 3 |fibo1_#in~n|) (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2) .cse1 (<= 2 .cse2)) (<= 4 |fibo1_#in~n|))) (let ((.cse3 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 6 fibo1_~n) .cse3) (and (<= 3 |fibo1_#t~ret0|) (<= 5 |fibo1_#res|) (<= |fibo1_#t~ret0| 3) (<= 5 .cse2) (<= |fibo1_#res| 5) (<= .cse2 5) .cse3) (and (<= fibo1_~n 4) .cse3))))) [2020-07-17 17:19:27,342 INFO L264 CegarLoopResult]: At program point L13-6(line 13) the Hoare annotation is: (let ((.cse0 (<= |fibo1_#in~n| 2)) (.cse1 (<= 1 |fibo1_#t~ret0|)) (.cse2 (<= |fibo1_#t~ret0| 1)) (.cse3 (= fibo1_~n |fibo1_#in~n|))) (and (or (not .cse0) (and .cse1 (< 1 fibo1_~n) .cse2 .cse3 (<= 1 |fibo1_#res|) (<= |fibo1_#res| 1))) (or (and (<= 4 |fibo1_#in~n|) (or (and (<= 3 |fibo1_#t~ret0|) (<= 5 |fibo1_#res|) (<= |fibo1_#t~ret0| 3) (<= |fibo1_#res| 5) .cse3) (and (<= fibo1_~n 4) .cse3))) (and (<= 6 fibo1_~n) .cse3) .cse0 (and .cse1 (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2) .cse2 .cse3 (<= |fibo1_#in~n| 3))))) [2020-07-17 17:19:27,342 INFO L264 CegarLoopResult]: At program point fibo1EXIT(lines 7 15) the Hoare annotation is: (let ((.cse7 (<= |fibo1_#in~n| 1)) (.cse3 (<= 1 |fibo1_#res|)) (.cse5 (<= |fibo1_#res| 1))) (let ((.cse4 (<= 2 |fibo1_#in~n|)) (.cse2 (<= |fibo1_#in~n| 2)) (.cse6 (and .cse7 (< 0 fibo1_~n) .cse3 .cse5))) (and (let ((.cse0 (and (<= fibo1_~n 4) (<= 4 fibo1_~n))) (.cse1 (and .cse4 (<= |fibo1_#in~n| 3)))) (or (and (or (and (<= 5 |fibo1_#res|) (<= |fibo1_#res| 5)) .cse0 .cse1) (<= 4 |fibo1_#in~n|)) (and .cse2 .cse3) (and (or .cse0 .cse1) (<= 2 |fibo1_#res|) (<= |fibo1_#res| 2)) (not .cse4) (<= 6 fibo1_~n))) (or (and .cse4 .cse5) (not .cse2) .cse6 (<= |fibo1_#in~n| 0)) (or (and (<= |fibo1_#res| 0) (<= 0 |fibo1_#res|)) (not .cse7) .cse6) (= fibo1_~n |fibo1_#in~n|)))) [2020-07-17 17:19:27,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 05:19:27 BoogieIcfgContainer [2020-07-17 17:19:27,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 17:19:27,376 INFO L168 Benchmark]: Toolchain (without parser) took 27674.66 ms. Allocated memory was 139.5 MB in the beginning and 601.9 MB in the end (delta: 462.4 MB). Free memory was 104.3 MB in the beginning and 417.9 MB in the end (delta: -313.6 MB). Peak memory consumption was 478.9 MB. Max. memory is 7.1 GB. [2020-07-17 17:19:27,377 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 139.5 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 17:19:27,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.00 ms. Allocated memory is still 139.5 MB. Free memory was 103.8 MB in the beginning and 94.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-17 17:19:27,378 INFO L168 Benchmark]: Boogie Preprocessor took 29.00 ms. Allocated memory is still 139.5 MB. Free memory was 94.3 MB in the beginning and 92.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 17:19:27,379 INFO L168 Benchmark]: RCFGBuilder took 408.94 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 92.9 MB in the beginning and 169.1 MB in the end (delta: -76.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-17 17:19:27,381 INFO L168 Benchmark]: TraceAbstraction took 26937.88 ms. Allocated memory was 203.9 MB in the beginning and 601.9 MB in the end (delta: 397.9 MB). Free memory was 168.5 MB in the beginning and 417.9 MB in the end (delta: -249.4 MB). Peak memory consumption was 478.6 MB. Max. memory is 7.1 GB. [2020-07-17 17:19:27,386 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.27 ms. Allocated memory is still 139.5 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 288.00 ms. Allocated memory is still 139.5 MB. Free memory was 103.8 MB in the beginning and 94.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.00 ms. Allocated memory is still 139.5 MB. Free memory was 94.3 MB in the beginning and 92.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 408.94 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 92.9 MB in the beginning and 169.1 MB in the end (delta: -76.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26937.88 ms. Allocated memory was 203.9 MB in the beginning and 601.9 MB in the end (delta: 397.9 MB). Free memory was 168.5 MB in the beginning and 417.9 MB in the end (delta: -249.4 MB). Peak memory consumption was 478.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 35]: Procedure Contract for main Derived contract for procedure main: 5 <= x - ProcedureContractResult [Line: 17]: Procedure Contract for fibo2 Derived contract for procedure fibo2: (0 < n || (\result <= 0 && 0 <= \result)) && (((((((\old(n) <= 2 && 1 <= \result) && \result <= 1) && n == \old(n)) || (((3 <= \result && \result <= 3) && n == \old(n)) && 4 <= n)) || (\old(n) <= 0 && n == \old(n))) || ((((\result <= 2 && 2 <= \result) && \old(n) <= 3) && n == \old(n)) && 3 <= n)) || (5 <= n && n == \old(n))) - ProcedureContractResult [Line: 7]: Procedure Contract for fibo1 Derived contract for procedure fibo1: ((((((((((5 <= \result && \result <= 5) || (n <= 4 && 4 <= n)) || (2 <= \old(n) && \old(n) <= 3)) && 4 <= \old(n)) || (\old(n) <= 2 && 1 <= \result)) || ((((n <= 4 && 4 <= n) || (2 <= \old(n) && \old(n) <= 3)) && 2 <= \result) && \result <= 2)) || !(2 <= \old(n))) || 6 <= n) && ((((2 <= \old(n) && \result <= 1) || !(\old(n) <= 2)) || (((\old(n) <= 1 && 0 < n) && 1 <= \result) && \result <= 1)) || \old(n) <= 0)) && (((\result <= 0 && 0 <= \result) || !(\old(n) <= 1)) || (((\old(n) <= 1 && 0 < n) && 1 <= \result) && \result <= 1))) && n == \old(n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.7s, OverallIterations: 19, TraceHistogramMax: 17, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 919 SDtfs, 1074 SDslu, 5727 SDs, 0 SdLazy, 4171 SolverSat, 435 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 836 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=18, 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, 19 MinimizatonAttempts, 140 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3167 PreInvPairs, 7441 NumberOfFragments, 1392 HoareAnnotationTreeSize, 3167 FomulaSimplifications, 250599 FormulaSimplificationTreeSizeReduction, 5.2s HoareSimplificationTime, 45 FomulaSimplificationsInter, 52747 FormulaSimplificationTreeSizeReductionInter, 8.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2110 NumberOfCodeBlocks, 2110 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2091 ConstructedInterpolants, 0 QuantifiedInterpolants, 638777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 2 PerfectInterpolantSequences, 3867/5583 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 correct! Received shutdown request...