/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_6.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:22:03,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:22:03,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:22:03,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:22:03,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:22:03,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:22:03,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:22:03,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:22:03,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:22:03,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:22:03,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:22:03,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:22:03,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:22:03,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:22:03,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:22:03,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:22:03,776 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:22:03,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:22:03,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:22:03,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:22:03,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:22:03,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:22:03,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:22:03,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:22:03,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:22:03,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:22:03,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:22:03,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:22:03,803 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:22:03,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:22:03,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:22:03,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:22:03,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:22:03,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:22:03,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:22:03,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:22:03,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:22:03,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:22:03,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:22:03,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:22:03,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:22:03,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-07 13:22:03,846 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:22:03,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:22:03,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:22:03,850 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:22:03,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:22:03,850 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:22:03,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:22:03,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:22:03,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:22:03,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:22:03,851 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:22:03,851 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:22:03,852 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:22:03,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:22:03,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:22:03,852 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:22:03,852 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:22:03,852 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:22:03,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:22:03,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:22:03,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:22:03,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:22:03,856 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:22:04,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:22:04,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:22:04,222 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:22:04,223 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:22:04,224 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:22:04,224 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-07-07 13:22:04,309 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc65ab81/d39606a0cacc4b7cbb590cd3b7113bab/FLAG9715d4af1 [2020-07-07 13:22:04,842 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:22:04,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2020-07-07 13:22:04,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc65ab81/d39606a0cacc4b7cbb590cd3b7113bab/FLAG9715d4af1 [2020-07-07 13:22:05,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bc65ab81/d39606a0cacc4b7cbb590cd3b7113bab [2020-07-07 13:22:05,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:22:05,181 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:22:05,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:22:05,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:22:05,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:22:05,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:22:05" (1/1) ... [2020-07-07 13:22:05,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4386dceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:05, skipping insertion in model container [2020-07-07 13:22:05,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:22:05" (1/1) ... [2020-07-07 13:22:05,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:22:05,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:22:05,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:22:05,450 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:22:05,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:22:05,493 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:22:05,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:05 WrapperNode [2020-07-07 13:22:05,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:22:05,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:22:05,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:22:05,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:22:05,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:05" (1/1) ... [2020-07-07 13:22:05,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:05" (1/1) ... [2020-07-07 13:22:05,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:05" (1/1) ... [2020-07-07 13:22:05,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:05" (1/1) ... [2020-07-07 13:22:05,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:05" (1/1) ... [2020-07-07 13:22:05,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:05" (1/1) ... [2020-07-07 13:22:05,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:05" (1/1) ... [2020-07-07 13:22:05,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:22:05,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:22:05,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:22:05,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:22:05,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:22:05,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:22:05,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:22:05,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:22:05,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:22:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:22:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:22:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:22:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:22:06,068 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:22:06,069 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-07 13:22:06,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:22:06 BoogieIcfgContainer [2020-07-07 13:22:06,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:22:06,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:22:06,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:22:06,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:22:06,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:22:05" (1/3) ... [2020-07-07 13:22:06,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769d0d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:22:06, skipping insertion in model container [2020-07-07 13:22:06,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:22:05" (2/3) ... [2020-07-07 13:22:06,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769d0d82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:22:06, skipping insertion in model container [2020-07-07 13:22:06,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:22:06" (3/3) ... [2020-07-07 13:22:06,083 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2020-07-07 13:22:06,095 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:22:06,104 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:22:06,119 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:22:06,143 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:22:06,143 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:22:06,144 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:22:06,144 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:22:06,144 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:22:06,144 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:22:06,145 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:22:06,145 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:22:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-07-07 13:22:06,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-07 13:22:06,176 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:06,178 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-07-07 13:22:06,178 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:06,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1400694048, now seen corresponding path program 1 times [2020-07-07 13:22:06,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:06,196 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1728468542] [2020-07-07 13:22:06,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:06,434 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:06,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1728468542] [2020-07-07 13:22:06,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:06,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:06,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333223563] [2020-07-07 13:22:06,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:06,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:06,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:06,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:06,472 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-07-07 13:22:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:06,563 INFO L93 Difference]: Finished difference Result 169 states and 229 transitions. [2020-07-07 13:22:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:06,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2020-07-07 13:22:06,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:06,580 INFO L225 Difference]: With dead ends: 169 [2020-07-07 13:22:06,581 INFO L226 Difference]: Without dead ends: 112 [2020-07-07 13:22:06,585 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-07-07 13:22:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-07 13:22:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-07-07 13:22:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-07 13:22:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2020-07-07 13:22:06,650 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 49 [2020-07-07 13:22:06,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:06,651 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2020-07-07 13:22:06,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:06,652 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2020-07-07 13:22:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-07 13:22:06,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:06,654 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-07-07 13:22:06,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:22:06,655 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:06,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:06,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1290717684, now seen corresponding path program 1 times [2020-07-07 13:22:06,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:06,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1437038891] [2020-07-07 13:22:06,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:06,740 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:06,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1437038891] [2020-07-07 13:22:06,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:06,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:06,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72143224] [2020-07-07 13:22:06,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:06,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:06,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:06,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:06,748 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 3 states. [2020-07-07 13:22:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:06,794 INFO L93 Difference]: Finished difference Result 135 states and 175 transitions. [2020-07-07 13:22:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:06,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-07 13:22:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:06,798 INFO L225 Difference]: With dead ends: 135 [2020-07-07 13:22:06,799 INFO L226 Difference]: Without dead ends: 133 [2020-07-07 13:22:06,800 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-07-07 13:22:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-07-07 13:22:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 110. [2020-07-07 13:22:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-07-07 13:22:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2020-07-07 13:22:06,825 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 50 [2020-07-07 13:22:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:06,826 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2020-07-07 13:22:06,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2020-07-07 13:22:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-07 13:22:06,828 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:06,828 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-07-07 13:22:06,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:22:06,829 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:06,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:06,829 INFO L82 PathProgramCache]: Analyzing trace with hash 472087846, now seen corresponding path program 1 times [2020-07-07 13:22:06,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:06,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265409434] [2020-07-07 13:22:06,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:06,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:06,916 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:06,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265409434] [2020-07-07 13:22:06,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:06,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:06,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106467727] [2020-07-07 13:22:06,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:06,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:06,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:06,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:06,922 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand 3 states. [2020-07-07 13:22:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:06,979 INFO L93 Difference]: Finished difference Result 266 states and 357 transitions. [2020-07-07 13:22:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:06,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-07 13:22:06,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:06,982 INFO L225 Difference]: With dead ends: 266 [2020-07-07 13:22:06,983 INFO L226 Difference]: Without dead ends: 185 [2020-07-07 13:22:06,984 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-07-07 13:22:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-07-07 13:22:07,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2020-07-07 13:22:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-07-07 13:22:07,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 240 transitions. [2020-07-07 13:22:07,020 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 240 transitions. Word has length 50 [2020-07-07 13:22:07,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:07,020 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 240 transitions. [2020-07-07 13:22:07,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 240 transitions. [2020-07-07 13:22:07,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-07 13:22:07,023 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:07,023 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-07-07 13:22:07,024 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:22:07,024 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:07,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:07,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1750067028, now seen corresponding path program 1 times [2020-07-07 13:22:07,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:07,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1667602227] [2020-07-07 13:22:07,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:07,090 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:07,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1667602227] [2020-07-07 13:22:07,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:07,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:07,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262683080] [2020-07-07 13:22:07,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:07,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:07,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:07,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:07,093 INFO L87 Difference]: Start difference. First operand 183 states and 240 transitions. Second operand 3 states. [2020-07-07 13:22:07,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:07,166 INFO L93 Difference]: Finished difference Result 479 states and 646 transitions. [2020-07-07 13:22:07,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:07,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-07 13:22:07,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:07,170 INFO L225 Difference]: With dead ends: 479 [2020-07-07 13:22:07,171 INFO L226 Difference]: Without dead ends: 325 [2020-07-07 13:22:07,172 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-07-07 13:22:07,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-07-07 13:22:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2020-07-07 13:22:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-07 13:22:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 426 transitions. [2020-07-07 13:22:07,230 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 426 transitions. Word has length 51 [2020-07-07 13:22:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:07,230 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 426 transitions. [2020-07-07 13:22:07,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 426 transitions. [2020-07-07 13:22:07,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-07 13:22:07,237 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:07,238 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-07-07 13:22:07,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:22:07,240 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:07,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:07,241 INFO L82 PathProgramCache]: Analyzing trace with hash -17356107, now seen corresponding path program 1 times [2020-07-07 13:22:07,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:07,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1544113515] [2020-07-07 13:22:07,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:07,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:07,319 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:07,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1544113515] [2020-07-07 13:22:07,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:07,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:07,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827520290] [2020-07-07 13:22:07,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:07,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:07,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:07,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:07,326 INFO L87 Difference]: Start difference. First operand 323 states and 426 transitions. Second operand 3 states. [2020-07-07 13:22:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:07,383 INFO L93 Difference]: Finished difference Result 399 states and 528 transitions. [2020-07-07 13:22:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:07,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-07-07 13:22:07,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:07,387 INFO L225 Difference]: With dead ends: 399 [2020-07-07 13:22:07,388 INFO L226 Difference]: Without dead ends: 397 [2020-07-07 13:22:07,388 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-07-07 13:22:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-07-07 13:22:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 323. [2020-07-07 13:22:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-07 13:22:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 422 transitions. [2020-07-07 13:22:07,429 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 422 transitions. Word has length 51 [2020-07-07 13:22:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:07,429 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 422 transitions. [2020-07-07 13:22:07,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 422 transitions. [2020-07-07 13:22:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-07 13:22:07,432 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:07,432 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-07-07 13:22:07,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:22:07,433 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:07,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:07,433 INFO L82 PathProgramCache]: Analyzing trace with hash 802147488, now seen corresponding path program 1 times [2020-07-07 13:22:07,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:07,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2146641028] [2020-07-07 13:22:07,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:07,479 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:07,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2146641028] [2020-07-07 13:22:07,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:07,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:07,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960561606] [2020-07-07 13:22:07,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:07,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:07,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:07,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:07,481 INFO L87 Difference]: Start difference. First operand 323 states and 422 transitions. Second operand 3 states. [2020-07-07 13:22:07,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:07,524 INFO L93 Difference]: Finished difference Result 395 states and 516 transitions. [2020-07-07 13:22:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:07,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-07 13:22:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:07,528 INFO L225 Difference]: With dead ends: 395 [2020-07-07 13:22:07,528 INFO L226 Difference]: Without dead ends: 393 [2020-07-07 13:22:07,529 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-07-07 13:22:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-07-07 13:22:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 323. [2020-07-07 13:22:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-07-07 13:22:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2020-07-07 13:22:07,568 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 52 [2020-07-07 13:22:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:07,570 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2020-07-07 13:22:07,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:07,571 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2020-07-07 13:22:07,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-07 13:22:07,583 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:07,585 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-07-07 13:22:07,586 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:22:07,586 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:07,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1582250918, now seen corresponding path program 1 times [2020-07-07 13:22:07,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:07,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1114104469] [2020-07-07 13:22:07,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:07,659 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:07,660 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1114104469] [2020-07-07 13:22:07,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:07,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:07,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053938520] [2020-07-07 13:22:07,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:07,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:07,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:07,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:07,663 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand 3 states. [2020-07-07 13:22:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:07,740 INFO L93 Difference]: Finished difference Result 887 states and 1164 transitions. [2020-07-07 13:22:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:07,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-07-07 13:22:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:07,744 INFO L225 Difference]: With dead ends: 887 [2020-07-07 13:22:07,744 INFO L226 Difference]: Without dead ends: 593 [2020-07-07 13:22:07,747 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-07-07 13:22:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-07-07 13:22:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2020-07-07 13:22:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-07 13:22:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 758 transitions. [2020-07-07 13:22:07,804 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 758 transitions. Word has length 52 [2020-07-07 13:22:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:07,805 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 758 transitions. [2020-07-07 13:22:07,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 758 transitions. [2020-07-07 13:22:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-07 13:22:07,807 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:07,808 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-07-07 13:22:07,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:22:07,808 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:07,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:07,809 INFO L82 PathProgramCache]: Analyzing trace with hash 436955529, now seen corresponding path program 1 times [2020-07-07 13:22:07,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:07,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1229343778] [2020-07-07 13:22:07,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:07,896 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:07,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1229343778] [2020-07-07 13:22:07,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:07,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:07,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865379357] [2020-07-07 13:22:07,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:07,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:07,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:07,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:07,899 INFO L87 Difference]: Start difference. First operand 591 states and 758 transitions. Second operand 3 states. [2020-07-07 13:22:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:07,980 INFO L93 Difference]: Finished difference Result 715 states and 912 transitions. [2020-07-07 13:22:07,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:07,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-07 13:22:07,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:07,986 INFO L225 Difference]: With dead ends: 715 [2020-07-07 13:22:07,986 INFO L226 Difference]: Without dead ends: 713 [2020-07-07 13:22:07,987 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-07-07 13:22:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2020-07-07 13:22:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 591. [2020-07-07 13:22:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2020-07-07 13:22:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 750 transitions. [2020-07-07 13:22:08,041 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 750 transitions. Word has length 53 [2020-07-07 13:22:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:08,042 INFO L479 AbstractCegarLoop]: Abstraction has 591 states and 750 transitions. [2020-07-07 13:22:08,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:08,042 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 750 transitions. [2020-07-07 13:22:08,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-07 13:22:08,043 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:08,044 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-07-07 13:22:08,044 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:22:08,044 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:08,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:08,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1804891768, now seen corresponding path program 1 times [2020-07-07 13:22:08,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:08,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1996453314] [2020-07-07 13:22:08,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:08,078 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:08,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1996453314] [2020-07-07 13:22:08,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:08,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:08,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932128051] [2020-07-07 13:22:08,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:08,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:08,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:08,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:08,081 INFO L87 Difference]: Start difference. First operand 591 states and 750 transitions. Second operand 3 states. [2020-07-07 13:22:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:08,190 INFO L93 Difference]: Finished difference Result 1667 states and 2128 transitions. [2020-07-07 13:22:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:08,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-07-07 13:22:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:08,197 INFO L225 Difference]: With dead ends: 1667 [2020-07-07 13:22:08,197 INFO L226 Difference]: Without dead ends: 1105 [2020-07-07 13:22:08,199 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-07-07 13:22:08,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2020-07-07 13:22:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1103. [2020-07-07 13:22:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-07 13:22:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1374 transitions. [2020-07-07 13:22:08,293 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1374 transitions. Word has length 53 [2020-07-07 13:22:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:08,293 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1374 transitions. [2020-07-07 13:22:08,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1374 transitions. [2020-07-07 13:22:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-07 13:22:08,296 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:08,296 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-07-07 13:22:08,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:22:08,296 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:08,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:08,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2000907060, now seen corresponding path program 1 times [2020-07-07 13:22:08,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:08,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1468953554] [2020-07-07 13:22:08,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:08,365 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:08,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1468953554] [2020-07-07 13:22:08,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:08,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:08,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845033458] [2020-07-07 13:22:08,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:08,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:08,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:08,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:08,368 INFO L87 Difference]: Start difference. First operand 1103 states and 1374 transitions. Second operand 3 states. [2020-07-07 13:22:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:08,491 INFO L93 Difference]: Finished difference Result 1315 states and 1616 transitions. [2020-07-07 13:22:08,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:08,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-07 13:22:08,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:08,499 INFO L225 Difference]: With dead ends: 1315 [2020-07-07 13:22:08,499 INFO L226 Difference]: Without dead ends: 1313 [2020-07-07 13:22:08,501 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-07-07 13:22:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2020-07-07 13:22:08,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1103. [2020-07-07 13:22:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-07 13:22:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1358 transitions. [2020-07-07 13:22:08,591 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1358 transitions. Word has length 54 [2020-07-07 13:22:08,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:08,592 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1358 transitions. [2020-07-07 13:22:08,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1358 transitions. [2020-07-07 13:22:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-07 13:22:08,594 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:08,594 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-07-07 13:22:08,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 13:22:08,594 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:08,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:08,595 INFO L82 PathProgramCache]: Analyzing trace with hash -116823154, now seen corresponding path program 1 times [2020-07-07 13:22:08,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:08,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1961084948] [2020-07-07 13:22:08,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:08,627 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:08,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1961084948] [2020-07-07 13:22:08,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:08,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:08,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750322926] [2020-07-07 13:22:08,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:08,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:08,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:08,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:08,630 INFO L87 Difference]: Start difference. First operand 1103 states and 1358 transitions. Second operand 3 states. [2020-07-07 13:22:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:08,821 INFO L93 Difference]: Finished difference Result 3153 states and 3887 transitions. [2020-07-07 13:22:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:08,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-07-07 13:22:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:08,828 INFO L225 Difference]: With dead ends: 3153 [2020-07-07 13:22:08,828 INFO L226 Difference]: Without dead ends: 1103 [2020-07-07 13:22:08,833 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-07-07 13:22:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-07-07 13:22:08,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2020-07-07 13:22:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2020-07-07 13:22:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1294 transitions. [2020-07-07 13:22:08,906 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1294 transitions. Word has length 54 [2020-07-07 13:22:08,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:08,907 INFO L479 AbstractCegarLoop]: Abstraction has 1103 states and 1294 transitions. [2020-07-07 13:22:08,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1294 transitions. [2020-07-07 13:22:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-07 13:22:08,909 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:22:08,909 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-07-07 13:22:08,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 13:22:08,909 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:22:08,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:22:08,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1056202659, now seen corresponding path program 1 times [2020-07-07 13:22:08,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:22:08,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1571323075] [2020-07-07 13:22:08,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:22:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:22:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:22:08,937 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:22:08,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1571323075] [2020-07-07 13:22:08,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:22:08,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 13:22:08,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125982405] [2020-07-07 13:22:08,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 13:22:08,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:22:08,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 13:22:08,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 13:22:08,940 INFO L87 Difference]: Start difference. First operand 1103 states and 1294 transitions. Second operand 3 states. [2020-07-07 13:22:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:22:09,017 INFO L93 Difference]: Finished difference Result 1103 states and 1294 transitions. [2020-07-07 13:22:09,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 13:22:09,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-07 13:22:09,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:22:09,018 INFO L225 Difference]: With dead ends: 1103 [2020-07-07 13:22:09,019 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 13:22:09,022 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-07-07 13:22:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 13:22:09,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 13:22:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 13:22:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 13:22:09,024 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2020-07-07 13:22:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:22:09,024 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 13:22:09,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 13:22:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 13:22:09,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 13:22:09,025 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 13:22:09,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 13:22:09,450 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-07 13:22:09,723 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 7 [2020-07-07 13:22:10,490 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-07 13:22:10,937 WARN L193 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-07 13:22:11,411 WARN L193 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-07 13:22:12,505 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 91 [2020-07-07 13:22:12,638 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-07 13:22:12,875 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-07 13:22:13,250 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-07 13:22:13,633 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-07 13:22:13,795 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-07 13:22:14,068 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-07 13:22:14,435 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-07 13:22:14,570 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:22:14,571 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:22:14,571 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:22:14,571 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-07 13:22:14,571 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 13:22:14,571 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:22:14,573 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk5~0))) (or (and (= 0 main_~p6~0) .cse0) (and (= 1 main_~lk6~0) .cse0))) [2020-07-07 13:22:14,573 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 107) the Hoare annotation is: true [2020-07-07 13:22:14,573 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-07 13:22:14,573 INFO L264 CegarLoopResult]: At program point L77-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= 0 main_~p3~0)) (.cse3 (= 1 main_~lk5~0)) (.cse1 (= 0 main_~p4~0)) (.cse6 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk6~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 0 main_~p5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse3 .cse5) (and .cse2 .cse6 .cse3 .cse5) (and .cse0 .cse4 .cse1 .cse3) (and .cse1 .cse2 .cse6 .cse3) (and .cse0 .cse2 .cse3 .cse5) (and .cse4 .cse1 .cse7 .cse6) (and .cse4 .cse1 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse7) (and .cse0 .cse4 .cse1 .cse7) (and .cse2 .cse7 .cse6 .cse5) (and .cse4 .cse7 .cse6 .cse5) (and .cse0 .cse4 .cse7 .cse5) (and .cse4 .cse6 .cse3 .cse5) (and .cse1 .cse2 .cse7 .cse6) (and .cse0 .cse2 .cse7 .cse5))) [2020-07-07 13:22:14,574 INFO L271 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-07-07 13:22:14,574 INFO L264 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk5~0))) (or (and (= 0 main_~p6~0) .cse0) (and (= 1 main_~lk6~0) .cse0))) [2020-07-07 13:22:14,574 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-07 13:22:14,574 INFO L271 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-07-07 13:22:14,574 INFO L271 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-07-07 13:22:14,575 INFO L264 CegarLoopResult]: At program point L78(line 78) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse5 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse8 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse7 .cse0 .cse8 .cse3 .cse6) (and .cse5 .cse7 .cse0 .cse8 .cse6) (and .cse5 .cse0 .cse8 .cse1 .cse2) (and .cse5 .cse7 .cse0 .cse6 .cse4) (and .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse3 .cse6) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse7 .cse0 .cse2 .cse4) (and .cse5 .cse0 .cse8 .cse1 .cse6) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3) (and .cse7 .cse0 .cse8 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse5 .cse7 .cse0 .cse8 .cse2))) [2020-07-07 13:22:14,575 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-07 13:22:14,575 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-07 13:22:14,575 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-07 13:22:14,575 INFO L271 CegarLoopResult]: At program point L103(lines 5 107) the Hoare annotation is: true [2020-07-07 13:22:14,575 INFO L271 CegarLoopResult]: At program point L29(lines 29 31) the Hoare annotation is: true [2020-07-07 13:22:14,576 INFO L264 CegarLoopResult]: At program point L62-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-07 13:22:14,576 INFO L264 CegarLoopResult]: At program point L87-1(lines 27 102) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk6~0)) (.cse3 (= 0 main_~p5~0)) (.cse0 (= 0 main_~p6~0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse3 .cse0))) [2020-07-07 13:22:14,576 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-07 13:22:14,577 INFO L264 CegarLoopResult]: At program point L54-1(lines 27 102) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-07 13:22:14,577 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-07 13:22:14,577 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-07 13:22:14,577 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse5 (= 1 main_~lk6~0)) (.cse7 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse8 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse7 .cse0 .cse8 .cse3 .cse6) (and .cse5 .cse7 .cse0 .cse8 .cse6) (and .cse5 .cse0 .cse8 .cse1 .cse2) (and .cse5 .cse7 .cse0 .cse6 .cse4) (and .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse3 .cse6) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse7 .cse0 .cse2 .cse4) (and .cse5 .cse0 .cse8 .cse1 .cse6) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse3) (and .cse7 .cse0 .cse8 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse5 .cse7 .cse0 .cse8 .cse2))) [2020-07-07 13:22:14,578 INFO L271 CegarLoopResult]: At program point L46(lines 46 48) the Hoare annotation is: true [2020-07-07 13:22:14,578 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-07 13:22:14,578 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 107) the Hoare annotation is: true [2020-07-07 13:22:14,578 INFO L264 CegarLoopResult]: At program point L46-2(lines 27 102) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-07 13:22:14,578 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-07 13:22:14,578 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2020-07-07 13:22:14,579 INFO L264 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse7 .cse6 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse1 .cse6 .cse3) (and .cse0 .cse5 .cse1 .cse6))) [2020-07-07 13:22:14,579 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2020-07-07 13:22:14,579 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse0 .cse2) (and .cse4 .cse3 .cse2))) [2020-07-07 13:22:14,579 INFO L264 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-07 13:22:14,579 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-07 13:22:14,580 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-07-07 13:22:14,580 INFO L264 CegarLoopResult]: At program point L72-1(lines 27 102) the Hoare annotation is: (let ((.cse3 (= 0 main_~p6~0)) (.cse9 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk4~0)) (.cse6 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk6~0)) (.cse8 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse5 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse2 .cse3) (and .cse7 .cse8 .cse0 .cse5 .cse9) (and .cse7 .cse8 .cse6 .cse9 .cse4) (and .cse8 .cse5 .cse6 .cse2 .cse3) (and .cse8 .cse6 .cse3 .cse9 .cse4) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse9 .cse4) (and .cse5 .cse6 .cse1 .cse3 .cse9) (and .cse7 .cse8 .cse6 .cse2 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse9) (and .cse7 .cse0 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse9) (and .cse8 .cse0 .cse3 .cse9 .cse4) (and .cse8 .cse0 .cse5 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2 .cse3) (and .cse7 .cse0 .cse1 .cse9 .cse4) (and .cse8 .cse0 .cse5 .cse3 .cse9) (and .cse6 .cse1 .cse3 .cse9 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse2) (and .cse7 .cse6 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse2 .cse3 .cse4) (and .cse7 .cse5 .cse6 .cse1 .cse9) (and .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse0 .cse2 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse9) (and .cse7 .cse6 .cse1 .cse9 .cse4) (and .cse0 .cse1 .cse3 .cse9 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse2) (and .cse7 .cse5 .cse6 .cse1 .cse2) (and .cse7 .cse8 .cse0 .cse5 .cse2))) [2020-07-07 13:22:14,580 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-07 13:22:14,580 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-07 13:22:14,580 INFO L271 CegarLoopResult]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2020-07-07 13:22:14,580 INFO L264 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (let ((.cse1 (= 0 main_~p6~0)) (.cse0 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse2 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse4 .cse0 .cse2) (and .cse4 .cse3 .cse2))) [2020-07-07 13:22:14,581 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-07 13:22:14,581 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-07 13:22:14,581 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-07 13:22:14,581 INFO L264 CegarLoopResult]: At program point L106(line 106) the Hoare annotation is: false [2020-07-07 13:22:14,581 INFO L264 CegarLoopResult]: At program point L73(line 73) the Hoare annotation is: (let ((.cse8 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p2~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse10 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse8 .cse2 .cse4) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse8 .cse4) (and .cse6 .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse3 .cse4) (and .cse9 .cse10 .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse1 .cse7 .cse8 .cse4 .cse5) (and .cse1 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse4) (and .cse10 .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse10 .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse10 .cse6 .cse8 .cse2 .cse4) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse0 .cse10 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse4) (and .cse9 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse3 .cse4) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse4))) [2020-07-07 13:22:14,582 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-07-07 13:22:14,582 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-07 13:22:14,582 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-07 13:22:14,582 INFO L264 CegarLoopResult]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2020-07-07 13:22:14,582 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-07-07 13:22:14,583 INFO L264 CegarLoopResult]: At program point L82-1(lines 27 102) the Hoare annotation is: (let ((.cse4 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse1 .cse3 .cse4) (and .cse0 .cse2 .cse5) (and .cse0 .cse1 .cse3))) [2020-07-07 13:22:14,583 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-07 13:22:14,583 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse8 (= 0 main_~p5~0)) (.cse9 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p2~0)) (.cse7 (= 1 main_~lk3~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse10 (= 1 main_~lk2~0)) (.cse6 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p6~0)) (.cse3 (= 1 main_~lk5~0)) (.cse4 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse8 .cse2 .cse4) (and .cse1 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse6 .cse1 .cse8 .cse4) (and .cse9 .cse0 .cse10 .cse6 .cse3 .cse4) (and .cse6 .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse9 .cse10 .cse7 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse6 .cse8 .cse4) (and .cse1 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse8 .cse4) (and .cse10 .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse10 .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse10 .cse6 .cse8 .cse2 .cse4) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse10 .cse6 .cse7 .cse3 .cse4) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse1 .cse7 .cse8 .cse4) (and .cse0 .cse10 .cse8 .cse2 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse3 .cse4 .cse5) (and .cse9 .cse0 .cse10 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse8 .cse2 .cse4) (and .cse9 .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse10 .cse7 .cse8 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse9 .cse0 .cse6 .cse1 .cse3 .cse4) (and .cse9 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse10 .cse6 .cse2 .cse3 .cse4))) [2020-07-07 13:22:14,583 INFO L264 CegarLoopResult]: At program point L99(line 99) the Hoare annotation is: (= 1 main_~lk6~0) [2020-07-07 13:22:14,584 INFO L264 CegarLoopResult]: At program point L66-1(lines 27 102) the Hoare annotation is: (let ((.cse2 (= 0 main_~p5~0)) (.cse11 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse9 (= 0 main_~p4~0)) (.cse8 (= 1 main_~lk1~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse3 (= 0 main_~p6~0)) (.cse4 (= 0 main_~p1~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse4 .cse7) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse4) (and .cse6 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse6 .cse7 .cse8 .cse5) (and .cse1 .cse9 .cse10 .cse3 .cse4 .cse7) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse7 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse6 .cse10 .cse2 .cse4 .cse5) (and .cse9 .cse6 .cse10 .cse3 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse4 .cse7 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse4 .cse7 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse2 .cse8) (and .cse9 .cse6 .cse10 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse4 .cse7) (and .cse11 .cse1 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse6 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse4) (and .cse11 .cse9 .cse6 .cse10 .cse2 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse7) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-07 13:22:14,584 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-07 13:22:14,585 INFO L264 CegarLoopResult]: At program point L58-1(lines 27 102) the Hoare annotation is: (let ((.cse7 (= 0 main_~p2~0)) (.cse4 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p1~0)) (.cse5 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse6 (= 1 main_~lk1~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6) (and .cse7 .cse1 .cse6 .cse3) (and .cse4 .cse0 .cse6 .cse3) (and .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse7 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse7 .cse6) (and .cse5 .cse7 .cse1 .cse2) (and .cse4 .cse0 .cse5 .cse2) (and .cse4 .cse5 .cse7 .cse2) (and .cse4 .cse7 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse5 .cse1 .cse2) (and .cse0 .cse5 .cse1 .cse6) (and .cse0 .cse1 .cse6 .cse3))) [2020-07-07 13:22:14,585 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse0 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse3))) [2020-07-07 13:22:14,585 INFO L264 CegarLoopResult]: At program point L50-1(lines 27 102) the Hoare annotation is: (let ((.cse0 (= 0 main_~p2~0)) (.cse1 (= 0 main_~p1~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and .cse3 .cse1) (and .cse3 .cse2))) [2020-07-07 13:22:14,585 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-07 13:22:14,585 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-07 13:22:14,585 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-07 13:22:14,585 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-07 13:22:14,586 INFO L264 CegarLoopResult]: At program point L67(line 67) the Hoare annotation is: (let ((.cse1 (= 0 main_~p4~0)) (.cse0 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p3~0)) (.cse9 (= 0 main_~p1~0)) (.cse7 (= 0 main_~p2~0)) (.cse2 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse4 (= 1 main_~lk1~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse4) (and .cse5 .cse7 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse9 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse1 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse9 .cse3 .cse8) (and .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse9 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse8) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse9 .cse3 .cse8) (and .cse5 .cse7 .cse6 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse5 .cse1 .cse7 .cse6 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse8) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse9 .cse3) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse7 .cse2 .cse6 .cse9) (and .cse7 .cse2 .cse6 .cse9 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse6 .cse4 .cse8) (and .cse5 .cse1 .cse7 .cse9 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse0 .cse2 .cse9 .cse3 .cse8) (and .cse5 .cse0 .cse6 .cse9 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse4) (and .cse5 .cse1 .cse7 .cse6 .cse9) (and .cse5 .cse0 .cse3 .cse4 .cse8) (and .cse5 .cse7 .cse6 .cse9 .cse8) (and .cse7 .cse2 .cse6 .cse4 .cse8))) [2020-07-07 13:22:14,586 INFO L271 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-07-07 13:22:14,586 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (let ((.cse5 (= 0 main_~p1~0)) (.cse3 (= 0 main_~p3~0)) (.cse0 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p2~0)) (.cse1 (= 1 main_~lk3~0)) (.cse2 (= 1 main_~lk1~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse4 .cse1 .cse5) (and .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse5) (and .cse3 .cse0 .cse5) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-07 13:22:14,586 INFO L264 CegarLoopResult]: At program point L92-1(lines 27 102) the Hoare annotation is: (or (= 1 main_~lk6~0) (= 0 main_~p6~0)) [2020-07-07 13:22:14,587 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (let ((.cse2 (= 1 main_~lk5~0)) (.cse5 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p6~0)) (.cse4 (= 1 main_~lk6~0)) (.cse0 (= 1 main_~lk3~0)) (.cse6 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse2) (and .cse5 .cse0 .cse1 .cse2) (and .cse4 .cse0 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse0 .cse6 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse3))) [2020-07-07 13:22:14,587 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-07 13:22:14,587 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-07 13:22:14,587 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-07 13:22:14,587 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-07 13:22:14,587 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-07 13:22:14,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:22:14 BoogieIcfgContainer [2020-07-07 13:22:14,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:22:14,604 INFO L168 Benchmark]: Toolchain (without parser) took 9422.68 ms. Allocated memory was 147.3 MB in the beginning and 342.9 MB in the end (delta: 195.6 MB). Free memory was 105.9 MB in the beginning and 139.2 MB in the end (delta: -33.3 MB). Peak memory consumption was 204.8 MB. Max. memory is 7.1 GB. [2020-07-07 13:22:14,605 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 147.3 MB. Free memory was 123.9 MB in the beginning and 123.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-07 13:22:14,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.49 ms. Allocated memory is still 147.3 MB. Free memory was 105.7 MB in the beginning and 95.2 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-07 13:22:14,606 INFO L168 Benchmark]: Boogie Preprocessor took 129.77 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 95.2 MB in the beginning and 183.4 MB in the end (delta: -88.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-07 13:22:14,607 INFO L168 Benchmark]: RCFGBuilder took 449.76 ms. Allocated memory is still 205.0 MB. Free memory was 183.4 MB in the beginning and 164.4 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2020-07-07 13:22:14,608 INFO L168 Benchmark]: TraceAbstraction took 8526.36 ms. Allocated memory was 205.0 MB in the beginning and 342.9 MB in the end (delta: 137.9 MB). Free memory was 163.8 MB in the beginning and 139.2 MB in the end (delta: 24.6 MB). Peak memory consumption was 205.0 MB. Max. memory is 7.1 GB. [2020-07-07 13:22:14,611 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.19 ms. Allocated memory is still 147.3 MB. Free memory was 123.9 MB in the beginning and 123.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 311.49 ms. Allocated memory is still 147.3 MB. Free memory was 105.7 MB in the beginning and 95.2 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.77 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 95.2 MB in the beginning and 183.4 MB in the end (delta: -88.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 449.76 ms. Allocated memory is still 205.0 MB. Free memory was 183.4 MB in the beginning and 164.4 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8526.36 ms. Allocated memory was 205.0 MB in the beginning and 342.9 MB in the end (delta: 137.9 MB). Free memory was 163.8 MB in the beginning and 139.2 MB in the end (delta: 24.6 MB). Peak memory consumption was 205.0 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.5s, 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.2s HoareSimplificationTime, 78 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...