/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 22:14:09,646 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 22:14:09,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 22:14:09,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 22:14:09,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 22:14:09,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 22:14:09,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 22:14:09,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 22:14:09,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 22:14:09,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 22:14:09,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 22:14:09,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 22:14:09,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 22:14:09,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 22:14:09,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 22:14:09,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 22:14:09,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 22:14:09,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 22:14:09,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 22:14:09,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 22:14:09,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 22:14:09,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 22:14:09,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 22:14:09,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 22:14:09,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 22:14:09,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 22:14:09,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 22:14:09,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 22:14:09,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 22:14:09,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 22:14:09,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 22:14:09,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 22:14:09,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 22:14:09,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 22:14:09,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 22:14:09,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 22:14:09,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 22:14:09,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 22:14:09,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 22:14:09,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 22:14:09,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 22:14:09,703 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 22:14:09,713 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 22:14:09,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 22:14:09,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 22:14:09,715 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 22:14:09,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 22:14:09,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 22:14:09,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 22:14:09,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 22:14:09,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 22:14:09,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 22:14:09,716 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 22:14:09,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 22:14:09,716 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 22:14:09,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 22:14:09,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 22:14:09,717 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 22:14:09,717 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 22:14:09,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 22:14:09,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 22:14:09,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 22:14:09,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 22:14:09,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 22:14:09,718 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-08-22 22:14:10,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 22:14:10,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 22:14:10,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 22:14:10,050 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 22:14:10,050 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 22:14:10,051 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2020-08-22 22:14:10,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71311c96b/f285d471ba20403a89ab3324f4594be0/FLAG19b2ca58b [2020-08-22 22:14:10,612 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 22:14:10,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-08-22 22:14:10,621 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71311c96b/f285d471ba20403a89ab3324f4594be0/FLAG19b2ca58b [2020-08-22 22:14:11,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71311c96b/f285d471ba20403a89ab3324f4594be0 [2020-08-22 22:14:11,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 22:14:11,039 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 22:14:11,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 22:14:11,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 22:14:11,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 22:14:11,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:11,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3ac32e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11, skipping insertion in model container [2020-08-22 22:14:11,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:11,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 22:14:11,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 22:14:11,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:14:11,339 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 22:14:11,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:14:11,372 INFO L208 MainTranslator]: Completed translation [2020-08-22 22:14:11,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11 WrapperNode [2020-08-22 22:14:11,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 22:14:11,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 22:14:11,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 22:14:11,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 22:14:11,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:11,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:11,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:11,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:11,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:11,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:11,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:11,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 22:14:11,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 22:14:11,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 22:14:11,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 22:14:11,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 22:14:11,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 22:14:11,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 22:14:11,588 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 22:14:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 22:14:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 22:14:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 22:14:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 22:14:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 22:14:11,945 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 22:14:11,945 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-22 22:14:11,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:14:11 BoogieIcfgContainer [2020-08-22 22:14:11,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 22:14:11,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 22:14:11,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 22:14:11,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 22:14:11,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 10:14:11" (1/3) ... [2020-08-22 22:14:11,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1e91cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:14:11, skipping insertion in model container [2020-08-22 22:14:11,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (2/3) ... [2020-08-22 22:14:11,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1e91cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:14:11, skipping insertion in model container [2020-08-22 22:14:11,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:14:11" (3/3) ... [2020-08-22 22:14:11,958 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-08-22 22:14:11,970 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 22:14:11,978 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 22:14:11,993 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 22:14:12,014 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 22:14:12,015 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 22:14:12,015 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 22:14:12,015 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 22:14:12,015 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 22:14:12,016 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 22:14:12,016 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 22:14:12,016 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 22:14:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-08-22 22:14:12,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-08-22 22:14:12,047 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:12,048 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-08-22 22:14:12,049 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:12,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1400694048, now seen corresponding path program 1 times [2020-08-22 22:14:12,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:12,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [649462450] [2020-08-22 22:14:12,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:12,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:12,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:12,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [649462450] [2020-08-22 22:14:12,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:12,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:12,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725181902] [2020-08-22 22:14:12,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:12,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:12,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:12,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:12,293 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-08-22 22:14:12,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:12,380 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2020-08-22 22:14:12,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:12,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-08-22 22:14:12,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:12,396 INFO L225 Difference]: With dead ends: 169 [2020-08-22 22:14:12,396 INFO L226 Difference]: Without dead ends: 112 [2020-08-22 22:14:12,401 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-08-22 22:14:12,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-08-22 22:14:12,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-08-22 22:14:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-08-22 22:14:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2020-08-22 22:14:12,461 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 49 [2020-08-22 22:14:12,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:12,462 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2020-08-22 22:14:12,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2020-08-22 22:14:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-22 22:14:12,465 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:12,465 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-08-22 22:14:12,466 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 22:14:12,466 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:12,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:12,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1290717684, now seen corresponding path program 1 times [2020-08-22 22:14:12,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:12,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [594378285] [2020-08-22 22:14:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:12,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:12,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [594378285] [2020-08-22 22:14:12,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:12,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:12,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596133179] [2020-08-22 22:14:12,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:12,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:12,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:12,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:12,547 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 3 states. [2020-08-22 22:14:12,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:12,584 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2020-08-22 22:14:12,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:12,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-08-22 22:14:12,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:12,587 INFO L225 Difference]: With dead ends: 135 [2020-08-22 22:14:12,588 INFO L226 Difference]: Without dead ends: 133 [2020-08-22 22:14:12,589 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-08-22 22:14:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-08-22 22:14:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2020-08-22 22:14:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-08-22 22:14:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2020-08-22 22:14:12,617 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 50 [2020-08-22 22:14:12,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:12,618 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2020-08-22 22:14:12,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2020-08-22 22:14:12,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-08-22 22:14:12,620 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:12,621 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-08-22 22:14:12,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 22:14:12,621 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:12,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:12,622 INFO L82 PathProgramCache]: Analyzing trace with hash 472087846, now seen corresponding path program 1 times [2020-08-22 22:14:12,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:12,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [220547586] [2020-08-22 22:14:12,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:12,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:12,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [220547586] [2020-08-22 22:14:12,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:12,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:12,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492140746] [2020-08-22 22:14:12,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:12,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:12,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:12,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:12,722 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 3 states. [2020-08-22 22:14:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:12,774 INFO L93 Difference]: Finished difference Result 266 states and 357 transitions. [2020-08-22 22:14:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:12,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-08-22 22:14:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:12,777 INFO L225 Difference]: With dead ends: 266 [2020-08-22 22:14:12,778 INFO L226 Difference]: Without dead ends: 185 [2020-08-22 22:14:12,779 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-08-22 22:14:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-08-22 22:14:12,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2020-08-22 22:14:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-08-22 22:14:12,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2020-08-22 22:14:12,812 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 50 [2020-08-22 22:14:12,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:12,813 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2020-08-22 22:14:12,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:12,813 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2020-08-22 22:14:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-22 22:14:12,815 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:12,815 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-08-22 22:14:12,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 22:14:12,816 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:12,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1750067028, now seen corresponding path program 1 times [2020-08-22 22:14:12,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:12,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [881756687] [2020-08-22 22:14:12,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:12,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:12,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [881756687] [2020-08-22 22:14:12,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:12,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:12,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749111182] [2020-08-22 22:14:12,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:12,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:12,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:12,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:12,900 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand 3 states. [2020-08-22 22:14:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:12,979 INFO L93 Difference]: Finished difference Result 479 states and 646 transitions. [2020-08-22 22:14:12,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:12,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-08-22 22:14:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:12,983 INFO L225 Difference]: With dead ends: 479 [2020-08-22 22:14:12,984 INFO L226 Difference]: Without dead ends: 325 [2020-08-22 22:14:12,985 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-08-22 22:14:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-08-22 22:14:13,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2020-08-22 22:14:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-08-22 22:14:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 426 transitions. [2020-08-22 22:14:13,068 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 426 transitions. Word has length 51 [2020-08-22 22:14:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:13,068 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 426 transitions. [2020-08-22 22:14:13,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 426 transitions. [2020-08-22 22:14:13,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-08-22 22:14:13,071 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:13,071 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-08-22 22:14:13,072 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 22:14:13,072 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:13,072 INFO L82 PathProgramCache]: Analyzing trace with hash -17356107, now seen corresponding path program 1 times [2020-08-22 22:14:13,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:13,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [373009214] [2020-08-22 22:14:13,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:13,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [373009214] [2020-08-22 22:14:13,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:13,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:13,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077296979] [2020-08-22 22:14:13,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:13,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:13,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:13,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,121 INFO L87 Difference]: Start difference. First operand 323 states and 426 transitions. Second operand 3 states. [2020-08-22 22:14:13,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:13,174 INFO L93 Difference]: Finished difference Result 399 states and 528 transitions. [2020-08-22 22:14:13,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:13,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-08-22 22:14:13,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:13,178 INFO L225 Difference]: With dead ends: 399 [2020-08-22 22:14:13,178 INFO L226 Difference]: Without dead ends: 397 [2020-08-22 22:14:13,179 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-08-22 22:14:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-08-22 22:14:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 323. [2020-08-22 22:14:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-08-22 22:14:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2020-08-22 22:14:13,211 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 51 [2020-08-22 22:14:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:13,211 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2020-08-22 22:14:13,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2020-08-22 22:14:13,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 22:14:13,214 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:13,214 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-08-22 22:14:13,215 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 22:14:13,215 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:13,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:13,216 INFO L82 PathProgramCache]: Analyzing trace with hash 802147488, now seen corresponding path program 1 times [2020-08-22 22:14:13,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:13,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [435212627] [2020-08-22 22:14:13,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:13,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [435212627] [2020-08-22 22:14:13,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:13,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:13,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654842681] [2020-08-22 22:14:13,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:13,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:13,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:13,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,255 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 3 states. [2020-08-22 22:14:13,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:13,296 INFO L93 Difference]: Finished difference Result 395 states and 516 transitions. [2020-08-22 22:14:13,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:13,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-08-22 22:14:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:13,299 INFO L225 Difference]: With dead ends: 395 [2020-08-22 22:14:13,300 INFO L226 Difference]: Without dead ends: 393 [2020-08-22 22:14:13,301 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-08-22 22:14:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-08-22 22:14:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 323. [2020-08-22 22:14:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-08-22 22:14:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2020-08-22 22:14:13,330 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 52 [2020-08-22 22:14:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:13,330 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2020-08-22 22:14:13,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2020-08-22 22:14:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 22:14:13,332 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:13,332 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-08-22 22:14:13,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 22:14:13,333 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:13,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:13,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1582250918, now seen corresponding path program 1 times [2020-08-22 22:14:13,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:13,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1738716567] [2020-08-22 22:14:13,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:13,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1738716567] [2020-08-22 22:14:13,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:13,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:13,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271076852] [2020-08-22 22:14:13,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:13,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:13,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,379 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand 3 states. [2020-08-22 22:14:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:13,454 INFO L93 Difference]: Finished difference Result 887 states and 1164 transitions. [2020-08-22 22:14:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:13,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-08-22 22:14:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:13,459 INFO L225 Difference]: With dead ends: 887 [2020-08-22 22:14:13,459 INFO L226 Difference]: Without dead ends: 593 [2020-08-22 22:14:13,462 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-08-22 22:14:13,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-08-22 22:14:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2020-08-22 22:14:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-08-22 22:14:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 758 transitions. [2020-08-22 22:14:13,520 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 758 transitions. Word has length 52 [2020-08-22 22:14:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:13,520 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 758 transitions. [2020-08-22 22:14:13,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 758 transitions. [2020-08-22 22:14:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-08-22 22:14:13,522 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:13,523 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-08-22 22:14:13,523 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 22:14:13,523 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash 436955529, now seen corresponding path program 1 times [2020-08-22 22:14:13,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:13,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1847786052] [2020-08-22 22:14:13,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:13,568 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1847786052] [2020-08-22 22:14:13,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:13,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:13,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432574027] [2020-08-22 22:14:13,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:13,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:13,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:13,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,571 INFO L87 Difference]: Start difference. First operand 591 states and 758 transitions. Second operand 3 states. [2020-08-22 22:14:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:13,652 INFO L93 Difference]: Finished difference Result 715 states and 912 transitions. [2020-08-22 22:14:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:13,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-08-22 22:14:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:13,659 INFO L225 Difference]: With dead ends: 715 [2020-08-22 22:14:13,659 INFO L226 Difference]: Without dead ends: 713 [2020-08-22 22:14:13,660 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-08-22 22:14:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-08-22 22:14:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 591. [2020-08-22 22:14:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-08-22 22:14:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 750 transitions. [2020-08-22 22:14:13,739 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 750 transitions. Word has length 53 [2020-08-22 22:14:13,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:13,740 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 750 transitions. [2020-08-22 22:14:13,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 750 transitions. [2020-08-22 22:14:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-08-22 22:14:13,742 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:13,742 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-08-22 22:14:13,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 22:14:13,743 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:13,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:13,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1804891768, now seen corresponding path program 1 times [2020-08-22 22:14:13,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:13,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [259030065] [2020-08-22 22:14:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:13,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [259030065] [2020-08-22 22:14:13,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:13,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:13,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73329744] [2020-08-22 22:14:13,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:13,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:13,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:13,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,791 INFO L87 Difference]: Start difference. First operand 591 states and 750 transitions. Second operand 3 states. [2020-08-22 22:14:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:13,910 INFO L93 Difference]: Finished difference Result 1667 states and 2128 transitions. [2020-08-22 22:14:13,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:13,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-08-22 22:14:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:13,919 INFO L225 Difference]: With dead ends: 1667 [2020-08-22 22:14:13,919 INFO L226 Difference]: Without dead ends: 1105 [2020-08-22 22:14:13,922 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-08-22 22:14:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2020-08-22 22:14:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1103. [2020-08-22 22:14:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-08-22 22:14:14,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1374 transitions. [2020-08-22 22:14:14,023 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1374 transitions. Word has length 53 [2020-08-22 22:14:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:14,023 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1374 transitions. [2020-08-22 22:14:14,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1374 transitions. [2020-08-22 22:14:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-08-22 22:14:14,025 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:14,026 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-08-22 22:14:14,026 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 22:14:14,026 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:14,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:14,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2000907060, now seen corresponding path program 1 times [2020-08-22 22:14:14,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:14,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [879794810] [2020-08-22 22:14:14,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:14,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:14,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [879794810] [2020-08-22 22:14:14,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:14,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:14,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195929887] [2020-08-22 22:14:14,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:14,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:14,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:14,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:14,111 INFO L87 Difference]: Start difference. First operand 1103 states and 1374 transitions. Second operand 3 states. [2020-08-22 22:14:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:14,249 INFO L93 Difference]: Finished difference Result 1315 states and 1616 transitions. [2020-08-22 22:14:14,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:14,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-08-22 22:14:14,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:14,258 INFO L225 Difference]: With dead ends: 1315 [2020-08-22 22:14:14,258 INFO L226 Difference]: Without dead ends: 1313 [2020-08-22 22:14:14,260 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-08-22 22:14:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2020-08-22 22:14:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1103. [2020-08-22 22:14:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-08-22 22:14:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1358 transitions. [2020-08-22 22:14:14,354 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1358 transitions. Word has length 54 [2020-08-22 22:14:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:14,355 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1358 transitions. [2020-08-22 22:14:14,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1358 transitions. [2020-08-22 22:14:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-08-22 22:14:14,357 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:14,358 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-08-22 22:14:14,358 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 22:14:14,358 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:14,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:14,359 INFO L82 PathProgramCache]: Analyzing trace with hash -116823154, now seen corresponding path program 1 times [2020-08-22 22:14:14,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:14,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [835861573] [2020-08-22 22:14:14,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:14,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:14,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [835861573] [2020-08-22 22:14:14,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:14,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:14,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448659801] [2020-08-22 22:14:14,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:14,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:14,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:14,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:14,400 INFO L87 Difference]: Start difference. First operand 1103 states and 1358 transitions. Second operand 3 states. [2020-08-22 22:14:14,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:14,572 INFO L93 Difference]: Finished difference Result 3153 states and 3887 transitions. [2020-08-22 22:14:14,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:14,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-08-22 22:14:14,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:14,578 INFO L225 Difference]: With dead ends: 3153 [2020-08-22 22:14:14,579 INFO L226 Difference]: Without dead ends: 1103 [2020-08-22 22:14:14,584 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-08-22 22:14:14,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-08-22 22:14:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2020-08-22 22:14:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-08-22 22:14:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1294 transitions. [2020-08-22 22:14:14,684 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1294 transitions. Word has length 54 [2020-08-22 22:14:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:14,684 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1294 transitions. [2020-08-22 22:14:14,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-08-22 22:14:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-22 22:14:14,686 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:14,686 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-08-22 22:14:14,686 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 22:14:14,687 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:14,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:14,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1056202659, now seen corresponding path program 1 times [2020-08-22 22:14:14,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:14,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1310121958] [2020-08-22 22:14:14,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:14,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:14,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1310121958] [2020-08-22 22:14:14,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:14,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:14,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228344746] [2020-08-22 22:14:14,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:14,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:14,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:14,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:14,739 INFO L87 Difference]: Start difference. First operand 1103 states and 1294 transitions. Second operand 3 states. [2020-08-22 22:14:14,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:14,811 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-08-22 22:14:14,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:14,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-08-22 22:14:14,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:14,813 INFO L225 Difference]: With dead ends: 1103 [2020-08-22 22:14:14,813 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 22:14:14,816 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-08-22 22:14:14,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 22:14:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 22:14:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 22:14:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 22:14:14,817 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-08-22 22:14:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:14,818 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 22:14:14,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 22:14:14,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 22:14:14,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 22:14:14,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 22:14:15,297 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 22:14:15,560 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 7 [2020-08-22 22:14:16,141 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 22:14:16,605 WARN L193 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-08-22 22:14:17,047 WARN L193 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-08-22 22:14:18,084 WARN L193 SmtUtils]: Spent 969.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 22:14:18,205 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 22:14:18,426 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 22:14:18,817 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-08-22 22:14:19,153 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-08-22 22:14:19,324 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-08-22 22:14:19,574 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-08-22 22:14:19,919 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-08-22 22:14:20,051 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 22:14:20,051 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 22:14:20,051 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 22:14:20,052 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 22:14:20,052 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 22:14:20,052 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 22:14:20,052 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-08-22 22:14:20,053 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 107) the Hoare annotation is: true [2020-08-22 22:14:20,053 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-08-22 22:14:20,054 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-08-22 22:14:20,054 INFO L271 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-08-22 22:14:20,054 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-08-22 22:14:20,054 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-08-22 22:14:20,054 INFO L271 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-08-22 22:14:20,054 INFO L271 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-08-22 22:14:20,057 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-08-22 22:14:20,057 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-08-22 22:14:20,058 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-08-22 22:14:20,058 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-08-22 22:14:20,058 INFO L271 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2020-08-22 22:14:20,058 INFO L271 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-08-22 22:14:20,058 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-08-22 22:14:20,059 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-08-22 22:14:20,059 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-08-22 22:14:20,059 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-08-22 22:14:20,059 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-08-22 22:14:20,059 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-08-22 22:14:20,060 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-08-22 22:14:20,060 INFO L271 CegarLoopResult]: At program point L46(lines 46 48) the Hoare annotation is: true [2020-08-22 22:14:20,060 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-08-22 22:14:20,060 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 107) the Hoare annotation is: true [2020-08-22 22:14:20,060 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-08-22 22:14:20,060 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-08-22 22:14:20,061 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2020-08-22 22:14:20,061 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-08-22 22:14:20,061 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2020-08-22 22:14:20,061 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-08-22 22:14:20,062 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-08-22 22:14:20,062 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-08-22 22:14:20,062 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-08-22 22:14:20,063 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-08-22 22:14:20,063 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-08-22 22:14:20,063 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-08-22 22:14:20,063 INFO L271 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2020-08-22 22:14:20,063 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-08-22 22:14:20,063 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-08-22 22:14:20,064 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-08-22 22:14:20,064 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-08-22 22:14:20,064 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: false [2020-08-22 22:14:20,064 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-08-22 22:14:20,065 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-08-22 22:14:20,065 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-08-22 22:14:20,065 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (= main_~lk6~0 1) [2020-08-22 22:14:20,065 INFO L264 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2020-08-22 22:14:20,065 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-08-22 22:14:20,065 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-08-22 22:14:20,066 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-08-22 22:14:20,066 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-08-22 22:14:20,066 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (= main_~lk6~0 1) [2020-08-22 22:14:20,067 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-08-22 22:14:20,067 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-08-22 22:14:20,068 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-08-22 22:14:20,068 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-08-22 22:14:20,068 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-08-22 22:14:20,068 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-08-22 22:14:20,068 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-08-22 22:14:20,068 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-08-22 22:14:20,068 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-08-22 22:14:20,069 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-08-22 22:14:20,069 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-08-22 22:14:20,069 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-08-22 22:14:20,069 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-08-22 22:14:20,070 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-08-22 22:14:20,071 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-08-22 22:14:20,071 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-08-22 22:14:20,071 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-08-22 22:14:20,071 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-08-22 22:14:20,071 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-08-22 22:14:20,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 10:14:20 BoogieIcfgContainer [2020-08-22 22:14:20,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 22:14:20,088 INFO L168 Benchmark]: Toolchain (without parser) took 9048.42 ms. Allocated memory was 138.9 MB in the beginning and 392.2 MB in the end (delta: 253.2 MB). Free memory was 102.7 MB in the beginning and 197.2 MB in the end (delta: -94.5 MB). Peak memory consumption was 224.9 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:20,089 INFO L168 Benchmark]: CDTParser took 0.96 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-08-22 22:14:20,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.15 ms. Allocated memory is still 138.9 MB. Free memory was 102.3 MB in the beginning and 92.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:20,090 INFO L168 Benchmark]: Boogie Preprocessor took 144.94 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 92.3 MB in the beginning and 179.4 MB in the end (delta: -87.1 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:20,091 INFO L168 Benchmark]: RCFGBuilder took 430.90 ms. Allocated memory is still 202.4 MB. Free memory was 179.4 MB in the beginning and 161.1 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:20,092 INFO L168 Benchmark]: TraceAbstraction took 8134.43 ms. Allocated memory was 202.4 MB in the beginning and 392.2 MB in the end (delta: 189.8 MB). Free memory was 160.1 MB in the beginning and 197.2 MB in the end (delta: -37.1 MB). Peak memory consumption was 218.8 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:20,096 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.96 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 333.15 ms. Allocated memory is still 138.9 MB. Free memory was 102.3 MB in the beginning and 92.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 144.94 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 92.3 MB in the beginning and 179.4 MB in the end (delta: -87.1 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 430.90 ms. Allocated memory is still 202.4 MB. Free memory was 179.4 MB in the beginning and 161.1 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8134.43 ms. Allocated memory was 202.4 MB in the beginning and 392.2 MB in the end (delta: 189.8 MB). Free memory was 160.1 MB in the beginning and 197.2 MB in the end (delta: -37.1 MB). Peak memory consumption was 218.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: 2.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.2s, 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, 1.0s HoareSimplificationTime, 78 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 612 ConstructedInterpolants, 0 QuantifiedInterpolants, 39212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...