/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id2_b3_o5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:28:38,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:28:38,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:28:38,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:28:38,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:28:38,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:28:38,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:28:38,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:28:38,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:28:38,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:28:38,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:28:38,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:28:38,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:28:38,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:28:38,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:28:38,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:28:38,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:28:38,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:28:38,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:28:38,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:28:38,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:28:38,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:28:38,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:28:38,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:28:38,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:28:38,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:28:38,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:28:38,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:28:38,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:28:38,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:28:38,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:28:38,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:28:38,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:28:38,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:28:38,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:28:38,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:28:38,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:28:38,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:28:38,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:28:38,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:28:38,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:28:38,578 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:28:38,590 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:28:38,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:28:38,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:28:38,592 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:28:38,592 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:28:38,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:28:38,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:28:38,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:28:38,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:28:38,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:28:38,594 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:28:38,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:28:38,594 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:28:38,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:28:38,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:28:38,595 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:28:38,595 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:28:38,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:28:38,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:28:38,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:28:38,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:28:38,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:28:38,596 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:28:39,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:28:39,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:28:39,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:28:39,058 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:28:39,059 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:28:39,060 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_b3_o5.c [2020-09-04 16:28:39,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/549eb7b2d/c9fa18a3ed084da190528277cb666253/FLAGd847c8364 [2020-09-04 16:28:39,643 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:28:39,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id2_b3_o5.c [2020-09-04 16:28:39,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/549eb7b2d/c9fa18a3ed084da190528277cb666253/FLAGd847c8364 [2020-09-04 16:28:39,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/549eb7b2d/c9fa18a3ed084da190528277cb666253 [2020-09-04 16:28:39,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:28:39,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:28:40,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:28:40,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:28:40,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:28:40,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:28:39" (1/1) ... [2020-09-04 16:28:40,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c28f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:40, skipping insertion in model container [2020-09-04 16:28:40,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:28:39" (1/1) ... [2020-09-04 16:28:40,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:28:40,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:28:40,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:28:40,284 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:28:40,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:28:40,327 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:28:40,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:40 WrapperNode [2020-09-04 16:28:40,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:28:40,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:28:40,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:28:40,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:28:40,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:40" (1/1) ... [2020-09-04 16:28:40,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:40" (1/1) ... [2020-09-04 16:28:40,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:40" (1/1) ... [2020-09-04 16:28:40,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:40" (1/1) ... [2020-09-04 16:28:40,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:40" (1/1) ... [2020-09-04 16:28:40,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:40" (1/1) ... [2020-09-04 16:28:40,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:40" (1/1) ... [2020-09-04 16:28:40,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:28:40,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:28:40,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:28:40,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:28:40,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:40" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 16:28:40,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:28:40,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:28:40,557 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 16:28:40,557 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-09-04 16:28:40,557 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:28:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-09-04 16:28:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:28:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 16:28:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-09-04 16:28:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:28:40,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:28:40,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:28:40,791 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:28:40,792 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:28:40,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:28:40 BoogieIcfgContainer [2020-09-04 16:28:40,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:28:40,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:28:40,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:28:40,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:28:40,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:28:39" (1/3) ... [2020-09-04 16:28:40,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374e991f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:28:40, skipping insertion in model container [2020-09-04 16:28:40,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:40" (2/3) ... [2020-09-04 16:28:40,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374e991f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:28:40, skipping insertion in model container [2020-09-04 16:28:40,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:28:40" (3/3) ... [2020-09-04 16:28:40,810 INFO L109 eAbstractionObserver]: Analyzing ICFG id2_b3_o5.c [2020-09-04 16:28:40,824 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:28:40,836 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:28:40,863 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:28:40,900 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:28:40,900 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:28:40,901 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:28:40,901 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:28:40,901 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:28:40,902 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:28:40,902 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:28:40,902 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:28:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-09-04 16:28:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:28:40,938 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:40,940 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:40,940 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:40,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:40,951 INFO L82 PathProgramCache]: Analyzing trace with hash 875745540, now seen corresponding path program 1 times [2020-09-04 16:28:40,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:40,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [290871326] [2020-09-04 16:28:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:41,054 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:41,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:41,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:28:41,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [290871326] [2020-09-04 16:28:41,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:41,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:28:41,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687279423] [2020-09-04 16:28:41,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:28:41,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:41,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:28:41,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:28:41,369 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2020-09-04 16:28:41,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:41,482 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2020-09-04 16:28:41,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:28:41,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:28:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:41,499 INFO L225 Difference]: With dead ends: 51 [2020-09-04 16:28:41,499 INFO L226 Difference]: Without dead ends: 36 [2020-09-04 16:28:41,505 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:28:41,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-09-04 16:28:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-09-04 16:28:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-09-04 16:28:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2020-09-04 16:28:41,560 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2020-09-04 16:28:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:41,560 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2020-09-04 16:28:41,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:28:41,561 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-09-04 16:28:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 16:28:41,563 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:41,563 INFO L422 BasicCegarLoop]: trace histogram [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-09-04 16:28:41,564 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:28:41,564 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash 71846672, now seen corresponding path program 1 times [2020-09-04 16:28:41,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:41,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [543059631] [2020-09-04 16:28:41,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:41,568 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:41,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:41,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:41,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:28:41,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [543059631] [2020-09-04 16:28:41,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:41,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:28:41,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960641005] [2020-09-04 16:28:41,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:28:41,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:41,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:28:41,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:28:41,802 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 8 states. [2020-09-04 16:28:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:41,917 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2020-09-04 16:28:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:28:41,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-09-04 16:28:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:41,920 INFO L225 Difference]: With dead ends: 66 [2020-09-04 16:28:41,920 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 16:28:41,923 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:28:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 16:28:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-09-04 16:28:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 16:28:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2020-09-04 16:28:41,936 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 25 [2020-09-04 16:28:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:41,937 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2020-09-04 16:28:41,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:28:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-09-04 16:28:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 16:28:41,939 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:41,940 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-09-04 16:28:41,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:28:41,940 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:41,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:41,941 INFO L82 PathProgramCache]: Analyzing trace with hash -511991682, now seen corresponding path program 1 times [2020-09-04 16:28:41,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:41,942 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [922548633] [2020-09-04 16:28:41,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:41,966 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:28:42,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [922548633] [2020-09-04 16:28:42,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:42,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:28:42,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772201324] [2020-09-04 16:28:42,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:28:42,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:42,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:28:42,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:28:42,229 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2020-09-04 16:28:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:42,303 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2020-09-04 16:28:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:28:42,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-09-04 16:28:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:42,305 INFO L225 Difference]: With dead ends: 69 [2020-09-04 16:28:42,305 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 16:28:42,306 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-09-04 16:28:42,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 16:28:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2020-09-04 16:28:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 16:28:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-09-04 16:28:42,320 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2020-09-04 16:28:42,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:42,320 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-09-04 16:28:42,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:28:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-09-04 16:28:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 16:28:42,322 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:42,322 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-09-04 16:28:42,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:28:42,323 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:42,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:42,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1477652418, now seen corresponding path program 1 times [2020-09-04 16:28:42,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:42,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [71183248] [2020-09-04 16:28:42,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:42,335 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:28:42,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [71183248] [2020-09-04 16:28:42,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:42,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:28:42,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392703506] [2020-09-04 16:28:42,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:28:42,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:42,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:28:42,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:28:42,452 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2020-09-04 16:28:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:42,488 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-09-04 16:28:42,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:28:42,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-09-04 16:28:42,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:42,490 INFO L225 Difference]: With dead ends: 54 [2020-09-04 16:28:42,491 INFO L226 Difference]: Without dead ends: 49 [2020-09-04 16:28:42,492 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-09-04 16:28:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-09-04 16:28:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2020-09-04 16:28:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 16:28:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-09-04 16:28:42,503 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 34 [2020-09-04 16:28:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:42,504 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-09-04 16:28:42,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:28:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-09-04 16:28:42,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 16:28:42,505 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:42,506 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-09-04 16:28:42,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:28:42,506 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:42,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2109914946, now seen corresponding path program 1 times [2020-09-04 16:28:42,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:42,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1087843478] [2020-09-04 16:28:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:42,515 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 16:28:42,744 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1087843478] [2020-09-04 16:28:42,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:42,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:28:42,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182077009] [2020-09-04 16:28:42,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:28:42,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:42,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:28:42,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:28:42,746 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2020-09-04 16:28:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:42,934 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2020-09-04 16:28:42,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:28:42,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2020-09-04 16:28:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:42,937 INFO L225 Difference]: With dead ends: 90 [2020-09-04 16:28:42,937 INFO L226 Difference]: Without dead ends: 61 [2020-09-04 16:28:42,938 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:28:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-09-04 16:28:42,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2020-09-04 16:28:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-09-04 16:28:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2020-09-04 16:28:42,950 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 34 [2020-09-04 16:28:42,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:42,950 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2020-09-04 16:28:42,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:28:42,951 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2020-09-04 16:28:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-04 16:28:42,952 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:42,952 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-04 16:28:42,953 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:28:42,953 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:42,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:42,953 INFO L82 PathProgramCache]: Analyzing trace with hash 830258234, now seen corresponding path program 1 times [2020-09-04 16:28:42,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:42,954 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1609424205] [2020-09-04 16:28:42,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:42,960 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:43,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:43,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:43,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:43,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:43,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 16:28:43,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1609424205] [2020-09-04 16:28:43,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:43,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:28:43,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373923967] [2020-09-04 16:28:43,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:28:43,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:43,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:28:43,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:28:43,340 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 14 states. [2020-09-04 16:28:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:43,658 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2020-09-04 16:28:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:28:43,659 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2020-09-04 16:28:43,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:43,660 INFO L225 Difference]: With dead ends: 104 [2020-09-04 16:28:43,660 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 16:28:43,662 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:28:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 16:28:43,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2020-09-04 16:28:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-09-04 16:28:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-09-04 16:28:43,674 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 43 [2020-09-04 16:28:43,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:43,675 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-09-04 16:28:43,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:28:43,675 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-09-04 16:28:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 16:28:43,677 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:43,677 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1] [2020-09-04 16:28:43,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:28:43,678 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:43,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:43,678 INFO L82 PathProgramCache]: Analyzing trace with hash 444280, now seen corresponding path program 2 times [2020-09-04 16:28:43,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:43,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1612117250] [2020-09-04 16:28:43,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:43,686 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:43,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:43,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:43,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:43,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:43,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:43,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-04 16:28:44,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1612117250] [2020-09-04 16:28:44,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:44,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:28:44,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558982160] [2020-09-04 16:28:44,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:28:44,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:44,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:28:44,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:28:44,013 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 14 states. [2020-09-04 16:28:44,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:44,263 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2020-09-04 16:28:44,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:28:44,263 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2020-09-04 16:28:44,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:44,265 INFO L225 Difference]: With dead ends: 111 [2020-09-04 16:28:44,265 INFO L226 Difference]: Without dead ends: 85 [2020-09-04 16:28:44,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:28:44,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-04 16:28:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2020-09-04 16:28:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-04 16:28:44,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2020-09-04 16:28:44,281 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 52 [2020-09-04 16:28:44,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:44,282 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2020-09-04 16:28:44,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:28:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2020-09-04 16:28:44,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-04 16:28:44,284 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:44,284 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:44,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:28:44,284 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:44,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1783783324, now seen corresponding path program 2 times [2020-09-04 16:28:44,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:44,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1069704436] [2020-09-04 16:28:44,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:44,290 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:44,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:44,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:28:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:44,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:44,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:44,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:44,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:44,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 16:28:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-09-04 16:28:44,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1069704436] [2020-09-04 16:28:44,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:44,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:28:44,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525753078] [2020-09-04 16:28:44,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:28:44,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:44,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:28:44,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:28:44,696 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 14 states. [2020-09-04 16:28:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:44,976 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2020-09-04 16:28:44,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:28:44,977 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2020-09-04 16:28:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:44,978 INFO L225 Difference]: With dead ends: 93 [2020-09-04 16:28:44,978 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:28:44,981 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:28:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:28:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:28:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:28:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:28:44,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2020-09-04 16:28:44,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:44,983 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:28:44,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:28:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:28:44,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:28:44,984 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:28:44,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:28:45,885 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:28:45,886 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:28:45,886 INFO L264 CegarLoopResult]: At program point id2FINAL(lines 14 19) the Hoare annotation is: (or (and (<= |id2_#res| 0) (<= 0 |id2_#res|)) (and (<= |id2_#res| 1) (<= 1 id2_~ret~1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= 2 |id2_#res|) (<= id2_~ret~1 2) (<= |id2_#res| 2) (<= 2 id2_~ret~1)) (and (<= |id2_#res| 3) (<= 3 |id2_#res|))) [2020-09-04 16:28:45,886 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-09-04 16:28:45,888 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 4 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-09-04 16:28:45,888 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 16:28:45,889 INFO L264 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (and (<= 4 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) [2020-09-04 16:28:45,889 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 16:28:45,889 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (or (and (<= 2 |id2_#t~ret1|) (<= |id2_#t~ret1| 2)) (and (<= |id2_#t~ret1| 1) (<= 1 |id2_#t~ret1|)) (and (<= 0 |id2_#t~ret1|) (<= |id2_#t~ret1| 0)) (and (<= 3 |id2_#t~ret1|) (<= |id2_#t~ret1| 3))) [2020-09-04 16:28:45,889 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-09-04 16:28:45,890 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (or (and (<= 4 id2_~ret~1) (<= 3 |id2_#t~ret1|) (<= (div id2_~ret~1 4294967296) 0) (<= |id2_#t~ret1| 3)) (and (<= 0 |id2_#t~ret1|) (<= |id2_#t~ret1| 0) (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= |id2_#t~ret1| 1) (<= 1 |id2_#t~ret1|) (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 2 |id2_#t~ret1|) (<= |id2_#t~ret1| 2) (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-09-04 16:28:45,890 INFO L264 CegarLoopResult]: At program point id2EXIT(lines 14 19) the Hoare annotation is: (or (and (<= |id2_#res| 0) (<= 0 |id2_#res|)) (and (<= |id2_#res| 1) (<= 1 id2_~ret~1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= 2 |id2_#res|) (<= id2_~ret~1 2) (<= |id2_#res| 2) (<= 2 id2_~ret~1)) (and (<= |id2_#res| 3) (<= 3 |id2_#res|))) [2020-09-04 16:28:45,890 INFO L271 CegarLoopResult]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2020-09-04 16:28:45,891 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:28:45,891 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:28:45,891 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:28:45,891 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:28:45,891 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) the Hoare annotation is: false [2020-09-04 16:28:45,892 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 21 27) the Hoare annotation is: true [2020-09-04 16:28:45,893 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: false [2020-09-04 16:28:45,893 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 21 27) the Hoare annotation is: true [2020-09-04 16:28:45,893 INFO L264 CegarLoopResult]: At program point L24(lines 24 26) the Hoare annotation is: (and (<= main_~result~0 3) (< 0 (+ (div main_~result~0 4294967296) 1))) [2020-09-04 16:28:45,894 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-09-04 16:28:45,894 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 16:28:45,894 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (or (and (<= |main_#t~ret3| 3) (<= 3 |main_#t~ret3|)) (and (<= |main_#t~ret3| 0) (<= 0 |main_#t~ret3|)) (and (<= 2 |main_#t~ret3|) (<= |main_#t~ret3| 2)) (and (<= |main_#t~ret3| 1) (<= 1 |main_#t~ret3|))) [2020-09-04 16:28:45,895 INFO L271 CegarLoopResult]: At program point L24-2(lines 21 27) the Hoare annotation is: true [2020-09-04 16:28:45,895 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div main_~result~0 4294967296) 1)))) (or (and (<= |main_#t~ret3| 0) (<= main_~result~0 0) (<= 0 |main_#t~ret3|) .cse0) (and (<= main_~result~0 3) .cse0 (<= |main_#t~ret3| 3) (<= 3 |main_#t~ret3|)) (and (<= 2 |main_#t~ret3|) (<= main_~result~0 2) (<= |main_#t~ret3| 2) .cse0) (and (<= |main_#t~ret3| 1) (<= main_~result~0 1) (<= 1 |main_#t~ret3|) .cse0))) [2020-09-04 16:28:45,895 INFO L264 CegarLoopResult]: At program point idFINAL(lines 7 12) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= id_~ret~0 2) (<= 2 |id_#res|) (<= |id_#res| 2) (<= 2 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= |id_#res| 3) (<= 3 |id_#res|))) [2020-09-04 16:28:45,895 INFO L264 CegarLoopResult]: At program point idEXIT(lines 7 12) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= id_~ret~0 2) (<= 2 |id_#res|) (<= |id_#res| 2) (<= 2 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= |id_#res| 3) (<= 3 |id_#res|))) [2020-09-04 16:28:45,896 INFO L271 CegarLoopResult]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2020-09-04 16:28:45,896 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (or (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= 3 id_~ret~0) (<= id_~ret~0 3)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-09-04 16:28:45,896 INFO L264 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (or (and (<= 4 id_~ret~0) (<= (div id_~ret~0 4294967296) 0)) (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= 3 id_~ret~0) (<= id_~ret~0 3)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-09-04 16:28:45,896 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-09-04 16:28:45,896 INFO L271 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: true [2020-09-04 16:28:45,896 INFO L271 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: true [2020-09-04 16:28:45,897 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (or (and (<= 1 |id_#t~ret0|) (<= |id_#t~ret0| 1)) (and (<= |id_#t~ret0| 2) (<= 2 |id_#t~ret0|)) (and (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3)) (and (<= 0 |id_#t~ret0|) (<= |id_#t~ret0| 0))) [2020-09-04 16:28:45,897 INFO L271 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: true [2020-09-04 16:28:45,897 INFO L264 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: (or (and (<= 4 id_~ret~0) (<= (div id_~ret~0 4294967296) 0) (<= 3 |id_#t~ret0|) (<= |id_#t~ret0| 3)) (and (<= |id_#t~ret0| 2) (<= 3 id_~ret~0) (<= id_~ret~0 3) (<= 2 |id_#t~ret0|)) (and (<= 0 |id_#t~ret0|) (<= |id_#t~ret0| 0) (<= id_~ret~0 1) (<= 1 id_~ret~0)) (and (<= id_~ret~0 2) (<= 1 |id_#t~ret0|) (<= |id_#t~ret0| 1) (<= 2 id_~ret~0))) [2020-09-04 16:28:45,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:28:45 BoogieIcfgContainer [2020-09-04 16:28:45,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:28:45,944 INFO L168 Benchmark]: Toolchain (without parser) took 5938.36 ms. Allocated memory was 138.9 MB in the beginning and 282.1 MB in the end (delta: 143.1 MB). Free memory was 103.3 MB in the beginning and 190.7 MB in the end (delta: -87.4 MB). Peak memory consumption was 116.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:45,945 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 16:28:45,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.68 ms. Allocated memory is still 138.9 MB. Free memory was 103.1 MB in the beginning and 93.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:45,948 INFO L168 Benchmark]: Boogie Preprocessor took 133.11 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 93.5 MB in the beginning and 181.6 MB in the end (delta: -88.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:45,949 INFO L168 Benchmark]: RCFGBuilder took 336.33 ms. Allocated memory is still 202.9 MB. Free memory was 181.6 MB in the beginning and 168.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:45,953 INFO L168 Benchmark]: TraceAbstraction took 5133.72 ms. Allocated memory was 202.9 MB in the beginning and 282.1 MB in the end (delta: 79.2 MB). Free memory was 167.7 MB in the beginning and 190.7 MB in the end (delta: -23.0 MB). Peak memory consumption was 116.9 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:45,965 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.30 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 325.68 ms. Allocated memory is still 138.9 MB. Free memory was 103.1 MB in the beginning and 93.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.11 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 93.5 MB in the beginning and 181.6 MB in the end (delta: -88.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 336.33 ms. Allocated memory is still 202.9 MB. Free memory was 181.6 MB in the beginning and 168.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5133.72 ms. Allocated memory was 202.9 MB in the beginning and 282.1 MB in the end (delta: 79.2 MB). Free memory was 167.7 MB in the beginning and 190.7 MB in the end (delta: -23.0 MB). Peak memory consumption was 116.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: 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: 14]: Procedure Contract for id2 Derived contract for procedure id2: (((\result <= 0 && 0 <= \result) || (((\result <= 1 && 1 <= ret) && ret <= 1) && 1 <= \result)) || (((2 <= \result && ret <= 2) && \result <= 2) && 2 <= ret)) || (\result <= 3 && 3 <= \result) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 7]: Procedure Contract for id Derived contract for procedure id: (((((\result <= 1 && ret <= 1) && 1 <= \result) && 1 <= ret) || (((ret <= 2 && 2 <= \result) && \result <= 2) && 2 <= ret)) || (0 <= \result && \result <= 0)) || (\result <= 3 && 3 <= \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.0s, OverallIterations: 8, TraceHistogramMax: 3, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 330 SDtfs, 55 SDslu, 2332 SDs, 0 SdLazy, 623 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 39 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 49 PreInvPairs, 194 NumberOfFragments, 578 HoareAnnotationTreeSize, 49 FomulaSimplifications, 4504 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 38 FomulaSimplificationsInter, 178 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...