/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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 13:18:44,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 13:18:44,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 13:18:44,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 13:18:44,680 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 13:18:44,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 13:18:44,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 13:18:44,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 13:18:44,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 13:18:44,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 13:18:44,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 13:18:44,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 13:18:44,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 13:18:44,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 13:18:44,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 13:18:44,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 13:18:44,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 13:18:44,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 13:18:44,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 13:18:44,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 13:18:44,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 13:18:44,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 13:18:44,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 13:18:44,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 13:18:44,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 13:18:44,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 13:18:44,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 13:18:44,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 13:18:44,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 13:18:44,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 13:18:44,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 13:18:44,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 13:18:44,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 13:18:44,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 13:18:44,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 13:18:44,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 13:18:44,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 13:18:44,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 13:18:44,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 13:18:44,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 13:18:44,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 13:18:44,760 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 13:18:44,772 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 13:18:44,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 13:18:44,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 13:18:44,776 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 13:18:44,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 13:18:44,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 13:18:44,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 13:18:44,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 13:18:44,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 13:18:44,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 13:18:44,778 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 13:18:44,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 13:18:44,779 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 13:18:44,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 13:18:44,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 13:18:44,780 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 13:18:44,780 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 13:18:44,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 13:18:44,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 13:18:44,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 13:18:44,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 13:18:44,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 13:18:44,781 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-17 13:18:45,053 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 13:18:45,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 13:18:45,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 13:18:45,073 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 13:18:45,074 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 13:18:45,075 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2020-07-17 13:18:45,143 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ea09346e/9b4a2e938581474f9aca6d42a3fff78b/FLAG8aaa01fe8 [2020-07-17 13:18:45,654 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 13:18:45,655 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2020-07-17 13:18:45,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ea09346e/9b4a2e938581474f9aca6d42a3fff78b/FLAG8aaa01fe8 [2020-07-17 13:18:46,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ea09346e/9b4a2e938581474f9aca6d42a3fff78b [2020-07-17 13:18:46,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 13:18:46,031 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 13:18:46,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 13:18:46,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 13:18:46,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 13:18:46,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 01:18:46" (1/1) ... [2020-07-17 13:18:46,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505f8ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:46, skipping insertion in model container [2020-07-17 13:18:46,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 01:18:46" (1/1) ... [2020-07-17 13:18:46,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 13:18:46,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 13:18:46,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 13:18:46,267 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 13:18:46,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 13:18:46,309 INFO L208 MainTranslator]: Completed translation [2020-07-17 13:18:46,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:46 WrapperNode [2020-07-17 13:18:46,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 13:18:46,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 13:18:46,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 13:18:46,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 13:18:46,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:46" (1/1) ... [2020-07-17 13:18:46,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:46" (1/1) ... [2020-07-17 13:18:46,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:46" (1/1) ... [2020-07-17 13:18:46,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:46" (1/1) ... [2020-07-17 13:18:46,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:46" (1/1) ... [2020-07-17 13:18:46,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:46" (1/1) ... [2020-07-17 13:18:46,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:46" (1/1) ... [2020-07-17 13:18:46,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 13:18:46,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 13:18:46,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 13:18:46,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 13:18:46,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:46" (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-17 13:18:46,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 13:18:46,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 13:18:46,534 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 13:18:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 13:18:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 13:18:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 13:18:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 13:18:46,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 13:18:46,888 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 13:18:46,888 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 13:18:46,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 01:18:46 BoogieIcfgContainer [2020-07-17 13:18:46,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 13:18:46,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 13:18:46,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 13:18:46,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 13:18:46,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 01:18:46" (1/3) ... [2020-07-17 13:18:46,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30585c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 01:18:46, skipping insertion in model container [2020-07-17 13:18:46,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:18:46" (2/3) ... [2020-07-17 13:18:46,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30585c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 01:18:46, skipping insertion in model container [2020-07-17 13:18:46,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 01:18:46" (3/3) ... [2020-07-17 13:18:46,904 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-07-17 13:18:46,917 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 13:18:46,927 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 13:18:46,949 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 13:18:46,982 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 13:18:46,983 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 13:18:46,983 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-17 13:18:46,983 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 13:18:46,983 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 13:18:46,983 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 13:18:46,984 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 13:18:46,984 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 13:18:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-07-17 13:18:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-17 13:18:47,014 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:47,015 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-17 13:18:47,016 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:47,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:47,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1826051656, now seen corresponding path program 1 times [2020-07-17 13:18:47,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:47,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [448552846] [2020-07-17 13:18:47,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:47,257 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-17 13:18:47,260 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:47,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [448552846] [2020-07-17 13:18:47,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:47,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:47,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068675481] [2020-07-17 13:18:47,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:47,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:47,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:47,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:47,293 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2020-07-17 13:18:47,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:47,406 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2020-07-17 13:18:47,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:47,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-07-17 13:18:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:47,424 INFO L225 Difference]: With dead ends: 191 [2020-07-17 13:18:47,424 INFO L226 Difference]: Without dead ends: 128 [2020-07-17 13:18:47,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-17 13:18:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-17 13:18:47,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2020-07-17 13:18:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-17 13:18:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2020-07-17 13:18:47,499 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 55 [2020-07-17 13:18:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:47,500 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2020-07-17 13:18:47,501 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2020-07-17 13:18:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-17 13:18:47,503 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:47,504 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, 1] [2020-07-17 13:18:47,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 13:18:47,504 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:47,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:47,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1965492109, now seen corresponding path program 1 times [2020-07-17 13:18:47,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:47,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [463388916] [2020-07-17 13:18:47,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:47,600 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-17 13:18:47,601 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:47,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [463388916] [2020-07-17 13:18:47,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:47,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:47,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489723203] [2020-07-17 13:18:47,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:47,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:47,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:47,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:47,605 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 3 states. [2020-07-17 13:18:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:47,651 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2020-07-17 13:18:47,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:47,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-17 13:18:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:47,655 INFO L225 Difference]: With dead ends: 154 [2020-07-17 13:18:47,655 INFO L226 Difference]: Without dead ends: 152 [2020-07-17 13:18:47,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-17 13:18:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-07-17 13:18:47,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2020-07-17 13:18:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-07-17 13:18:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2020-07-17 13:18:47,686 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 56 [2020-07-17 13:18:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:47,686 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2020-07-17 13:18:47,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2020-07-17 13:18:47,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-17 13:18:47,689 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:47,689 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, 1] [2020-07-17 13:18:47,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 13:18:47,690 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:47,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:47,690 INFO L82 PathProgramCache]: Analyzing trace with hash 773271458, now seen corresponding path program 1 times [2020-07-17 13:18:47,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:47,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1992894757] [2020-07-17 13:18:47,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:47,758 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-17 13:18:47,759 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:47,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1992894757] [2020-07-17 13:18:47,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:47,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:47,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358029341] [2020-07-17 13:18:47,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:47,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:47,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:47,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:47,762 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 3 states. [2020-07-17 13:18:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:47,829 INFO L93 Difference]: Finished difference Result 306 states and 415 transitions. [2020-07-17 13:18:47,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:47,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-07-17 13:18:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:47,833 INFO L225 Difference]: With dead ends: 306 [2020-07-17 13:18:47,833 INFO L226 Difference]: Without dead ends: 213 [2020-07-17 13:18:47,834 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-17 13:18:47,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-07-17 13:18:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2020-07-17 13:18:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-17 13:18:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2020-07-17 13:18:47,891 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 56 [2020-07-17 13:18:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:47,892 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2020-07-17 13:18:47,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2020-07-17 13:18:47,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-17 13:18:47,895 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:47,895 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, 1, 1] [2020-07-17 13:18:47,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 13:18:47,896 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:47,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash -610540190, now seen corresponding path program 1 times [2020-07-17 13:18:47,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:47,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [894771186] [2020-07-17 13:18:47,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:47,967 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-17 13:18:47,968 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:47,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [894771186] [2020-07-17 13:18:47,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:47,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:47,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094949677] [2020-07-17 13:18:47,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:47,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:47,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:47,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:47,970 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand 3 states. [2020-07-17 13:18:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:48,006 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2020-07-17 13:18:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:48,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-17 13:18:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:48,010 INFO L225 Difference]: With dead ends: 259 [2020-07-17 13:18:48,010 INFO L226 Difference]: Without dead ends: 257 [2020-07-17 13:18:48,011 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-17 13:18:48,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-07-17 13:18:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 211. [2020-07-17 13:18:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-07-17 13:18:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2020-07-17 13:18:48,038 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 57 [2020-07-17 13:18:48,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:48,039 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2020-07-17 13:18:48,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:48,039 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2020-07-17 13:18:48,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-17 13:18:48,041 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:48,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:48,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 13:18:48,041 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:48,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:48,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1798143236, now seen corresponding path program 1 times [2020-07-17 13:18:48,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:48,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [154836358] [2020-07-17 13:18:48,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:48,102 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-17 13:18:48,103 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:48,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [154836358] [2020-07-17 13:18:48,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:48,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:48,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660900921] [2020-07-17 13:18:48,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:48,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:48,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:48,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:48,108 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand 3 states. [2020-07-17 13:18:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:48,155 INFO L93 Difference]: Finished difference Result 555 states and 752 transitions. [2020-07-17 13:18:48,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:48,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-07-17 13:18:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:48,160 INFO L225 Difference]: With dead ends: 555 [2020-07-17 13:18:48,161 INFO L226 Difference]: Without dead ends: 377 [2020-07-17 13:18:48,166 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-17 13:18:48,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-07-17 13:18:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2020-07-17 13:18:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-17 13:18:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 498 transitions. [2020-07-17 13:18:48,233 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 498 transitions. Word has length 57 [2020-07-17 13:18:48,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:48,237 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 498 transitions. [2020-07-17 13:18:48,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 498 transitions. [2020-07-17 13:18:48,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-17 13:18:48,244 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:48,245 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, 1, 1, 1] [2020-07-17 13:18:48,245 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 13:18:48,248 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:48,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:48,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1136837537, now seen corresponding path program 1 times [2020-07-17 13:18:48,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:48,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1292541866] [2020-07-17 13:18:48,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:48,323 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-17 13:18:48,324 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:48,324 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1292541866] [2020-07-17 13:18:48,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:48,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:48,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494792298] [2020-07-17 13:18:48,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:48,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:48,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:48,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:48,326 INFO L87 Difference]: Start difference. First operand 375 states and 498 transitions. Second operand 3 states. [2020-07-17 13:18:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:48,367 INFO L93 Difference]: Finished difference Result 459 states and 612 transitions. [2020-07-17 13:18:48,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:48,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-17 13:18:48,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:48,371 INFO L225 Difference]: With dead ends: 459 [2020-07-17 13:18:48,371 INFO L226 Difference]: Without dead ends: 457 [2020-07-17 13:18:48,372 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-17 13:18:48,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2020-07-17 13:18:48,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 375. [2020-07-17 13:18:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-07-17 13:18:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 494 transitions. [2020-07-17 13:18:48,405 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 494 transitions. Word has length 58 [2020-07-17 13:18:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:48,406 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 494 transitions. [2020-07-17 13:18:48,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 494 transitions. [2020-07-17 13:18:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-17 13:18:48,407 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:48,408 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, 1, 1, 1] [2020-07-17 13:18:48,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 13:18:48,408 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:48,409 INFO L82 PathProgramCache]: Analyzing trace with hash 92380246, now seen corresponding path program 1 times [2020-07-17 13:18:48,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:48,409 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1308168808] [2020-07-17 13:18:48,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:48,469 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-17 13:18:48,469 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:48,470 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1308168808] [2020-07-17 13:18:48,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:48,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:48,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28283031] [2020-07-17 13:18:48,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:48,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:48,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:48,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:48,472 INFO L87 Difference]: Start difference. First operand 375 states and 494 transitions. Second operand 3 states. [2020-07-17 13:18:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:48,548 INFO L93 Difference]: Finished difference Result 1035 states and 1384 transitions. [2020-07-17 13:18:48,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:48,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-07-17 13:18:48,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:48,554 INFO L225 Difference]: With dead ends: 1035 [2020-07-17 13:18:48,554 INFO L226 Difference]: Without dead ends: 693 [2020-07-17 13:18:48,557 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-17 13:18:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-07-17 13:18:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2020-07-17 13:18:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-07-17 13:18:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 906 transitions. [2020-07-17 13:18:48,624 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 906 transitions. Word has length 58 [2020-07-17 13:18:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:48,625 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 906 transitions. [2020-07-17 13:18:48,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 906 transitions. [2020-07-17 13:18:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-17 13:18:48,627 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:48,627 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, 1, 1, 1, 1] [2020-07-17 13:18:48,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 13:18:48,628 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:48,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:48,628 INFO L82 PathProgramCache]: Analyzing trace with hash -529027402, now seen corresponding path program 1 times [2020-07-17 13:18:48,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:48,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1694036126] [2020-07-17 13:18:48,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:48,723 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-17 13:18:48,723 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:48,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1694036126] [2020-07-17 13:18:48,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:48,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:48,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113442756] [2020-07-17 13:18:48,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:48,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:48,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:48,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:48,725 INFO L87 Difference]: Start difference. First operand 691 states and 906 transitions. Second operand 3 states. [2020-07-17 13:18:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:48,793 INFO L93 Difference]: Finished difference Result 839 states and 1100 transitions. [2020-07-17 13:18:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:48,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-17 13:18:48,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:48,798 INFO L225 Difference]: With dead ends: 839 [2020-07-17 13:18:48,799 INFO L226 Difference]: Without dead ends: 837 [2020-07-17 13:18:48,800 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-17 13:18:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2020-07-17 13:18:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 691. [2020-07-17 13:18:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-07-17 13:18:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 898 transitions. [2020-07-17 13:18:48,854 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 898 transitions. Word has length 59 [2020-07-17 13:18:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:48,855 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 898 transitions. [2020-07-17 13:18:48,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 898 transitions. [2020-07-17 13:18:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-17 13:18:48,856 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:48,857 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, 1, 1, 1, 1] [2020-07-17 13:18:48,857 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 13:18:48,857 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:48,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:48,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1430933584, now seen corresponding path program 1 times [2020-07-17 13:18:48,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:48,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [501639722] [2020-07-17 13:18:48,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:48,924 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-17 13:18:48,927 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:48,927 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [501639722] [2020-07-17 13:18:48,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:48,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:48,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108566276] [2020-07-17 13:18:48,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:48,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:48,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:48,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:48,929 INFO L87 Difference]: Start difference. First operand 691 states and 898 transitions. Second operand 3 states. [2020-07-17 13:18:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:49,040 INFO L93 Difference]: Finished difference Result 1959 states and 2564 transitions. [2020-07-17 13:18:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:49,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-07-17 13:18:49,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:49,048 INFO L225 Difference]: With dead ends: 1959 [2020-07-17 13:18:49,049 INFO L226 Difference]: Without dead ends: 1301 [2020-07-17 13:18:49,051 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-17 13:18:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2020-07-17 13:18:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1299. [2020-07-17 13:18:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-07-17 13:18:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1666 transitions. [2020-07-17 13:18:49,173 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1666 transitions. Word has length 59 [2020-07-17 13:18:49,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:49,174 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1666 transitions. [2020-07-17 13:18:49,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1666 transitions. [2020-07-17 13:18:49,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-17 13:18:49,176 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:49,176 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, 1, 1, 1, 1, 1] [2020-07-17 13:18:49,177 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 13:18:49,177 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:49,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:49,177 INFO L82 PathProgramCache]: Analyzing trace with hash -631232587, now seen corresponding path program 1 times [2020-07-17 13:18:49,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:49,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [471282617] [2020-07-17 13:18:49,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:49,222 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-17 13:18:49,222 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:49,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [471282617] [2020-07-17 13:18:49,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:49,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:49,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283964374] [2020-07-17 13:18:49,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:49,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:49,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:49,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:49,226 INFO L87 Difference]: Start difference. First operand 1299 states and 1666 transitions. Second operand 3 states. [2020-07-17 13:18:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:49,333 INFO L93 Difference]: Finished difference Result 1559 states and 1988 transitions. [2020-07-17 13:18:49,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:49,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-17 13:18:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:49,343 INFO L225 Difference]: With dead ends: 1559 [2020-07-17 13:18:49,343 INFO L226 Difference]: Without dead ends: 1557 [2020-07-17 13:18:49,344 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-17 13:18:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2020-07-17 13:18:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1299. [2020-07-17 13:18:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-07-17 13:18:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1650 transitions. [2020-07-17 13:18:49,450 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1650 transitions. Word has length 60 [2020-07-17 13:18:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:49,451 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1650 transitions. [2020-07-17 13:18:49,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1650 transitions. [2020-07-17 13:18:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-17 13:18:49,453 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:49,453 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, 1, 1, 1, 1, 1] [2020-07-17 13:18:49,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 13:18:49,453 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:49,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:49,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1409021686, now seen corresponding path program 1 times [2020-07-17 13:18:49,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:49,454 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [251043487] [2020-07-17 13:18:49,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:49,485 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-17 13:18:49,485 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:49,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [251043487] [2020-07-17 13:18:49,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:49,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:49,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002378925] [2020-07-17 13:18:49,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:49,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:49,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:49,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:49,488 INFO L87 Difference]: Start difference. First operand 1299 states and 1650 transitions. Second operand 3 states. [2020-07-17 13:18:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:49,716 INFO L93 Difference]: Finished difference Result 3735 states and 4756 transitions. [2020-07-17 13:18:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:49,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-07-17 13:18:49,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:49,729 INFO L225 Difference]: With dead ends: 3735 [2020-07-17 13:18:49,730 INFO L226 Difference]: Without dead ends: 2469 [2020-07-17 13:18:49,734 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-17 13:18:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2020-07-17 13:18:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2467. [2020-07-17 13:18:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-07-17 13:18:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3074 transitions. [2020-07-17 13:18:49,922 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3074 transitions. Word has length 60 [2020-07-17 13:18:49,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:49,923 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 3074 transitions. [2020-07-17 13:18:49,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:49,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3074 transitions. [2020-07-17 13:18:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-17 13:18:49,926 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:49,926 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, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:49,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 13:18:49,927 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:49,927 INFO L82 PathProgramCache]: Analyzing trace with hash -729752476, now seen corresponding path program 1 times [2020-07-17 13:18:49,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:49,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [409871326] [2020-07-17 13:18:49,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:49,960 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-17 13:18:49,961 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:49,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [409871326] [2020-07-17 13:18:49,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:49,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:49,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052313154] [2020-07-17 13:18:49,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:49,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:49,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:49,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:49,964 INFO L87 Difference]: Start difference. First operand 2467 states and 3074 transitions. Second operand 3 states. [2020-07-17 13:18:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:50,311 INFO L93 Difference]: Finished difference Result 7143 states and 8900 transitions. [2020-07-17 13:18:50,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:50,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-17 13:18:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:50,331 INFO L225 Difference]: With dead ends: 7143 [2020-07-17 13:18:50,331 INFO L226 Difference]: Without dead ends: 3637 [2020-07-17 13:18:50,341 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-17 13:18:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2020-07-17 13:18:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2020-07-17 13:18:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2020-07-17 13:18:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 4370 transitions. [2020-07-17 13:18:50,615 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 4370 transitions. Word has length 61 [2020-07-17 13:18:50,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:50,615 INFO L479 AbstractCegarLoop]: Abstraction has 3635 states and 4370 transitions. [2020-07-17 13:18:50,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 4370 transitions. [2020-07-17 13:18:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-17 13:18:50,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:50,619 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, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:50,619 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 13:18:50,620 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:50,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:50,620 INFO L82 PathProgramCache]: Analyzing trace with hash 495374346, now seen corresponding path program 1 times [2020-07-17 13:18:50,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:50,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1454398108] [2020-07-17 13:18:50,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:50,657 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-17 13:18:50,658 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:50,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1454398108] [2020-07-17 13:18:50,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:50,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:50,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863031883] [2020-07-17 13:18:50,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:50,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:50,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:50,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:50,665 INFO L87 Difference]: Start difference. First operand 3635 states and 4370 transitions. Second operand 3 states. [2020-07-17 13:18:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:50,924 INFO L93 Difference]: Finished difference Result 4087 states and 4852 transitions. [2020-07-17 13:18:50,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:50,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-07-17 13:18:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:50,939 INFO L225 Difference]: With dead ends: 4087 [2020-07-17 13:18:50,939 INFO L226 Difference]: Without dead ends: 2917 [2020-07-17 13:18:50,943 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-17 13:18:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-07-17 13:18:51,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2467. [2020-07-17 13:18:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-07-17 13:18:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 2914 transitions. [2020-07-17 13:18:51,093 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 2914 transitions. Word has length 61 [2020-07-17 13:18:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:51,094 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 2914 transitions. [2020-07-17 13:18:51,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2914 transitions. [2020-07-17 13:18:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-17 13:18:51,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:18:51,097 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:18:51,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 13:18:51,097 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:18:51,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:18:51,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1060451273, now seen corresponding path program 1 times [2020-07-17 13:18:51,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:18:51,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1282466933] [2020-07-17 13:18:51,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:18:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:18:51,119 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-17 13:18:51,121 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:18:51,122 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1282466933] [2020-07-17 13:18:51,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:18:51,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 13:18:51,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617207037] [2020-07-17 13:18:51,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 13:18:51,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:18:51,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 13:18:51,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:51,123 INFO L87 Difference]: Start difference. First operand 2467 states and 2914 transitions. Second operand 3 states. [2020-07-17 13:18:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:18:51,253 INFO L93 Difference]: Finished difference Result 2467 states and 2914 transitions. [2020-07-17 13:18:51,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 13:18:51,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-07-17 13:18:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:18:51,255 INFO L225 Difference]: With dead ends: 2467 [2020-07-17 13:18:51,255 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 13:18:51,260 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 13:18:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 13:18:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 13:18:51,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 13:18:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 13:18:51,261 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2020-07-17 13:18:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:18:51,261 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 13:18:51,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 13:18:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 13:18:51,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 13:18:51,262 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-17 13:18:51,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 13:18:51,420 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-17 13:18:51,990 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 7 [2020-07-17 13:18:52,403 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 91 [2020-07-17 13:18:52,728 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 23 [2020-07-17 13:18:52,833 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 11 [2020-07-17 13:18:52,981 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 55 [2020-07-17 13:18:53,171 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 91 [2020-07-17 13:18:53,544 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-07-17 13:18:55,113 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 91 [2020-07-17 13:18:55,552 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-17 13:18:55,756 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-17 13:18:56,222 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-17 13:18:57,220 WARN L193 SmtUtils]: Spent 936.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-17 13:18:57,392 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-17 13:18:57,552 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-17 13:18:57,939 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-17 13:18:58,829 WARN L193 SmtUtils]: Spent 877.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-17 13:18:59,926 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-17 13:19:00,082 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-17 13:19:02,660 WARN L193 SmtUtils]: Spent 2.57 s on a formula simplification that was a NOOP. DAG size: 159 [2020-07-17 13:19:02,993 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-17 13:19:03,266 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-17 13:19:03,590 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-17 13:19:04,623 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 93 [2020-07-17 13:19:04,632 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 13:19:04,632 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-17 13:19:04,632 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-17 13:19:04,632 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 13:19:04,633 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 13:19:04,633 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-17 13:19:04,633 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p7~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse2 .cse7) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse2 .cse4 .cse7 .cse8) (and .cse5 .cse0 .cse2 .cse7 .cse8) (and .cse5 .cse6 .cse2 .cse3 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse0 .cse1 .cse2 .cse3) (and .cse6 .cse1 .cse2 .cse4 .cse7) (and .cse5 .cse6 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse2 .cse4 .cse7 .cse8) (and .cse5 .cse0 .cse1 .cse2 .cse7) (and .cse6 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse6 .cse2 .cse7 .cse8))) [2020-07-17 13:19:04,634 INFO L264 CegarLoopResult]: At program point L60(line 60) 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-17 13:19:04,634 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 121) the Hoare annotation is: true [2020-07-17 13:19:04,634 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-07-17 13:19:04,635 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-17 13:19:04,635 INFO L264 CegarLoopResult]: At program point L102(line 102) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-17 13:19:04,635 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-17 13:19:04,636 INFO L264 CegarLoopResult]: At program point L86-1(lines 30 116) the Hoare annotation is: (let ((.cse5 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 0 main_~p4~0)) (.cse9 (= 1 main_~lk6~0)) (.cse7 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse6 (= 1 main_~lk3~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse6 .cse3 .cse4) (and .cse0 .cse6 .cse4 .cse7 .cse8) (and .cse5 .cse6 .cse3 .cse4 .cse8) (and .cse9 .cse5 .cse2 .cse6 .cse3) (and .cse9 .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse6 .cse4 .cse7) (and .cse9 .cse5 .cse6 .cse3 .cse8) (and .cse1 .cse5 .cse4 .cse7 .cse8) (and .cse5 .cse2 .cse6 .cse4 .cse7) (and .cse9 .cse0 .cse1 .cse3 .cse8) (and .cse1 .cse5 .cse2 .cse4 .cse7) (and .cse9 .cse1 .cse5 .cse2 .cse7) (and .cse9 .cse5 .cse2 .cse6 .cse7) (and .cse0 .cse1 .cse4 .cse7 .cse8) (and .cse1 .cse5 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse8) (and .cse9 .cse1 .cse5 .cse7 .cse8) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse9 .cse0 .cse2 .cse6 .cse7) (and .cse9 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse5 .cse2 .cse3) (and .cse9 .cse0 .cse6 .cse3 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse7) (and .cse9 .cse1 .cse5 .cse3 .cse8) (and .cse1 .cse5 .cse3 .cse4 .cse8) (and .cse9 .cse0 .cse2 .cse6 .cse3) (and .cse9 .cse0 .cse1 .cse7 .cse8) (and .cse5 .cse6 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse9 .cse0 .cse6 .cse7 .cse8) (and .cse0 .cse6 .cse3 .cse4 .cse8))) [2020-07-17 13:19:04,636 INFO L271 CegarLoopResult]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2020-07-17 13:19:04,636 INFO L271 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: true [2020-07-17 13:19:04,636 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-17 13:19:04,636 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-17 13:19:04,636 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-07-17 13:19:04,636 INFO L264 CegarLoopResult]: At program point L103(line 103) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse4 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse3 .cse0 .cse2) (and .cse4 .cse1 .cse2))) [2020-07-17 13:19:04,636 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-07-17 13:19:04,637 INFO L264 CegarLoopResult]: At program point L120(line 120) the Hoare annotation is: false [2020-07-17 13:19:04,637 INFO L264 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk7~0)) (.cse0 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p4~0)) (.cse9 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p5~0)) (.cse10 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse7) (and .cse0 .cse2 .cse3 .cse9 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse4 .cse10 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse4 .cse10) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse7 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse9 .cse10 .cse7 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse4 .cse10) (and .cse2 .cse3 .cse9 .cse4 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse6 .cse4 .cse10) (and .cse8 .cse1 .cse2 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse4) (and .cse8 .cse1 .cse2 .cse6 .cse4 .cse10) (and .cse8 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse9 .cse7 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse3 .cse9 .cse4 .cse5) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse5))) [2020-07-17 13:19:04,637 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-17 13:19:04,637 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-17 13:19:04,637 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-07-17 13:19:04,637 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (= 1 main_~lk7~0) [2020-07-17 13:19:04,637 INFO L264 CegarLoopResult]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2020-07-17 13:19:04,637 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-17 13:19:04,638 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 121) the Hoare annotation is: true [2020-07-17 13:19:04,638 INFO L264 CegarLoopResult]: At program point L71-1(lines 30 116) the Hoare annotation is: (let ((.cse6 (= 0 main_~p2~0)) (.cse10 (= 1 main_~lk3~0)) (.cse11 (= 1 main_~lk6~0)) (.cse2 (= 0 main_~p5~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 .cse11 .cse0 .cse1 .cse4 .cse7 .cse5) (and .cse6 .cse10 .cse3 .cse7 .cse8 .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 .cse0 .cse9 .cse6 .cse2 .cse3 .cse4) (and .cse11 .cse0 .cse6 .cse2 .cse4 .cse5) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse2 .cse3 .cse4) (and .cse11 .cse1 .cse9 .cse10 .cse7 .cse8) (and .cse11 .cse1 .cse10 .cse2 .cse4 .cse5) (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 .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse9 .cse6 .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 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (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 .cse11 .cse0 .cse1 .cse2 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse2 .cse3 .cse8) (and .cse1 .cse10 .cse2 .cse3 .cse8 .cse5) (and .cse11 .cse6 .cse10 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse5))) [2020-07-17 13:19:04,638 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) the Hoare annotation is: false [2020-07-17 13:19:04,639 INFO L264 CegarLoopResult]: At program point L96-1(lines 30 116) the Hoare annotation is: (let ((.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk6~0)) (.cse0 (= 0 main_~p7~0)) (.cse5 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse0 .cse4 .cse1) (and .cse5 .cse4 .cse1) (and .cse3 .cse5 .cse2) (and .cse3 .cse5 .cse4) (and .cse3 .cse0 .cse2) (and .cse5 .cse1 .cse2))) [2020-07-17 13:19:04,639 INFO L264 CegarLoopResult]: At program point L63-1(lines 30 116) 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 .cse5 .cse7 .cse1 .cse6) (and .cse4 .cse0 .cse6 .cse3) (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-17 13:19:04,639 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2020-07-17 13:19:04,640 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk7~0)) (.cse0 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p4~0)) (.cse9 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p7~0)) (.cse1 (= 0 main_~p3~0)) (.cse2 (= 1 main_~lk2~0)) (.cse4 (= 0 main_~p5~0)) (.cse10 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse7) (and .cse0 .cse2 .cse3 .cse9 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse4 .cse10 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse4 .cse10) (and .cse0 .cse8 .cse2 .cse9 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse7 .cse5) (and .cse8 .cse2 .cse6 .cse9 .cse10 .cse7) (and .cse2 .cse3 .cse9 .cse10 .cse7 .cse5) (and .cse2 .cse3 .cse6 .cse9 .cse4 .cse10) (and .cse2 .cse3 .cse9 .cse4 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse6 .cse4 .cse10) (and .cse8 .cse1 .cse2 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse6 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse4) (and .cse8 .cse1 .cse2 .cse6 .cse4 .cse10) (and .cse8 .cse2 .cse9 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse2 .cse9 .cse7 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse9 .cse4) (and .cse0 .cse2 .cse3 .cse9 .cse4 .cse5) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse7) (and .cse0 .cse8 .cse2 .cse6 .cse9 .cse7) (and .cse8 .cse1 .cse2 .cse4 .cse10 .cse5))) [2020-07-17 13:19:04,640 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-17 13:19:04,640 INFO L264 CegarLoopResult]: At program point L55-1(lines 30 116) 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-17 13:19:04,640 INFO L264 CegarLoopResult]: At program point L113(line 113) the Hoare annotation is: (= 1 main_~lk7~0) [2020-07-17 13:19:04,640 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-07-17 13:19:04,640 INFO L264 CegarLoopResult]: At program point L72(line 72) 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-17 13:19:04,640 INFO L271 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-07-17 13:19:04,640 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-17 13:19:04,641 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-17 13:19:04,641 INFO L264 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: (let ((.cse5 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk7~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse0 .cse6 .cse2 .cse3) (and .cse6 .cse4 .cse5 .cse3) (and .cse6 .cse5 .cse2 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse0 .cse6 .cse4 .cse3) (and .cse0 .cse1 .cse4 .cse3))) [2020-07-17 13:19:04,641 INFO L264 CegarLoopResult]: At program point L64(line 64) 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-17 13:19:04,641 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-17 13:19:04,641 INFO L271 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-07-17 13:19:04,641 INFO L271 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-07-17 13:19:04,642 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-17 13:19:04,642 INFO L264 CegarLoopResult]: At program point L81-1(lines 30 116) the Hoare annotation is: (let ((.cse4 (= 0 main_~p5~0)) (.cse5 (= 1 main_~lk4~0)) (.cse8 (= 1 main_~lk3~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse3 (= 1 main_~lk2~0)) (.cse2 (= 0 main_~p3~0)) (.cse6 (= 1 main_~lk7~0)) (.cse7 (= 0 main_~p4~0)) (.cse11 (= 0 main_~p2~0)) (.cse9 (= 0 main_~p6~0)) (.cse10 (= 1 main_~lk5~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse3 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse3 .cse6 .cse8 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse11 .cse4 .cse5) (and .cse1 .cse2 .cse7 .cse11 .cse9 .cse10) (and .cse1 .cse3 .cse8 .cse4 .cse9 .cse5) (and .cse1 .cse3 .cse7 .cse8 .cse4 .cse9) (and .cse0 .cse1 .cse11 .cse8 .cse4 .cse5) (and .cse3 .cse6 .cse8 .cse9 .cse10 .cse5) (and .cse3 .cse6 .cse7 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse11 .cse10 .cse5) (and .cse3 .cse6 .cse8 .cse4 .cse9 .cse5) (and .cse2 .cse3 .cse6 .cse7 .cse4 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse9 .cse10) (and .cse1 .cse2 .cse7 .cse11 .cse4 .cse9) (and .cse2 .cse3 .cse6 .cse9 .cse10 .cse5) (and .cse2 .cse6 .cse7 .cse11 .cse4 .cse9) (and .cse2 .cse3 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse2 .cse6 .cse7 .cse11 .cse4) (and .cse1 .cse7 .cse11 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse4) (and .cse0 .cse1 .cse7 .cse11 .cse8 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse9) (and .cse2 .cse6 .cse11 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse11 .cse8 .cse10 .cse5) (and .cse0 .cse3 .cse6 .cse7 .cse8 .cse10) (and .cse6 .cse7 .cse11 .cse8 .cse9 .cse10) (and .cse0 .cse6 .cse7 .cse11 .cse8 .cse4) (and .cse0 .cse6 .cse7 .cse11 .cse8 .cse10) (and .cse0 .cse3 .cse6 .cse8 .cse4 .cse5) (and .cse1 .cse2 .cse11 .cse9 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse9 .cse10 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse4 .cse5) (and .cse0 .cse6 .cse11 .cse8 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse7 .cse10) (and .cse0 .cse2 .cse6 .cse7 .cse11 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse10 .cse5) (and .cse2 .cse6 .cse11 .cse9 .cse10 .cse5) (and .cse1 .cse11 .cse8 .cse4 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse11 .cse4 .cse9 .cse5) (and .cse1 .cse7 .cse11 .cse8 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse1 .cse3 .cse8 .cse4 .cse5) (and .cse1 .cse3 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse7 .cse11 .cse8 .cse4) (and .cse1 .cse11 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse10 .cse5) (and .cse1 .cse3 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse3 .cse8 .cse10 .cse5) (and .cse6 .cse7 .cse11 .cse8 .cse4 .cse9) (and .cse6 .cse11 .cse8 .cse4 .cse9 .cse5) (and .cse2 .cse3 .cse6 .cse4 .cse9 .cse5) (and .cse0 .cse3 .cse6 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse11 .cse8 .cse10 .cse5) (and .cse6 .cse11 .cse8 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse11 .cse4) (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse10) (and .cse2 .cse6 .cse7 .cse11 .cse9 .cse10))) [2020-07-17 13:19:04,642 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-17 13:19:04,642 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-07-17 13:19:04,642 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-07-17 13:19:04,642 INFO L264 CegarLoopResult]: At program point L106-1(lines 30 116) the Hoare annotation is: (or (= 0 main_~p7~0) (= 1 main_~lk7~0)) [2020-07-17 13:19:04,642 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-17 13:19:04,643 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (let ((.cse5 (= 0 main_~p6~0)) (.cse2 (= 1 main_~lk5~0)) (.cse6 (= 1 main_~lk7~0)) (.cse0 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p7~0)) (.cse4 (= 0 main_~p5~0)) (.cse3 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse3) (and .cse0 .cse6 .cse2 .cse3) (and .cse6 .cse4 .cse5 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse6 .cse5 .cse2 .cse3) (and .cse0 .cse6 .cse4 .cse3) (and .cse0 .cse1 .cse4 .cse3))) [2020-07-17 13:19:04,643 INFO L271 CegarLoopResult]: At program point L32(lines 32 34) the Hoare annotation is: true [2020-07-17 13:19:04,643 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-17 13:19:04,643 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-07-17 13:19:04,643 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-07-17 13:19:04,644 INFO L264 CegarLoopResult]: At program point L82(line 82) the Hoare annotation is: (let ((.cse2 (= 0 main_~p2~0)) (.cse8 (= 0 main_~p3~0)) (.cse9 (= main_~lk7~0 1)) (.cse7 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse10 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse11 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse10 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse0 .cse11 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse4 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse11 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse4 .cse6 .cse12) (and .cse11 .cse9 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse2 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse2 .cse10 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse9 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse3 .cse10 .cse6 .cse12) (and .cse8 .cse9 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse10 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse11 .cse1 .cse5 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse9 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse10 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse11 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse8 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse8 .cse11 .cse9 .cse1 .cse5 .cse10 .cse6) (and .cse8 .cse9 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse11 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse12))) [2020-07-17 13:19:04,644 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-17 13:19:04,644 INFO L264 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk6~0))) (or (and .cse0 (= 1 main_~lk7~0)) (and .cse0 (= 0 main_~p7~0)))) [2020-07-17 13:19:04,644 INFO L271 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-07-17 13:19:04,645 INFO L264 CegarLoopResult]: At program point L91-1(lines 30 116) the Hoare annotation is: (let ((.cse3 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p7~0)) (.cse7 (= 1 main_~lk5~0)) (.cse5 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk7~0)) (.cse4 (= 0 main_~p4~0)) (.cse1 (= 0 main_~p5~0)) (.cse2 (= 0 main_~p6~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse1 .cse2) (and .cse5 .cse6 .cse7 .cse3) (and .cse6 .cse2 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3) (and .cse6 .cse4 .cse2 .cse7) (and .cse5 .cse0 .cse7 .cse3) (and .cse6 .cse1 .cse2 .cse3) (and .cse5 .cse6 .cse4 .cse7) (and .cse5 .cse0 .cse4 .cse1) (and .cse5 .cse0 .cse4 .cse7) (and .cse5 .cse6 .cse1 .cse3) (and .cse0 .cse2 .cse7 .cse3) (and .cse0 .cse4 .cse2 .cse7) (and .cse5 .cse6 .cse4 .cse1) (and .cse6 .cse4 .cse1 .cse2))) [2020-07-17 13:19:04,645 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-07-17 13:19:04,646 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse2 (= 0 main_~p2~0)) (.cse8 (= 0 main_~p3~0)) (.cse9 (= main_~lk7~0 1)) (.cse7 (= 1 main_~lk6~0)) (.cse1 (= 0 main_~p4~0)) (.cse10 (= 1 main_~lk5~0)) (.cse0 (= 0 main_~p7~0)) (.cse11 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse4 (= 0 main_~p5~0)) (.cse5 (= 0 main_~p6~0)) (.cse6 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse10 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse9 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse8 .cse11 .cse9 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse0 .cse11 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse4 .cse6) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse11 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse4 .cse6 .cse12) (and .cse11 .cse9 .cse1 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse7 .cse0 .cse8 .cse2 .cse4 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse2 .cse10 .cse6 .cse12) (and .cse7 .cse9 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse9 .cse2 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse3 .cse10 .cse6 .cse12) (and .cse8 .cse9 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse11 .cse1 .cse10 .cse6) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse1 .cse5 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse8 .cse9 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse9 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse9 .cse3 .cse10 .cse6 .cse12) (and .cse7 .cse0 .cse8 .cse1 .cse2 .cse10 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (and .cse7 .cse0 .cse11 .cse3 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse2 .cse4 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse9 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse8 .cse11 .cse9 .cse1 .cse5 .cse10 .cse6) (and .cse8 .cse9 .cse2 .cse5 .cse10 .cse6 .cse12) (and .cse8 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse11 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse11 .cse3 .cse5 .cse10 .cse6 .cse12) (and .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse12))) [2020-07-17 13:19:04,646 INFO L264 CegarLoopResult]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk6~0))) (or (and .cse0 (= 1 main_~lk7~0)) (and .cse0 (= 0 main_~p7~0)))) [2020-07-17 13:19:04,647 INFO L264 CegarLoopResult]: At program point L75-1(lines 30 116) the Hoare annotation is: (let ((.cse7 (= 1 main_~lk6~0)) (.cse6 (= 1 main_~lk5~0)) (.cse8 (= 0 main_~p3~0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= 0 main_~p4~0)) (.cse2 (= 0 main_~p2~0)) (.cse5 (= 0 main_~p1~0)) (.cse13 (= 0 main_~p7~0)) (.cse9 (= 1 main_~lk2~0)) (.cse3 (= 1 main_~lk3~0)) (.cse10 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse11 (= 1 main_~lk1~0)) (.cse12 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse10 .cse5) (and .cse9 .cse0 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse10 .cse11) (and .cse13 .cse8 .cse1 .cse2 .cse4 .cse6 .cse11) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse4 .cse5) (and .cse13 .cse8 .cse1 .cse2 .cse10 .cse4 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse9 .cse0 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse10 .cse11) (and .cse13 .cse8 .cse9 .cse1 .cse10 .cse4 .cse5) (and .cse13 .cse9 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse10 .cse5 .cse12) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse10 .cse11) (and .cse7 .cse13 .cse8 .cse2 .cse10 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse5 .cse6) (and .cse13 .cse8 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse2 .cse10 .cse5 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse5 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse13 .cse9 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse10 .cse5) (and .cse7 .cse8 .cse0 .cse2 .cse6 .cse11 .cse12) (and .cse9 .cse0 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse6 .cse11) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse5 .cse6) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse10 .cse4 .cse11) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse10 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse10 .cse4 .cse5) (and .cse9 .cse0 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse13 .cse8 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse7 .cse13 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse9 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse6 .cse11 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse3 .cse10 .cse11 .cse12) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse10 .cse5) (and .cse8 .cse9 .cse0 .cse1 .cse10 .cse4 .cse11) (and .cse13 .cse8 .cse2 .cse10 .cse4 .cse5 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse8 .cse0 .cse2 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse13 .cse8 .cse9 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse1 .cse10 .cse4 .cse11) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse9 .cse0 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse10 .cse5) (and .cse13 .cse8 .cse9 .cse1 .cse4 .cse5 .cse6) (and .cse13 .cse9 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse10 .cse4 .cse11) (and .cse13 .cse8 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse6 .cse11 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse10 .cse11) (and .cse9 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse6 .cse11) (and .cse8 .cse9 .cse0 .cse4 .cse6 .cse11 .cse12) (and .cse13 .cse9 .cse1 .cse3 .cse10 .cse4 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse6 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12) (and .cse13 .cse9 .cse3 .cse10 .cse4 .cse5 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse11) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse13 .cse8 .cse9 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse5 .cse6) (and .cse7 .cse13 .cse2 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse9 .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse8 .cse0 .cse2 .cse10 .cse4 .cse5 .cse12) (and .cse7 .cse13 .cse2 .cse3 .cse10 .cse11 .cse12) (and .cse13 .cse2 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse0 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse10 .cse5) (and .cse7 .cse13 .cse8 .cse1 .cse2 .cse10 .cse11) (and .cse7 .cse9 .cse0 .cse1 .cse3 .cse5 .cse6) (and .cse9 .cse0 .cse3 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse13 .cse9 .cse3 .cse6 .cse11 .cse12) (and .cse13 .cse8 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse2 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse1 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse6 .cse11) (and .cse13 .cse8 .cse9 .cse1 .cse4 .cse6 .cse11) (and .cse13 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse1 .cse2 .cse5 .cse6) (and .cse13 .cse2 .cse3 .cse10 .cse4 .cse11 .cse12) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse2 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse13 .cse8 .cse9 .cse10 .cse5 .cse12) (and .cse8 .cse9 .cse0 .cse4 .cse5 .cse6 .cse12) (and .cse13 .cse8 .cse2 .cse10 .cse4 .cse11 .cse12) (and .cse13 .cse8 .cse2 .cse4 .cse6 .cse11 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse1 .cse5 .cse6) (and .cse7 .cse13 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse13 .cse8 .cse9 .cse10 .cse4 .cse11 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse10 .cse4 .cse11) (and .cse8 .cse9 .cse0 .cse1 .cse4 .cse6 .cse11) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse10 .cse5) (and .cse7 .cse13 .cse9 .cse1 .cse3 .cse10 .cse11) (and .cse8 .cse9 .cse0 .cse10 .cse4 .cse5 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse13 .cse8 .cse9 .cse5 .cse6 .cse12) (and .cse7 .cse9 .cse0 .cse3 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse9 .cse0 .cse5 .cse6 .cse12) (and .cse8 .cse0 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse13 .cse9 .cse3 .cse10 .cse4 .cse11 .cse12))) [2020-07-17 13:19:04,647 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-07-17 13:19:04,647 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-07-17 13:19:04,647 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-07-17 13:19:04,648 INFO L264 CegarLoopResult]: At program point L67-1(lines 30 116) 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 .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse6 .cse9 .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-17 13:19:04,648 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse0 (= 1 main_~lk7~0)) (.cse1 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p5~0)) (.cse4 (= 0 main_~p6~0)) (.cse5 (= 1 main_~lk6~0)) (.cse6 (= 0 main_~p7~0)) (.cse2 (= 1 main_~lk3~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 1 main_~lk4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse1 .cse2 .cse7) (and .cse6 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse2 .cse4 .cse7 .cse8) (and .cse5 .cse0 .cse2 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse6 .cse2 .cse3 .cse8) (and .cse5 .cse0 .cse1 .cse2 .cse3) (and .cse6 .cse1 .cse2 .cse4 .cse7) (and .cse5 .cse6 .cse1 .cse2 .cse3) (and .cse5 .cse0 .cse2 .cse3 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7) (and .cse0 .cse2 .cse4 .cse7 .cse8) (and .cse5 .cse0 .cse1 .cse2 .cse7) (and .cse6 .cse2 .cse3 .cse4 .cse8) (and .cse5 .cse6 .cse2 .cse7 .cse8))) [2020-07-17 13:19:04,648 INFO L264 CegarLoopResult]: At program point L59-1(lines 30 116) 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-17 13:19:04,648 INFO L271 CegarLoopResult]: At program point L117(lines 5 121) the Hoare annotation is: true [2020-07-17 13:19:04,649 INFO L271 CegarLoopResult]: At program point L51(lines 51 53) the Hoare annotation is: true [2020-07-17 13:19:04,649 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-17 13:19:04,649 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-17 13:19:04,649 INFO L264 CegarLoopResult]: At program point L51-2(lines 30 116) the Hoare annotation is: (or (= 0 main_~p1~0) (= 1 main_~lk1~0)) [2020-07-17 13:19:04,649 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-17 13:19:04,650 INFO L264 CegarLoopResult]: At program point L76(line 76) 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)) (.cse4 (= 0 main_~p1~0)) (.cse5 (= 1 main_~lk4~0)) (.cse0 (= 0 main_~p3~0)) (.cse1 (= 1 main_~lk2~0)) (.cse9 (= 0 main_~p4~0)) (.cse3 (= 0 main_~p6~0)) (.cse7 (= 1 main_~lk5~0)) (.cse8 (= 1 main_~lk1~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 .cse6 .cse10 .cse3 .cse4 .cse7 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse8 .cse5) (and .cse11 .cse0 .cse6 .cse2 .cse8 .cse5) (and .cse0 .cse9 .cse6 .cse3 .cse7 .cse8) (and .cse11 .cse0 .cse9 .cse6 .cse7 .cse8) (and .cse11 .cse1 .cse9 .cse10 .cse2 .cse4) (and .cse11 .cse0 .cse1 .cse9 .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 .cse11 .cse0 .cse1 .cse9 .cse7 .cse8) (and .cse9 .cse6 .cse10 .cse3 .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 .cse9 .cse6 .cse10 .cse4 .cse7) (and .cse11 .cse0 .cse9 .cse6 .cse4 .cse7) (and .cse11 .cse9 .cse6 .cse10 .cse7 .cse8) (and .cse11 .cse6 .cse10 .cse2 .cse8 .cse5) (and .cse11 .cse0 .cse1 .cse9 .cse2 .cse8) (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 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse9 .cse3 .cse7 .cse8))) [2020-07-17 13:19:04,650 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-07-17 13:19:04,650 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-17 13:19:04,650 INFO L264 CegarLoopResult]: At program point L68(line 68) 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-17 13:19:04,651 INFO L264 CegarLoopResult]: At program point L101-1(lines 30 116) the Hoare annotation is: (let ((.cse1 (= 1 main_~lk7~0)) (.cse3 (= 0 main_~p6~0)) (.cse0 (= 1 main_~lk6~0)) (.cse2 (= 0 main_~p7~0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse0 .cse2))) [2020-07-17 13:19:04,651 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-07-17 13:19:04,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 01:19:04 BoogieIcfgContainer [2020-07-17 13:19:04,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 13:19:04,666 INFO L168 Benchmark]: Toolchain (without parser) took 18638.08 ms. Allocated memory was 144.7 MB in the beginning and 601.4 MB in the end (delta: 456.7 MB). Free memory was 102.2 MB in the beginning and 491.7 MB in the end (delta: -389.5 MB). Peak memory consumption was 475.7 MB. Max. memory is 7.1 GB. [2020-07-17 13:19:04,666 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 13:19:04,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.48 ms. Allocated memory is still 144.7 MB. Free memory was 101.8 MB in the beginning and 91.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-17 13:19:04,667 INFO L168 Benchmark]: Boogie Preprocessor took 132.61 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 91.7 MB in the beginning and 181.1 MB in the end (delta: -89.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-17 13:19:04,668 INFO L168 Benchmark]: RCFGBuilder took 450.01 ms. Allocated memory is still 203.4 MB. Free memory was 181.1 MB in the beginning and 161.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2020-07-17 13:19:04,669 INFO L168 Benchmark]: TraceAbstraction took 17769.08 ms. Allocated memory was 203.4 MB in the beginning and 601.4 MB in the end (delta: 397.9 MB). Free memory was 160.1 MB in the beginning and 491.7 MB in the end (delta: -331.6 MB). Peak memory consumption was 474.9 MB. Max. memory is 7.1 GB. [2020-07-17 13:19:04,672 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.20 ms. Allocated memory is still 144.7 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 278.48 ms. Allocated memory is still 144.7 MB. Free memory was 101.8 MB in the beginning and 91.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.61 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 91.7 MB in the beginning and 181.1 MB in the end (delta: -89.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 450.01 ms. Allocated memory is still 203.4 MB. Free memory was 181.1 MB in the beginning and 161.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17769.08 ms. Allocated memory was 203.4 MB in the beginning and 601.4 MB in the end (delta: 397.9 MB). Free memory was 160.1 MB in the beginning and 491.7 MB in the end (delta: -331.6 MB). Peak memory consumption was 474.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1813 SDtfs, 648 SDslu, 1281 SDs, 0 SdLazy, 69 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3635occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 1022 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 4768 NumberOfFragments, 13918 HoareAnnotationTreeSize, 88 FomulaSimplifications, 98944 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 88 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 10.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...