/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:34:10,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:34:10,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:34:11,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:34:11,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:34:11,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:34:11,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:34:11,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:34:11,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:34:11,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:34:11,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:34:11,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:34:11,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:34:11,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:34:11,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:34:11,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:34:11,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:34:11,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:34:11,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:34:11,050 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:34:11,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:34:11,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:34:11,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:34:11,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:34:11,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:34:11,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:34:11,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:34:11,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:34:11,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:34:11,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:34:11,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:34:11,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:34:11,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:34:11,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:34:11,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:34:11,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:34:11,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:34:11,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:34:11,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:34:11,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:34:11,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:34:11,089 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:11,109 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:34:11,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:34:11,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:34:11,114 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:34:11,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:34:11,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:34:11,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:34:11,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:34:11,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:34:11,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:34:11,116 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:34:11,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:34:11,117 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:34:11,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:34:11,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:34:11,118 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:34:11,118 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:34:11,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:34:11,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:34:11,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:34:11,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:34:11,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:34:11,119 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:34:11,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:34:11,558 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:34:11,561 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:34:11,563 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:34:11,563 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:34:11,564 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2020-09-04 16:34:11,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4b8a86a3e/995ebc988fed4a3a8d2eb28ef9717ae9/FLAGcc7bc2412 [2020-09-04 16:34:12,244 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:34:12,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/locks/test_locks_6.c [2020-09-04 16:34:12,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4b8a86a3e/995ebc988fed4a3a8d2eb28ef9717ae9/FLAGcc7bc2412 [2020-09-04 16:34:12,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4b8a86a3e/995ebc988fed4a3a8d2eb28ef9717ae9 [2020-09-04 16:34:12,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:34:12,589 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:34:12,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:34:12,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:34:12,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:34:12,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:34:12" (1/1) ... [2020-09-04 16:34:12,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245d8fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:12, skipping insertion in model container [2020-09-04 16:34:12,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:34:12" (1/1) ... [2020-09-04 16:34:12,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:34:12,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:34:12,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:34:12,950 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:34:12,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:34:12,997 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:34:12,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:12 WrapperNode [2020-09-04 16:34:12,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:34:12,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:34:12,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:34:12,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:34:13,017 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:12" (1/1) ... [2020-09-04 16:34:13,018 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:12" (1/1) ... [2020-09-04 16:34:13,026 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:12" (1/1) ... [2020-09-04 16:34:13,026 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:12" (1/1) ... [2020-09-04 16:34:13,032 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:12" (1/1) ... [2020-09-04 16:34:13,129 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:12" (1/1) ... [2020-09-04 16:34:13,132 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:12" (1/1) ... [2020-09-04 16:34:13,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:34:13,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:34:13,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:34:13,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:34:13,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:12" (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:13,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:34:13,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:34:13,224 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:34:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:34:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:34:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:34:13,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:34:13,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:34:13,554 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:34:13,555 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 16:34:13,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:34:13 BoogieIcfgContainer [2020-09-04 16:34:13,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:34:13,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:34:13,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:34:13,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:34:13,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:34:12" (1/3) ... [2020-09-04 16:34:13,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b843084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:34:13, skipping insertion in model container [2020-09-04 16:34:13,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:34:12" (2/3) ... [2020-09-04 16:34:13,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b843084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:34:13, skipping insertion in model container [2020-09-04 16:34:13,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:34:13" (3/3) ... [2020-09-04 16:34:13,575 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-09-04 16:34:13,590 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:34:13,602 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:34:13,629 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:34:13,662 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:34:13,662 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:34:13,663 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:34:13,663 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:34:13,663 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:34:13,663 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:34:13,663 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:34:13,664 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:34:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-09-04 16:34:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-09-04 16:34:13,704 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:13,705 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, 1] [2020-09-04 16:34:13,706 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:13,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:13,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1400694048, now seen corresponding path program 1 times [2020-09-04 16:34:13,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:13,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1628776400] [2020-09-04 16:34:13,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:13,795 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:13,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:14,003 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:14,013 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1628776400] [2020-09-04 16:34:14,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:14,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:14,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407723815] [2020-09-04 16:34:14,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:14,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:14,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:14,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:14,045 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-09-04 16:34:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:14,147 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2020-09-04 16:34:14,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:14,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-09-04 16:34:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:14,167 INFO L225 Difference]: With dead ends: 169 [2020-09-04 16:34:14,168 INFO L226 Difference]: Without dead ends: 112 [2020-09-04 16:34:14,174 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:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-09-04 16:34:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-09-04 16:34:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-09-04 16:34:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2020-09-04 16:34:14,255 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 49 [2020-09-04 16:34:14,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:14,256 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2020-09-04 16:34:14,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2020-09-04 16:34:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 16:34:14,259 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:14,259 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, 1, 1] [2020-09-04 16:34:14,260 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:34:14,260 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:14,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1290717684, now seen corresponding path program 1 times [2020-09-04 16:34:14,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:14,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [962250360] [2020-09-04 16:34:14,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:14,264 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:14,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:14,338 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:14,339 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [962250360] [2020-09-04 16:34:14,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:14,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:14,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304834764] [2020-09-04 16:34:14,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:14,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:14,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:14,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:14,343 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 3 states. [2020-09-04 16:34:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:14,381 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2020-09-04 16:34:14,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:14,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-09-04 16:34:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:14,384 INFO L225 Difference]: With dead ends: 135 [2020-09-04 16:34:14,385 INFO L226 Difference]: Without dead ends: 133 [2020-09-04 16:34:14,387 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:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-09-04 16:34:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2020-09-04 16:34:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-09-04 16:34:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2020-09-04 16:34:14,412 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 50 [2020-09-04 16:34:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:14,413 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2020-09-04 16:34:14,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2020-09-04 16:34:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-09-04 16:34:14,415 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:14,415 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, 1, 1] [2020-09-04 16:34:14,416 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:34:14,416 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:14,416 INFO L82 PathProgramCache]: Analyzing trace with hash 472087846, now seen corresponding path program 1 times [2020-09-04 16:34:14,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:14,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1160489038] [2020-09-04 16:34:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:14,419 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:14,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:14,501 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:14,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1160489038] [2020-09-04 16:34:14,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:14,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:14,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527363771] [2020-09-04 16:34:14,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:14,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:14,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:14,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:14,504 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 3 states. [2020-09-04 16:34:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:14,593 INFO L93 Difference]: Finished difference Result 266 states and 357 transitions. [2020-09-04 16:34:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:14,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-09-04 16:34:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:14,602 INFO L225 Difference]: With dead ends: 266 [2020-09-04 16:34:14,603 INFO L226 Difference]: Without dead ends: 185 [2020-09-04 16:34:14,604 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:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-09-04 16:34:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2020-09-04 16:34:14,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-09-04 16:34:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2020-09-04 16:34:14,677 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 50 [2020-09-04 16:34:14,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:14,678 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2020-09-04 16:34:14,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2020-09-04 16:34:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 16:34:14,684 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:14,687 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, 1, 1, 1] [2020-09-04 16:34:14,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:34:14,688 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1750067028, now seen corresponding path program 1 times [2020-09-04 16:34:14,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:14,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [945536570] [2020-09-04 16:34:14,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:14,695 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:14,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:14,771 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:14,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [945536570] [2020-09-04 16:34:14,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:14,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:14,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861050551] [2020-09-04 16:34:14,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:14,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:14,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:14,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:14,774 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand 3 states. [2020-09-04 16:34:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:14,843 INFO L93 Difference]: Finished difference Result 479 states and 646 transitions. [2020-09-04 16:34:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:14,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-09-04 16:34:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:14,847 INFO L225 Difference]: With dead ends: 479 [2020-09-04 16:34:14,847 INFO L226 Difference]: Without dead ends: 325 [2020-09-04 16:34:14,849 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:14,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-09-04 16:34:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2020-09-04 16:34:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-09-04 16:34:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 426 transitions. [2020-09-04 16:34:14,897 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 426 transitions. Word has length 51 [2020-09-04 16:34:14,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:14,900 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 426 transitions. [2020-09-04 16:34:14,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 426 transitions. [2020-09-04 16:34:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 16:34:14,905 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:14,905 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, 1, 1, 1] [2020-09-04 16:34:14,906 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:34:14,906 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:14,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:14,906 INFO L82 PathProgramCache]: Analyzing trace with hash -17356107, now seen corresponding path program 1 times [2020-09-04 16:34:14,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:14,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [930138759] [2020-09-04 16:34:14,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:14,911 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:14,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:14,954 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:14,954 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [930138759] [2020-09-04 16:34:14,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:14,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:14,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584725099] [2020-09-04 16:34:14,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:14,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:14,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:14,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:14,957 INFO L87 Difference]: Start difference. First operand 323 states and 426 transitions. Second operand 3 states. [2020-09-04 16:34:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:14,996 INFO L93 Difference]: Finished difference Result 399 states and 528 transitions. [2020-09-04 16:34:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:14,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-09-04 16:34:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:15,000 INFO L225 Difference]: With dead ends: 399 [2020-09-04 16:34:15,000 INFO L226 Difference]: Without dead ends: 397 [2020-09-04 16:34:15,001 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:15,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-09-04 16:34:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 323. [2020-09-04 16:34:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-09-04 16:34:15,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2020-09-04 16:34:15,038 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 51 [2020-09-04 16:34:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:15,039 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2020-09-04 16:34:15,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:15,039 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2020-09-04 16:34:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 16:34:15,041 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:15,041 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, 1, 1, 1, 1] [2020-09-04 16:34:15,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:34:15,042 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:15,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:15,042 INFO L82 PathProgramCache]: Analyzing trace with hash 802147488, now seen corresponding path program 1 times [2020-09-04 16:34:15,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:15,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2069371970] [2020-09-04 16:34:15,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:15,045 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:15,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:15,105 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:15,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2069371970] [2020-09-04 16:34:15,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:15,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:15,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504833947] [2020-09-04 16:34:15,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:15,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:15,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:15,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:15,111 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 3 states. [2020-09-04 16:34:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:15,173 INFO L93 Difference]: Finished difference Result 395 states and 516 transitions. [2020-09-04 16:34:15,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:15,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-09-04 16:34:15,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:15,180 INFO L225 Difference]: With dead ends: 395 [2020-09-04 16:34:15,181 INFO L226 Difference]: Without dead ends: 393 [2020-09-04 16:34:15,182 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:15,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-09-04 16:34:15,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 323. [2020-09-04 16:34:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-09-04 16:34:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2020-09-04 16:34:15,219 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 52 [2020-09-04 16:34:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:15,224 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2020-09-04 16:34:15,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2020-09-04 16:34:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 16:34:15,232 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:15,232 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, 1, 1, 1, 1] [2020-09-04 16:34:15,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:34:15,238 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:15,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:15,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1582250918, now seen corresponding path program 1 times [2020-09-04 16:34:15,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:15,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1275459650] [2020-09-04 16:34:15,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:15,241 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:15,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:15,304 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:15,305 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1275459650] [2020-09-04 16:34:15,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:15,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:15,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127258038] [2020-09-04 16:34:15,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:15,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:15,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:15,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:15,307 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand 3 states. [2020-09-04 16:34:15,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:15,371 INFO L93 Difference]: Finished difference Result 887 states and 1164 transitions. [2020-09-04 16:34:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:15,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-09-04 16:34:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:15,375 INFO L225 Difference]: With dead ends: 887 [2020-09-04 16:34:15,375 INFO L226 Difference]: Without dead ends: 593 [2020-09-04 16:34:15,377 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:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-09-04 16:34:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2020-09-04 16:34:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-09-04 16:34:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 758 transitions. [2020-09-04 16:34:15,437 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 758 transitions. Word has length 52 [2020-09-04 16:34:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:15,437 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 758 transitions. [2020-09-04 16:34:15,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 758 transitions. [2020-09-04 16:34:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-09-04 16:34:15,440 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:15,440 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, 1, 1, 1, 1, 1] [2020-09-04 16:34:15,440 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:34:15,440 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:15,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:15,441 INFO L82 PathProgramCache]: Analyzing trace with hash 436955529, now seen corresponding path program 1 times [2020-09-04 16:34:15,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:15,441 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [758479755] [2020-09-04 16:34:15,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:15,443 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:15,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:15,537 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:15,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [758479755] [2020-09-04 16:34:15,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:15,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:15,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441486353] [2020-09-04 16:34:15,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:15,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:15,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:15,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:15,543 INFO L87 Difference]: Start difference. First operand 591 states and 758 transitions. Second operand 3 states. [2020-09-04 16:34:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:15,626 INFO L93 Difference]: Finished difference Result 715 states and 912 transitions. [2020-09-04 16:34:15,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:15,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-09-04 16:34:15,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:15,632 INFO L225 Difference]: With dead ends: 715 [2020-09-04 16:34:15,632 INFO L226 Difference]: Without dead ends: 713 [2020-09-04 16:34:15,633 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:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-09-04 16:34:15,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 591. [2020-09-04 16:34:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-09-04 16:34:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 750 transitions. [2020-09-04 16:34:15,680 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 750 transitions. Word has length 53 [2020-09-04 16:34:15,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:15,681 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 750 transitions. [2020-09-04 16:34:15,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 750 transitions. [2020-09-04 16:34:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-09-04 16:34:15,684 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:15,684 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, 1, 1, 1, 1, 1] [2020-09-04 16:34:15,684 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:34:15,684 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:15,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1804891768, now seen corresponding path program 1 times [2020-09-04 16:34:15,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:15,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [908000249] [2020-09-04 16:34:15,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:15,692 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:15,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:15,747 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:15,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [908000249] [2020-09-04 16:34:15,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:15,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:15,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100816255] [2020-09-04 16:34:15,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:15,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:15,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:15,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:15,750 INFO L87 Difference]: Start difference. First operand 591 states and 750 transitions. Second operand 3 states. [2020-09-04 16:34:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:15,848 INFO L93 Difference]: Finished difference Result 1667 states and 2128 transitions. [2020-09-04 16:34:15,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:15,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-09-04 16:34:15,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:15,854 INFO L225 Difference]: With dead ends: 1667 [2020-09-04 16:34:15,855 INFO L226 Difference]: Without dead ends: 1105 [2020-09-04 16:34:15,857 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:15,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2020-09-04 16:34:15,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1103. [2020-09-04 16:34:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-09-04 16:34:15,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1374 transitions. [2020-09-04 16:34:15,945 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1374 transitions. Word has length 53 [2020-09-04 16:34:15,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:15,946 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1374 transitions. [2020-09-04 16:34:15,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:15,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1374 transitions. [2020-09-04 16:34:15,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 16:34:15,952 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:15,953 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, 1, 1, 1, 1, 1, 1] [2020-09-04 16:34:15,953 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:34:15,953 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:15,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:15,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2000907060, now seen corresponding path program 1 times [2020-09-04 16:34:15,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:15,957 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [78018915] [2020-09-04 16:34:15,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:15,959 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:16,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:16,017 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:16,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [78018915] [2020-09-04 16:34:16,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:16,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:16,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843424156] [2020-09-04 16:34:16,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:16,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:16,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:16,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:16,020 INFO L87 Difference]: Start difference. First operand 1103 states and 1374 transitions. Second operand 3 states. [2020-09-04 16:34:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:16,135 INFO L93 Difference]: Finished difference Result 1315 states and 1616 transitions. [2020-09-04 16:34:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:16,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-09-04 16:34:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:16,144 INFO L225 Difference]: With dead ends: 1315 [2020-09-04 16:34:16,144 INFO L226 Difference]: Without dead ends: 1313 [2020-09-04 16:34:16,146 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:16,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2020-09-04 16:34:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1103. [2020-09-04 16:34:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-09-04 16:34:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1358 transitions. [2020-09-04 16:34:16,259 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1358 transitions. Word has length 54 [2020-09-04 16:34:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:16,259 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1358 transitions. [2020-09-04 16:34:16,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:16,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1358 transitions. [2020-09-04 16:34:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 16:34:16,261 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:16,261 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, 1, 1, 1, 1, 1, 1] [2020-09-04 16:34:16,262 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:34:16,262 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:16,262 INFO L82 PathProgramCache]: Analyzing trace with hash -116823154, now seen corresponding path program 1 times [2020-09-04 16:34:16,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:16,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [92022232] [2020-09-04 16:34:16,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:16,266 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:16,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:16,302 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:16,303 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [92022232] [2020-09-04 16:34:16,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:16,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:16,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924847304] [2020-09-04 16:34:16,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:16,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:16,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:16,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:16,305 INFO L87 Difference]: Start difference. First operand 1103 states and 1358 transitions. Second operand 3 states. [2020-09-04 16:34:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:16,500 INFO L93 Difference]: Finished difference Result 3153 states and 3887 transitions. [2020-09-04 16:34:16,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:16,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-09-04 16:34:16,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:16,508 INFO L225 Difference]: With dead ends: 3153 [2020-09-04 16:34:16,508 INFO L226 Difference]: Without dead ends: 1103 [2020-09-04 16:34:16,513 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:16,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-09-04 16:34:16,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2020-09-04 16:34:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-09-04 16:34:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1294 transitions. [2020-09-04 16:34:16,583 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1294 transitions. Word has length 54 [2020-09-04 16:34:16,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:16,584 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1294 transitions. [2020-09-04 16:34:16,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-09-04 16:34:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-04 16:34:16,586 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:34:16,586 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, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:34:16,586 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:34:16,586 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:34:16,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:34:16,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1056202659, now seen corresponding path program 1 times [2020-09-04 16:34:16,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:34:16,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1337965120] [2020-09-04 16:34:16,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:34:16,590 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:34:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:16,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:34:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:34:16,634 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:16,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1337965120] [2020-09-04 16:34:16,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:34:16,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 16:34:16,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376557665] [2020-09-04 16:34:16,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 16:34:16,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:34:16,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 16:34:16,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 16:34:16,636 INFO L87 Difference]: Start difference. First operand 1103 states and 1294 transitions. Second operand 3 states. [2020-09-04 16:34:16,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:34:16,701 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-09-04 16:34:16,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 16:34:16,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-09-04 16:34:16,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:34:16,702 INFO L225 Difference]: With dead ends: 1103 [2020-09-04 16:34:16,702 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:34:16,705 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:16,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:34:16,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:34:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:34:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:34:16,706 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-09-04 16:34:16,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:34:16,707 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:34:16,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 16:34:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:34:16,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:34:16,707 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:34:16,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:34:16,846 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 15 [2020-09-04 16:34:17,164 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2020-09-04 16:34:17,308 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 16:34:17,693 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 16:34:17,816 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 35 [2020-09-04 16:34:18,161 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 7 [2020-09-04 16:34:18,372 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 16:34:18,482 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 16:34:19,049 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2020-09-04 16:34:19,420 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 16:34:19,838 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 16:34:20,286 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 16:34:21,398 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 91 [2020-09-04 16:34:21,574 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 16:34:21,879 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 16:34:22,399 WARN L193 SmtUtils]: Spent 518.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-09-04 16:34:22,769 WARN L193 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 16:34:22,925 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 16:34:23,228 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 16:34:23,662 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 16:34:23,827 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:34:23,828 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:34:23,828 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:34:23,828 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:34:23,828 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:34:23,828 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:34:23,828 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1))) (or (and (= main_~lk6~0 1) .cse0) (and (= main_~p6~0 0) .cse0))) [2020-09-04 16:34:23,828 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 107) the Hoare annotation is: true [2020-09-04 16:34:23,828 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-09-04 16:34:23,829 INFO L264 CegarLoopResult]: At program point L77-1(lines 27 102) the Hoare annotation is: (let ((.cse5 (= main_~p5~0 0)) (.cse1 (= main_~p6~0 0)) (.cse4 (= main_~lk3~0 1)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p3~0 0)) (.cse6 (= main_~lk6~0 1)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse5) (and .cse0 .cse2 .cse5 .cse6) (and .cse1 .cse2 .cse5 .cse7) (and .cse4 .cse1 .cse7 .cse3) (and .cse2 .cse5 .cse6 .cse7) (and .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse2 .cse7 .cse3) (and .cse0 .cse4 .cse5 .cse6) (and .cse0 .cse4 .cse6 .cse3) (and .cse4 .cse1 .cse5 .cse7) (and .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse4 .cse1 .cse3) (and .cse4 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse6 .cse3))) [2020-09-04 16:34:23,829 INFO L271 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-09-04 16:34:23,829 INFO L264 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1))) (or (and (= main_~lk6~0 1) .cse0) (and (= main_~p6~0 0) .cse0))) [2020-09-04 16:34:23,829 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-09-04 16:34:23,829 INFO L271 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-09-04 16:34:23,830 INFO L271 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-09-04 16:34:23,830 INFO L264 CegarLoopResult]: At program point L78(line 78) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse6 (= main_~p4~0 0)) (.cse8 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse3 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse1 .cse3 .cse4 .cse6 .cse8) (and .cse5 .cse7 .cse3 .cse6 .cse8) (and .cse5 .cse7 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse7 .cse3 .cse8) (and .cse5 .cse3 .cse4 .cse6 .cse8) (and .cse7 .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse5 .cse7 .cse2 .cse3) (and .cse5 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse1 .cse3 .cse6 .cse8))) [2020-09-04 16:34:23,830 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-09-04 16:34:23,830 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-09-04 16:34:23,830 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-09-04 16:34:23,830 INFO L271 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2020-09-04 16:34:23,831 INFO L271 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-09-04 16:34:23,831 INFO L264 CegarLoopResult]: At program point L62-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk1~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse8 (= 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 .cse0 .cse5 .cse6 .cse4) (and .cse8 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse8 .cse5 .cse1 .cse4) (and .cse7 .cse0 .cse1 .cse3 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse4) (and .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse8 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse3 .cse6) (and .cse7 .cse0 .cse5 .cse1 .cse9) (and .cse0 .cse2 .cse9 .cse3 .cse6) (and .cse8 .cse1 .cse2 .cse9 .cse3) (and .cse8 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse7 .cse0 .cse5 .cse9 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse3) (and .cse7 .cse8 .cse5 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse3 .cse6) (and .cse7 .cse8 .cse5 .cse1 .cse9))) [2020-09-04 16:34:23,831 INFO L264 CegarLoopResult]: At program point L87-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p6~0 0)) (.cse0 (= main_~p5~0 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse3 .cse2) (and .cse3 .cse0))) [2020-09-04 16:34:23,831 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-09-04 16:34:23,832 INFO L264 CegarLoopResult]: At program point L54-1(lines 27 102) 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 .cse4 .cse5 .cse3) (and .cse0 .cse1 .cse5) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-09-04 16:34:23,832 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-09-04 16:34:23,832 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-09-04 16:34:23,832 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse6 (= main_~p4~0 0)) (.cse8 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse3 .cse8) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and .cse1 .cse3 .cse4 .cse6 .cse8) (and .cse5 .cse7 .cse3 .cse6 .cse8) (and .cse5 .cse7 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse5 .cse3 .cse4 .cse6 .cse8) (and .cse0 .cse5 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse7 .cse3 .cse8) (and .cse7 .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse5 .cse7 .cse2 .cse3) (and .cse5 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse1 .cse3 .cse6 .cse8))) [2020-09-04 16:34:23,832 INFO L271 CegarLoopResult]: At program point L46(lines 46 48) the Hoare annotation is: true [2020-09-04 16:34:23,833 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-09-04 16:34:23,833 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 107) the Hoare annotation is: true [2020-09-04 16:34:23,833 INFO L264 CegarLoopResult]: At program point L46-2(lines 27 102) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-09-04 16:34:23,833 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-09-04 16:34:23,833 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2020-09-04 16:34:23,833 INFO L264 CegarLoopResult]: At program point L63(line 63) 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:23,834 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2020-09-04 16:34:23,834 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse4 (= main_~p5~0 0)) (.cse1 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse3 (= main_~p6~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse4 .cse1) (and .cse0 .cse3 .cse2))) [2020-09-04 16:34:23,834 INFO L264 CegarLoopResult]: At program point L55(line 55) 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:23,834 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 16:34:23,834 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-09-04 16:34:23,835 INFO L264 CegarLoopResult]: At program point L72-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse9 (= main_~p2~0 0)) (.cse5 (= main_~p6~0 0)) (.cse6 (= main_~p3~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse8 (= main_~p4~0 0)) (.cse7 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse3 .cse7) (and .cse1 .cse4 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse5 .cse2 .cse9) (and .cse6 .cse3 .cse4 .cse8 .cse7) (and .cse0 .cse5 .cse6 .cse7 .cse9) (and .cse0 .cse1 .cse4 .cse7 .cse9) (and .cse6 .cse2 .cse4 .cse8 .cse9) (and .cse0 .cse6 .cse4 .cse7 .cse9) (and .cse1 .cse3 .cse4 .cse8 .cse7) (and .cse0 .cse1 .cse5 .cse3 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse6 .cse4 .cse8 .cse7 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse5 .cse6 .cse2 .cse9) (and .cse0 .cse6 .cse2 .cse4 .cse9) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse6 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse5 .cse6 .cse2 .cse3) (and .cse1 .cse5 .cse3 .cse8 .cse7) (and .cse1 .cse5 .cse2 .cse3 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7) (and .cse1 .cse5 .cse2 .cse8 .cse9) (and .cse5 .cse6 .cse2 .cse8 .cse9) (and .cse1 .cse2 .cse4 .cse8 .cse9) (and .cse0 .cse1 .cse5 .cse7 .cse9) (and .cse1 .cse5 .cse8 .cse7 .cse9) (and .cse5 .cse6 .cse2 .cse3 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse5 .cse6 .cse3 .cse8 .cse7))) [2020-09-04 16:34:23,835 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-09-04 16:34:23,835 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-09-04 16:34:23,835 INFO L271 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2020-09-04 16:34:23,835 INFO L264 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (let ((.cse4 (= main_~p5~0 0)) (.cse1 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse3 (= main_~p6~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse0 .cse4 .cse1) (and .cse0 .cse3 .cse2))) [2020-09-04 16:34:23,835 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 16:34:23,836 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-09-04 16:34:23,836 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-09-04 16:34:23,836 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: false [2020-09-04 16:34:23,836 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse10 (= main_~lk2~0 1)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse8 (= main_~lk3~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5))) [2020-09-04 16:34:23,836 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-09-04 16:34:23,837 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-09-04 16:34:23,837 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (= main_~lk6~0 1) [2020-09-04 16:34:23,837 INFO L264 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2020-09-04 16:34:23,837 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-09-04 16:34:23,837 INFO L264 CegarLoopResult]: At program point L82-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~p4~0 0)) (.cse3 (= main_~lk4~0 1)) (.cse0 (= main_~p6~0 0)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse3 .cse0 .cse5) (and .cse5 .cse4 .cse1) (and .cse4 .cse1 .cse2) (and .cse3 .cse5 .cse4) (and .cse0 .cse5 .cse1) (and .cse3 .cse0 .cse2))) [2020-09-04 16:34:23,837 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 16:34:23,837 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse7 (= main_~p4~0 0)) (.cse4 (= main_~p2~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5))) [2020-09-04 16:34:23,838 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (= main_~lk6~0 1) [2020-09-04 16:34:23,838 INFO L264 CegarLoopResult]: At program point L66-1(lines 27 102) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse10 (= main_~p1~0 0)) (.cse8 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse11 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse4) (and .cse8 .cse1 .cse11 .cse7 .cse10 .cse3) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse10 .cse4) (and .cse0 .cse8 .cse9 .cse6 .cse10 .cse4) (and .cse0 .cse8 .cse11 .cse6 .cse3 .cse5) (and .cse8 .cse9 .cse11 .cse6 .cse7 .cse10) (and .cse0 .cse2 .cse6 .cse10 .cse3 .cse4) (and .cse8 .cse1 .cse9 .cse11 .cse7 .cse5) (and .cse8 .cse9 .cse11 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse11 .cse3 .cse5) (and .cse2 .cse9 .cse11 .cse6 .cse7 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse10) (and .cse8 .cse1 .cse11 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse11 .cse6 .cse5) (and .cse0 .cse8 .cse11 .cse6 .cse10 .cse3) (and .cse2 .cse6 .cse7 .cse10 .cse3 .cse4) (and .cse8 .cse11 .cse6 .cse7 .cse10 .cse3) (and .cse0 .cse2 .cse11 .cse6 .cse10 .cse3) (and .cse8 .cse9 .cse6 .cse7 .cse10 .cse4) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse10 .cse4) (and .cse8 .cse1 .cse9 .cse7 .cse10 .cse4) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse10 .cse3) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse3 .cse5) (and .cse8 .cse6 .cse7 .cse10 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse11 .cse10 .cse3) (and .cse8 .cse11 .cse6 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse11 .cse7 .cse10 .cse3) (and .cse0 .cse2 .cse9 .cse11 .cse6 .cse10) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse4) (and .cse0 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse1 .cse9 .cse11 .cse7 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse7 .cse5) (and .cse0 .cse2 .cse9 .cse11 .cse6 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse3 .cse5) (and .cse8 .cse1 .cse7 .cse10 .cse3 .cse4) (and .cse2 .cse11 .cse6 .cse7 .cse10 .cse3) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse11 .cse7 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse10 .cse4) (and .cse1 .cse2 .cse7 .cse10 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse10) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse11 .cse7 .cse5))) [2020-09-04 16:34:23,838 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-09-04 16:34:23,838 INFO L264 CegarLoopResult]: At program point L58-1(lines 27 102) 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:23,839 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p6~0 0)) (.cse3 (= main_~p5~0 0)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse4 .cse5) (and .cse1 .cse2 .cse6 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse3 .cse4 .cse6) (and .cse1 .cse4 .cse6 .cse5))) [2020-09-04 16:34:23,839 INFO L264 CegarLoopResult]: At program point L50-1(lines 27 102) 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:23,839 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-09-04 16:34:23,839 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-09-04 16:34:23,839 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-09-04 16:34:23,839 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-09-04 16:34:23,840 INFO L264 CegarLoopResult]: At program point L67(line 67) 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 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse7 .cse5 .cse2 .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 .cse8 .cse0 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .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 .cse0 .cse2 .cse9 .cse3 .cse6) (and .cse7 .cse1 .cse2 .cse9 .cse3) (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:23,840 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-09-04 16:34:23,840 INFO L264 CegarLoopResult]: At program point L59(line 59) 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:23,840 INFO L264 CegarLoopResult]: At program point L92-1(lines 27 102) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2020-09-04 16:34:23,841 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1)) (.cse2 (= main_~p6~0 0)) (.cse3 (= main_~p5~0 0)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse5 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse2 .cse6 .cse5) (and .cse1 .cse2 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse3 .cse4 .cse6) (and .cse1 .cse4 .cse6 .cse5))) [2020-09-04 16:34:23,841 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-09-04 16:34:23,841 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-09-04 16:34:23,841 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-09-04 16:34:23,841 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-09-04 16:34:23,841 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-09-04 16:34:23,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:34:23 BoogieIcfgContainer [2020-09-04 16:34:23,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:34:23,867 INFO L168 Benchmark]: Toolchain (without parser) took 11276.24 ms. Allocated memory was 140.0 MB in the beginning and 358.6 MB in the end (delta: 218.6 MB). Free memory was 103.6 MB in the beginning and 274.6 MB in the end (delta: -171.0 MB). Peak memory consumption was 229.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:23,869 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 140.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-09-04 16:34:23,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.49 ms. Allocated memory is still 140.0 MB. Free memory was 103.4 MB in the beginning and 93.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:23,876 INFO L168 Benchmark]: Boogie Preprocessor took 136.47 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 93.3 MB in the beginning and 182.7 MB in the end (delta: -89.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:23,881 INFO L168 Benchmark]: RCFGBuilder took 427.62 ms. Allocated memory is still 203.9 MB. Free memory was 182.7 MB in the beginning and 163.5 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:23,884 INFO L168 Benchmark]: TraceAbstraction took 10298.03 ms. Allocated memory was 203.9 MB in the beginning and 358.6 MB in the end (delta: 154.7 MB). Free memory was 162.9 MB in the beginning and 274.6 MB in the end (delta: -111.7 MB). Peak memory consumption was 224.8 MB. Max. memory is 7.1 GB. [2020-09-04 16:34:23,886 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.15 ms. Allocated memory is still 140.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 407.49 ms. Allocated memory is still 140.0 MB. Free memory was 103.4 MB in the beginning and 93.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.47 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 93.3 MB in the beginning and 182.7 MB in the end (delta: -89.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.62 ms. Allocated memory is still 203.9 MB. Free memory was 182.7 MB in the beginning and 163.5 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10298.03 ms. Allocated memory was 203.9 MB in the beginning and 358.6 MB in the end (delta: 154.7 MB). Free memory was 162.9 MB in the beginning and 274.6 MB in the end (delta: -111.7 MB). Peak memory consumption was 224.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: 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, 78 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.0s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1351 SDtfs, 477 SDslu, 950 SDs, 0 SdLazy, 59 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 509 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 78 LocationsWithAnnotation, 78 PreInvPairs, 2134 NumberOfFragments, 5844 HoareAnnotationTreeSize, 78 FomulaSimplifications, 32094 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 78 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 4.6s 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...