/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/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:34:08,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:34:08,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:34:08,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:34:08,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:34:08,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:34:08,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:34:08,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:34:08,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:34:08,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:34:08,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:34:08,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:34:08,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:34:08,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:34:08,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:34:08,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:34:08,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:34:08,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:34:08,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:34:08,644 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:34:08,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:34:08,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:34:08,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:34:08,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:34:08,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:34:08,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:34:08,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:34:08,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:34:08,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:34:08,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:34:08,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:34:08,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:34:08,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:34:08,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:34:08,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:34:08,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:34:08,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:34:08,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:34:08,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:34:08,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:34:08,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:34:08,678 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:34:08,730 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:34:08,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:34:08,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:34:08,742 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:34:08,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:34:08,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:34:08,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:34:08,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:34:08,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:34:08,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:34:08,748 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:34:08,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:34:08,748 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:34:08,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:34:08,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:34:08,751 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:34:08,753 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:34:08,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:34:08,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:34:08,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:34:08,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:34:08,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:34:08,754 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:34:09,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:34:09,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:34:09,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:34:09,311 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:34:09,312 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:34:09,313 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2020-09-04 16:34:09,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/67f110ca4/0baac1c15a564c319b5a76da8397e34d/FLAG25b1e542c [2020-09-04 16:34:10,061 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:34:10,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/locks/test_locks_5.c [2020-09-04 16:34:10,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/67f110ca4/0baac1c15a564c319b5a76da8397e34d/FLAG25b1e542c [2020-09-04 16:34:10,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/67f110ca4/0baac1c15a564c319b5a76da8397e34d [2020-09-04 16:34:10,392 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:34:10,396 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:34:10,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:34:10,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:34:10,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:34:10,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:34:10" (1/1) ... [2020-09-04 16:34:10,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1391ef0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:10, skipping insertion in model container [2020-09-04 16:34:10,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:34:10" (1/1) ... [2020-09-04 16:34:10,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:34:10,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:34:10,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:34:10,786 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:34:10,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:34:10,844 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:34:10,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:10 WrapperNode [2020-09-04 16:34:10,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:34:10,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:34:10,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:34:10,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:34:10,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:10" (1/1) ... [2020-09-04 16:34:10,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:10" (1/1) ... [2020-09-04 16:34:10,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:10" (1/1) ... [2020-09-04 16:34:10,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:10" (1/1) ... [2020-09-04 16:34:10,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:10" (1/1) ... [2020-09-04 16:34:11,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:10" (1/1) ... [2020-09-04 16:34:11,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:10" (1/1) ... [2020-09-04 16:34:11,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:34:11,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:34:11,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:34:11,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:34:11,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:10" (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:34:11,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:34:11,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:34:11,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:34:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:34:11,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:34:11,117 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:34:11,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:34:11,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:34:11,517 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:34:11,518 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 16:34:11,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:34:11 BoogieIcfgContainer [2020-09-04 16:34:11,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:34:11,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:34:11,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:34:11,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:34:11,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:34:10" (1/3) ... [2020-09-04 16:34:11,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f688b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:34:11, skipping insertion in model container [2020-09-04 16:34:11,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:10" (2/3) ... [2020-09-04 16:34:11,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f688b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:34:11, skipping insertion in model container [2020-09-04 16:34:11,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:34:11" (3/3) ... [2020-09-04 16:34:11,542 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2020-09-04 16:34:11,578 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:34:11,605 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:34:11,650 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:34:11,680 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:34:11,680 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:34:11,680 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:34:11,681 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:34:11,681 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:34:11,681 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:34:11,681 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:34:11,681 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:34:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2020-09-04 16:34:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-04 16:34:11,716 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:11,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:34:11,719 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:11,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1222569836, now seen corresponding path program 1 times [2020-09-04 16:34:11,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:11,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [730066375] [2020-09-04 16:34:11,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:11,824 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:11,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:12,021 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:34:12,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [730066375] [2020-09-04 16:34:12,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:12,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:12,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125383100] [2020-09-04 16:34:12,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:12,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:12,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:12,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:12,067 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2020-09-04 16:34:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:12,170 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2020-09-04 16:34:12,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:12,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-09-04 16:34:12,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:12,211 INFO L225 Difference]: With dead ends: 147 [2020-09-04 16:34:12,211 INFO L226 Difference]: Without dead ends: 96 [2020-09-04 16:34:12,218 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-09-04 16:34:12,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2020-09-04 16:34:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-04 16:34:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2020-09-04 16:34:12,304 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 43 [2020-09-04 16:34:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:12,305 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2020-09-04 16:34:12,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2020-09-04 16:34:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 16:34:12,308 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:12,309 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:34:12,309 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:34:12,310 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:12,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:12,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1252462105, now seen corresponding path program 1 times [2020-09-04 16:34:12,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:12,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1742448740] [2020-09-04 16:34:12,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:12,316 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:12,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:12,408 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:34:12,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1742448740] [2020-09-04 16:34:12,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:12,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:12,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743159186] [2020-09-04 16:34:12,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:12,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:12,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:12,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:12,414 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand 3 states. [2020-09-04 16:34:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:12,472 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2020-09-04 16:34:12,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:12,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-09-04 16:34:12,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:12,477 INFO L225 Difference]: With dead ends: 116 [2020-09-04 16:34:12,477 INFO L226 Difference]: Without dead ends: 114 [2020-09-04 16:34:12,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:12,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-09-04 16:34:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2020-09-04 16:34:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-04 16:34:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2020-09-04 16:34:12,504 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 44 [2020-09-04 16:34:12,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:12,505 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2020-09-04 16:34:12,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:12,505 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2020-09-04 16:34:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 16:34:12,507 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:12,507 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:34:12,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:34:12,508 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:12,509 INFO L82 PathProgramCache]: Analyzing trace with hash 755286414, now seen corresponding path program 1 times [2020-09-04 16:34:12,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:12,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1481521173] [2020-09-04 16:34:12,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:12,513 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:12,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:12,582 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:34:12,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1481521173] [2020-09-04 16:34:12,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:12,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:12,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60653719] [2020-09-04 16:34:12,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:12,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:12,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:12,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:12,585 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 3 states. [2020-09-04 16:34:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:12,650 INFO L93 Difference]: Finished difference Result 226 states and 299 transitions. [2020-09-04 16:34:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:12,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-09-04 16:34:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:12,654 INFO L225 Difference]: With dead ends: 226 [2020-09-04 16:34:12,654 INFO L226 Difference]: Without dead ends: 157 [2020-09-04 16:34:12,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:12,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-09-04 16:34:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2020-09-04 16:34:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-09-04 16:34:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 200 transitions. [2020-09-04 16:34:12,689 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 200 transitions. Word has length 44 [2020-09-04 16:34:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:12,690 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 200 transitions. [2020-09-04 16:34:12,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 200 transitions. [2020-09-04 16:34:12,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-04 16:34:12,693 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:12,693 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:34:12,693 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:34:12,693 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:12,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:12,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1863120818, now seen corresponding path program 1 times [2020-09-04 16:34:12,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:12,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [111498989] [2020-09-04 16:34:12,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:12,697 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:12,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:12,745 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:34:12,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [111498989] [2020-09-04 16:34:12,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:12,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:12,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188815983] [2020-09-04 16:34:12,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:12,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:12,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:12,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:12,749 INFO L87 Difference]: Start difference. First operand 155 states and 200 transitions. Second operand 3 states. [2020-09-04 16:34:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:12,791 INFO L93 Difference]: Finished difference Result 191 states and 246 transitions. [2020-09-04 16:34:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:12,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-09-04 16:34:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:12,794 INFO L225 Difference]: With dead ends: 191 [2020-09-04 16:34:12,795 INFO L226 Difference]: Without dead ends: 189 [2020-09-04 16:34:12,796 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:12,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-09-04 16:34:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2020-09-04 16:34:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-09-04 16:34:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 198 transitions. [2020-09-04 16:34:12,834 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 198 transitions. Word has length 45 [2020-09-04 16:34:12,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:12,837 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 198 transitions. [2020-09-04 16:34:12,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2020-09-04 16:34:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-04 16:34:12,841 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:12,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:34:12,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:34:12,842 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:12,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:12,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1939288392, now seen corresponding path program 1 times [2020-09-04 16:34:12,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:12,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1454665691] [2020-09-04 16:34:12,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:12,845 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:12,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:12,912 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:34:12,913 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1454665691] [2020-09-04 16:34:12,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:12,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:12,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632381152] [2020-09-04 16:34:12,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:12,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:12,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:12,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:12,916 INFO L87 Difference]: Start difference. First operand 155 states and 198 transitions. Second operand 3 states. [2020-09-04 16:34:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:12,991 INFO L93 Difference]: Finished difference Result 403 states and 528 transitions. [2020-09-04 16:34:12,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:12,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-09-04 16:34:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:12,997 INFO L225 Difference]: With dead ends: 403 [2020-09-04 16:34:12,997 INFO L226 Difference]: Without dead ends: 273 [2020-09-04 16:34:12,999 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-09-04 16:34:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2020-09-04 16:34:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2020-09-04 16:34:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 346 transitions. [2020-09-04 16:34:13,065 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 346 transitions. Word has length 45 [2020-09-04 16:34:13,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:13,066 INFO L479 AbstractCegarLoop]: Abstraction has 271 states and 346 transitions. [2020-09-04 16:34:13,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 346 transitions. [2020-09-04 16:34:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-09-04 16:34:13,070 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:13,070 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, 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:34:13,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:34:13,071 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:13,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:13,071 INFO L82 PathProgramCache]: Analyzing trace with hash -11355582, now seen corresponding path program 1 times [2020-09-04 16:34:13,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:13,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1417532505] [2020-09-04 16:34:13,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:13,077 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:13,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:13,128 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:34:13,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1417532505] [2020-09-04 16:34:13,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:13,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:13,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980552107] [2020-09-04 16:34:13,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:13,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:13,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:13,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:13,131 INFO L87 Difference]: Start difference. First operand 271 states and 346 transitions. Second operand 3 states. [2020-09-04 16:34:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:13,195 INFO L93 Difference]: Finished difference Result 739 states and 956 transitions. [2020-09-04 16:34:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:13,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-09-04 16:34:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:13,199 INFO L225 Difference]: With dead ends: 739 [2020-09-04 16:34:13,200 INFO L226 Difference]: Without dead ends: 493 [2020-09-04 16:34:13,202 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2020-09-04 16:34:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2020-09-04 16:34:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-09-04 16:34:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 618 transitions. [2020-09-04 16:34:13,252 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 618 transitions. Word has length 46 [2020-09-04 16:34:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:13,252 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 618 transitions. [2020-09-04 16:34:13,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 618 transitions. [2020-09-04 16:34:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-09-04 16:34:13,255 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:13,255 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, 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:34:13,255 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:34:13,256 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:13,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:13,256 INFO L82 PathProgramCache]: Analyzing trace with hash 338056749, now seen corresponding path program 1 times [2020-09-04 16:34:13,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:13,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2028760384] [2020-09-04 16:34:13,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:13,259 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:13,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:13,310 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:34:13,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2028760384] [2020-09-04 16:34:13,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:13,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:13,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892757066] [2020-09-04 16:34:13,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:13,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:13,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:13,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:13,313 INFO L87 Difference]: Start difference. First operand 491 states and 618 transitions. Second operand 3 states. [2020-09-04 16:34:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:13,374 INFO L93 Difference]: Finished difference Result 599 states and 748 transitions. [2020-09-04 16:34:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:13,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-09-04 16:34:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:13,378 INFO L225 Difference]: With dead ends: 599 [2020-09-04 16:34:13,379 INFO L226 Difference]: Without dead ends: 597 [2020-09-04 16:34:13,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:13,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-09-04 16:34:13,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 491. [2020-09-04 16:34:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-09-04 16:34:13,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 610 transitions. [2020-09-04 16:34:13,425 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 610 transitions. Word has length 46 [2020-09-04 16:34:13,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:13,427 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 610 transitions. [2020-09-04 16:34:13,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:13,427 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 610 transitions. [2020-09-04 16:34:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-09-04 16:34:13,431 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:13,431 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, 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:34:13,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:34:13,431 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:13,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:13,432 INFO L82 PathProgramCache]: Analyzing trace with hash -144915038, now seen corresponding path program 1 times [2020-09-04 16:34:13,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:13,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1617624020] [2020-09-04 16:34:13,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:13,437 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:13,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:13,506 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:34:13,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1617624020] [2020-09-04 16:34:13,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:13,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:13,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98045010] [2020-09-04 16:34:13,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:13,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:13,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:13,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:13,509 INFO L87 Difference]: Start difference. First operand 491 states and 610 transitions. Second operand 3 states. [2020-09-04 16:34:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:13,578 INFO L93 Difference]: Finished difference Result 591 states and 724 transitions. [2020-09-04 16:34:13,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:13,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-09-04 16:34:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:13,582 INFO L225 Difference]: With dead ends: 591 [2020-09-04 16:34:13,582 INFO L226 Difference]: Without dead ends: 589 [2020-09-04 16:34:13,583 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:13,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-09-04 16:34:13,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 491. [2020-09-04 16:34:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-09-04 16:34:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 602 transitions. [2020-09-04 16:34:13,635 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 602 transitions. Word has length 47 [2020-09-04 16:34:13,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:13,635 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 602 transitions. [2020-09-04 16:34:13,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 602 transitions. [2020-09-04 16:34:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-09-04 16:34:13,637 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:13,637 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, 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:34:13,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:34:13,638 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:13,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:13,639 INFO L82 PathProgramCache]: Analyzing trace with hash -351776260, now seen corresponding path program 1 times [2020-09-04 16:34:13,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:13,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [398751553] [2020-09-04 16:34:13,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:13,641 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:13,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:13,682 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:34:13,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [398751553] [2020-09-04 16:34:13,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:13,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:13,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346767739] [2020-09-04 16:34:13,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:13,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:13,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:13,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:13,685 INFO L87 Difference]: Start difference. First operand 491 states and 602 transitions. Second operand 3 states. [2020-09-04 16:34:13,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:13,796 INFO L93 Difference]: Finished difference Result 1373 states and 1691 transitions. [2020-09-04 16:34:13,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:13,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-09-04 16:34:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:13,801 INFO L225 Difference]: With dead ends: 1373 [2020-09-04 16:34:13,802 INFO L226 Difference]: Without dead ends: 491 [2020-09-04 16:34:13,804 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:13,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2020-09-04 16:34:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2020-09-04 16:34:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-09-04 16:34:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 570 transitions. [2020-09-04 16:34:13,848 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 570 transitions. Word has length 47 [2020-09-04 16:34:13,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:13,849 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 570 transitions. [2020-09-04 16:34:13,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-09-04 16:34:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 16:34:13,852 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:13,853 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, 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:34:13,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:34:13,853 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:13,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:13,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2062829121, now seen corresponding path program 1 times [2020-09-04 16:34:13,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:13,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1819674606] [2020-09-04 16:34:13,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:13,875 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:13,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:13,942 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:34:13,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1819674606] [2020-09-04 16:34:13,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:13,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:13,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846573259] [2020-09-04 16:34:13,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:13,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:13,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:13,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:13,945 INFO L87 Difference]: Start difference. First operand 491 states and 570 transitions. Second operand 3 states. [2020-09-04 16:34:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:13,989 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-09-04 16:34:13,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:13,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-09-04 16:34:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:13,991 INFO L225 Difference]: With dead ends: 491 [2020-09-04 16:34:13,991 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:34:13,993 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:13,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:34:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:34:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:34:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:34:13,994 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-09-04 16:34:13,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:13,994 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:34:13,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:34:13,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:34:13,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:34:13,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:34:14,901 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 16:34:15,335 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 16:34:15,566 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 16:34:15,674 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-09-04 16:34:15,995 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 16:34:16,305 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 16:34:16,475 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 16:34:16,865 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 16:34:16,968 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:34:16,968 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:34:16,968 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:34:16,968 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:34:16,968 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:34:16,968 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:34:16,969 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 93) the Hoare annotation is: true [2020-09-04 16:34:16,970 INFO L264 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (= main_~lk5~0 1) [2020-09-04 16:34:16,970 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-09-04 16:34:16,972 INFO L264 CegarLoopResult]: At program point L69(line 69) the Hoare annotation is: (let ((.cse6 (= main_~p5~0 0)) (.cse5 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse0 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse1) (and .cse5 .cse6 .cse1 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse3))) [2020-09-04 16:34:16,972 INFO L264 CegarLoopResult]: At program point L53-1(lines 24 88) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-09-04 16:34:16,972 INFO L264 CegarLoopResult]: At program point L78-1(lines 24 88) the Hoare annotation is: (or (= main_~p5~0 0) (= main_~lk5~0 1)) [2020-09-04 16:34:16,972 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-09-04 16:34:16,973 INFO L264 CegarLoopResult]: At program point L45-1(lines 24 88) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-09-04 16:34:16,973 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-09-04 16:34:16,973 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-09-04 16:34:16,973 INFO L264 CegarLoopResult]: At program point L70(line 70) the Hoare annotation is: (let ((.cse6 (= main_~p5~0 0)) (.cse5 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse0 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse1) (and .cse5 .cse6 .cse1 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse3))) [2020-09-04 16:34:16,973 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-09-04 16:34:16,976 INFO L271 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-09-04 16:34:16,977 INFO L264 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-09-04 16:34:16,977 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1))) (or (and .cse0 (= main_~lk5~0 1)) (and .cse0 (= main_~p5~0 0)))) [2020-09-04 16:34:16,977 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-09-04 16:34:16,977 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-09-04 16:34:16,978 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 93) the Hoare annotation is: true [2020-09-04 16:34:16,978 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) the Hoare annotation is: false [2020-09-04 16:34:16,979 INFO L264 CegarLoopResult]: At program point L63-1(lines 24 88) the Hoare annotation is: (let ((.cse6 (= main_~lk3~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk2~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse1 (= main_~p3~0 0)) (.cse7 (= main_~p5~0 0)) (.cse5 (= main_~p4~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse2) (and .cse0 .cse6 .cse7 .cse4) (and .cse6 .cse4 .cse5 .cse2) (and .cse0 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse3) (and .cse6 .cse7 .cse5 .cse3) (and .cse1 .cse7 .cse4 .cse5) (and .cse0 .cse6 .cse4 .cse2) (and .cse6 .cse5 .cse2 .cse3) (and .cse0 .cse6 .cse7 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse7 .cse4) (and .cse0 .cse1 .cse4 .cse2) (and .cse1 .cse7 .cse5 .cse3))) [2020-09-04 16:34:16,979 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2020-09-04 16:34:16,979 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 16:34:16,980 INFO L264 CegarLoopResult]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1))) (or (and .cse0 (= main_~lk5~0 1)) (and .cse0 (= main_~p5~0 0)))) [2020-09-04 16:34:16,980 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-09-04 16:34:16,980 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-09-04 16:34:16,980 INFO L264 CegarLoopResult]: At program point L64(line 64) the Hoare annotation is: (let ((.cse7 (= main_~p5~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse6 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse7 .cse6 .cse4) (and .cse5 .cse7 .cse2 .cse6 .cse4) (and .cse8 .cse5 .cse7 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse7 .cse1 .cse4) (and .cse8 .cse5 .cse7 .cse6 .cse4) (and .cse8 .cse5 .cse1 .cse3 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse3 .cse6 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4))) [2020-09-04 16:34:16,981 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-09-04 16:34:16,981 INFO L271 CegarLoopResult]: At program point L89(lines 5 93) the Hoare annotation is: true [2020-09-04 16:34:16,981 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 16:34:16,981 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-09-04 16:34:16,981 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-09-04 16:34:16,981 INFO L264 CegarLoopResult]: At program point L73-1(lines 24 88) the Hoare annotation is: (let ((.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~p5~0 0)) (.cse0 (= main_~p4~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse3 .cse0))) [2020-09-04 16:34:16,982 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-09-04 16:34:16,982 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (let ((.cse7 (= main_~p5~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse6 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse1 .cse2 .cse4) (and .cse5 .cse7 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse7 .cse6 .cse4) (and .cse8 .cse5 .cse7 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse7 .cse1 .cse4) (and .cse8 .cse5 .cse7 .cse6 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse3 .cse6 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4))) [2020-09-04 16:34:16,982 INFO L264 CegarLoopResult]: At program point L57-1(lines 24 88) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse9 .cse3 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse2 .cse9 .cse3 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse9 .cse3 .cse6) (and .cse8 .cse7 .cse1 .cse9 .cse3) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse0 .cse1 .cse9 .cse3) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse9 .cse3 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-09-04 16:34:16,983 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 16:34:16,983 INFO L264 CegarLoopResult]: At program point L49-1(lines 24 88) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse5 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse4 .cse5 .cse3) (and .cse0 .cse1 .cse5) (and .cse4 .cse3 .cse2) (and .cse0 .cse5 .cse3) (and .cse4 .cse1 .cse5))) [2020-09-04 16:34:16,983 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse1 .cse4 .cse3) (and .cse0 .cse1 .cse4))) [2020-09-04 16:34:16,983 INFO L271 CegarLoopResult]: At program point L41(lines 41 43) the Hoare annotation is: true [2020-09-04 16:34:16,985 INFO L264 CegarLoopResult]: At program point L41-2(lines 24 88) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-09-04 16:34:16,985 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-09-04 16:34:16,986 INFO L264 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-09-04 16:34:16,986 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-09-04 16:34:16,986 INFO L271 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-09-04 16:34:16,986 INFO L271 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: true [2020-09-04 16:34:16,987 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-09-04 16:34:16,987 INFO L271 CegarLoopResult]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2020-09-04 16:34:16,987 INFO L264 CegarLoopResult]: At program point L75(line 75) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse1 .cse4 .cse3) (and .cse0 .cse1 .cse4))) [2020-09-04 16:34:16,987 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-09-04 16:34:16,987 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-09-04 16:34:16,987 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-09-04 16:34:16,988 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-09-04 16:34:16,988 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: false [2020-09-04 16:34:16,988 INFO L271 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: true [2020-09-04 16:34:16,988 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (= main_~lk5~0 1) [2020-09-04 16:34:16,988 INFO L264 CegarLoopResult]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2020-09-04 16:34:16,988 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-09-04 16:34:16,988 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-09-04 16:34:16,989 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-09-04 16:34:16,989 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-09-04 16:34:16,989 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-09-04 16:34:16,989 INFO L264 CegarLoopResult]: At program point L68-1(lines 24 88) the Hoare annotation is: (let ((.cse1 (= main_~p3~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse1 .cse5 .cse4) (and .cse1 .cse2 .cse5) (and .cse0 .cse1 .cse4) (and .cse3 .cse5 .cse4) (and .cse3 .cse2 .cse5) (and .cse0 .cse3 .cse2))) [2020-09-04 16:34:17,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:34:17 BoogieIcfgContainer [2020-09-04 16:34:17,019 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:34:17,023 INFO L168 Benchmark]: Toolchain (without parser) took 6627.42 ms. Allocated memory was 136.3 MB in the beginning and 301.5 MB in the end (delta: 165.2 MB). Free memory was 99.9 MB in the beginning and 157.1 MB in the end (delta: -57.2 MB). Peak memory consumption was 129.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:17,024 INFO L168 Benchmark]: CDTParser took 0.91 ms. Allocated memory is still 136.3 MB. Free memory was 117.6 MB in the beginning and 117.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 16:34:17,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 448.22 ms. Allocated memory is still 136.3 MB. Free memory was 99.7 MB in the beginning and 89.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:17,033 INFO L168 Benchmark]: Boogie Preprocessor took 183.54 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 89.7 MB in the beginning and 178.0 MB in the end (delta: -88.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:17,034 INFO L168 Benchmark]: RCFGBuilder took 497.52 ms. Allocated memory is still 199.8 MB. Free memory was 178.0 MB in the beginning and 160.6 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:17,036 INFO L168 Benchmark]: TraceAbstraction took 5489.19 ms. Allocated memory was 199.8 MB in the beginning and 301.5 MB in the end (delta: 101.7 MB). Free memory was 159.9 MB in the beginning and 157.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 126.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:17,051 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.91 ms. Allocated memory is still 136.3 MB. Free memory was 117.6 MB in the beginning and 117.4 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 448.22 ms. Allocated memory is still 136.3 MB. Free memory was 99.7 MB in the beginning and 89.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 183.54 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 89.7 MB in the beginning and 178.0 MB in the end (delta: -88.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 497.52 ms. Allocated memory is still 199.8 MB. Free memory was 178.0 MB in the beginning and 160.6 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5489.19 ms. Allocated memory was 199.8 MB in the beginning and 301.5 MB in the end (delta: 101.7 MB). Free memory was 159.9 MB in the beginning and 157.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 126.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.3s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 956 SDtfs, 332 SDslu, 668 SDs, 0 SdLazy, 49 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491occurred in iteration=6, 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, 10 MinimizatonAttempts, 266 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 956 NumberOfFragments, 2378 HoareAnnotationTreeSize, 68 FomulaSimplifications, 9164 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 68 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.9s 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...