/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 22:14:10,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 22:14:10,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 22:14:10,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 22:14:10,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 22:14:10,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 22:14:10,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 22:14:10,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 22:14:10,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 22:14:10,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 22:14:10,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 22:14:10,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 22:14:10,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 22:14:10,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 22:14:10,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 22:14:10,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 22:14:10,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 22:14:10,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 22:14:10,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 22:14:10,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 22:14:10,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 22:14:10,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 22:14:10,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 22:14:10,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 22:14:10,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 22:14:10,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 22:14:10,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 22:14:10,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 22:14:10,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 22:14:10,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 22:14:10,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 22:14:10,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 22:14:10,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 22:14:10,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 22:14:10,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 22:14:10,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 22:14:10,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 22:14:10,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 22:14:10,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 22:14:10,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 22:14:10,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 22:14:10,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 22:14:10,525 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 22:14:10,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 22:14:10,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 22:14:10,528 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 22:14:10,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 22:14:10,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 22:14:10,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 22:14:10,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 22:14:10,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 22:14:10,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 22:14:10,530 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 22:14:10,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 22:14:10,531 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 22:14:10,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 22:14:10,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 22:14:10,532 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 22:14:10,532 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 22:14:10,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 22:14:10,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 22:14:10,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 22:14:10,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 22:14:10,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 22:14:10,533 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-08-22 22:14:10,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 22:14:10,829 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 22:14:10,835 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 22:14:10,839 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 22:14:10,839 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 22:14:10,840 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-08-22 22:14:10,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db88deb4/e122ab900a3b47329787c377d48853b7/FLAGc063521e7 [2020-08-22 22:14:11,344 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 22:14:11,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2020-08-22 22:14:11,354 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db88deb4/e122ab900a3b47329787c377d48853b7/FLAGc063521e7 [2020-08-22 22:14:11,686 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db88deb4/e122ab900a3b47329787c377d48853b7 [2020-08-22 22:14:11,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 22:14:11,697 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 22:14:11,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 22:14:11,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 22:14:11,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 22:14:11,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:11,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19e0264c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11, skipping insertion in model container [2020-08-22 22:14:11,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:11,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 22:14:11,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 22:14:11,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:14:11,938 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 22:14:11,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:14:11,977 INFO L208 MainTranslator]: Completed translation [2020-08-22 22:14:11,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11 WrapperNode [2020-08-22 22:14:11,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 22:14:11,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 22:14:11,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 22:14:11,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 22:14:12,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:12,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:12,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:12,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:12,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:12,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:12,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... [2020-08-22 22:14:12,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 22:14:12,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 22:14:12,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 22:14:12,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 22:14:12,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 22:14:12,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 22:14:12,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 22:14:12,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 22:14:12,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 22:14:12,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 22:14:12,185 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 22:14:12,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 22:14:12,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 22:14:12,519 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 22:14:12,520 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-22 22:14:12,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:14:12 BoogieIcfgContainer [2020-08-22 22:14:12,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 22:14:12,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 22:14:12,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 22:14:12,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 22:14:12,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 10:14:11" (1/3) ... [2020-08-22 22:14:12,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4983af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:14:12, skipping insertion in model container [2020-08-22 22:14:12,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:11" (2/3) ... [2020-08-22 22:14:12,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4983af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:14:12, skipping insertion in model container [2020-08-22 22:14:12,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:14:12" (3/3) ... [2020-08-22 22:14:12,535 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-08-22 22:14:12,548 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 22:14:12,556 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 22:14:12,570 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 22:14:12,598 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 22:14:12,598 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 22:14:12,598 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 22:14:12,598 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 22:14:12,599 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 22:14:12,600 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 22:14:12,600 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 22:14:12,600 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 22:14:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-08-22 22:14:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-22 22:14:12,642 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:12,643 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:14:12,644 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:12,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1826051656, now seen corresponding path program 1 times [2020-08-22 22:14:12,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:12,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [70317817] [2020-08-22 22:14:12,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:12,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:12,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [70317817] [2020-08-22 22:14:12,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:12,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:12,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224744490] [2020-08-22 22:14:12,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:12,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:12,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:12,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:12,908 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2020-08-22 22:14:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:12,992 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2020-08-22 22:14:12,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:12,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-08-22 22:14:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:13,018 INFO L225 Difference]: With dead ends: 191 [2020-08-22 22:14:13,018 INFO L226 Difference]: Without dead ends: 128 [2020-08-22 22:14:13,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-08-22 22:14:13,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2020-08-22 22:14:13,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-08-22 22:14:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2020-08-22 22:14:13,094 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 55 [2020-08-22 22:14:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:13,095 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2020-08-22 22:14:13,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2020-08-22 22:14:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-08-22 22:14:13,098 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:13,098 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-08-22 22:14:13,099 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 22:14:13,099 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:13,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:13,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1965492109, now seen corresponding path program 1 times [2020-08-22 22:14:13,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:13,101 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [124143943] [2020-08-22 22:14:13,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:13,210 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [124143943] [2020-08-22 22:14:13,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:13,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:13,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209466188] [2020-08-22 22:14:13,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:13,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:13,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:13,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,214 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 3 states. [2020-08-22 22:14:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:13,258 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2020-08-22 22:14:13,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:13,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-08-22 22:14:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:13,262 INFO L225 Difference]: With dead ends: 154 [2020-08-22 22:14:13,262 INFO L226 Difference]: Without dead ends: 152 [2020-08-22 22:14:13,263 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-08-22 22:14:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2020-08-22 22:14:13,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-08-22 22:14:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2020-08-22 22:14:13,289 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 56 [2020-08-22 22:14:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:13,290 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2020-08-22 22:14:13,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2020-08-22 22:14:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-08-22 22:14:13,292 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:13,293 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-08-22 22:14:13,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 22:14:13,293 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:13,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:13,294 INFO L82 PathProgramCache]: Analyzing trace with hash 773271458, now seen corresponding path program 1 times [2020-08-22 22:14:13,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:13,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2090162207] [2020-08-22 22:14:13,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:13,383 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2090162207] [2020-08-22 22:14:13,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:13,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:13,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965959706] [2020-08-22 22:14:13,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:13,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:13,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:13,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,386 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 3 states. [2020-08-22 22:14:13,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:13,452 INFO L93 Difference]: Finished difference Result 306 states and 415 transitions. [2020-08-22 22:14:13,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:13,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-08-22 22:14:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:13,457 INFO L225 Difference]: With dead ends: 306 [2020-08-22 22:14:13,457 INFO L226 Difference]: Without dead ends: 213 [2020-08-22 22:14:13,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-08-22 22:14:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2020-08-22 22:14:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-08-22 22:14:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2020-08-22 22:14:13,505 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 56 [2020-08-22 22:14:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:13,506 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2020-08-22 22:14:13,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2020-08-22 22:14:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-08-22 22:14:13,509 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:13,509 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-08-22 22:14:13,510 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 22:14:13,510 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash -610540190, now seen corresponding path program 1 times [2020-08-22 22:14:13,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:13,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1128142904] [2020-08-22 22:14:13,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:13,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1128142904] [2020-08-22 22:14:13,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:13,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:13,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712257505] [2020-08-22 22:14:13,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:13,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:13,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:13,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,576 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand 3 states. [2020-08-22 22:14:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:13,622 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2020-08-22 22:14:13,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:13,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-08-22 22:14:13,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:13,628 INFO L225 Difference]: With dead ends: 259 [2020-08-22 22:14:13,628 INFO L226 Difference]: Without dead ends: 257 [2020-08-22 22:14:13,629 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-08-22 22:14:13,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 211. [2020-08-22 22:14:13,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-08-22 22:14:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2020-08-22 22:14:13,681 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 57 [2020-08-22 22:14:13,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:13,685 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2020-08-22 22:14:13,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2020-08-22 22:14:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-08-22 22:14:13,688 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:13,688 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-08-22 22:14:13,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 22:14:13,691 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:13,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1798143236, now seen corresponding path program 1 times [2020-08-22 22:14:13,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:13,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1377934043] [2020-08-22 22:14:13,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:13,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1377934043] [2020-08-22 22:14:13,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:13,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:13,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157118226] [2020-08-22 22:14:13,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:13,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:13,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:13,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,783 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand 3 states. [2020-08-22 22:14:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:13,829 INFO L93 Difference]: Finished difference Result 555 states and 752 transitions. [2020-08-22 22:14:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:13,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-08-22 22:14:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:13,832 INFO L225 Difference]: With dead ends: 555 [2020-08-22 22:14:13,833 INFO L226 Difference]: Without dead ends: 377 [2020-08-22 22:14:13,834 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-08-22 22:14:13,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2020-08-22 22:14:13,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-08-22 22:14:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 498 transitions. [2020-08-22 22:14:13,875 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 498 transitions. Word has length 57 [2020-08-22 22:14:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:13,876 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 498 transitions. [2020-08-22 22:14:13,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 498 transitions. [2020-08-22 22:14:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-08-22 22:14:13,879 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:13,879 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-08-22 22:14:13,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 22:14:13,880 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1136837537, now seen corresponding path program 1 times [2020-08-22 22:14:13,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:13,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [220367938] [2020-08-22 22:14:13,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:13,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:13,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [220367938] [2020-08-22 22:14:13,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:13,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:13,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444100150] [2020-08-22 22:14:13,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:13,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:13,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:13,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,922 INFO L87 Difference]: Start difference. First operand 375 states and 498 transitions. Second operand 3 states. [2020-08-22 22:14:13,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:13,966 INFO L93 Difference]: Finished difference Result 459 states and 612 transitions. [2020-08-22 22:14:13,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:13,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-08-22 22:14:13,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:13,970 INFO L225 Difference]: With dead ends: 459 [2020-08-22 22:14:13,970 INFO L226 Difference]: Without dead ends: 457 [2020-08-22 22:14:13,971 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2020-08-22 22:14:14,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 375. [2020-08-22 22:14:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-08-22 22:14:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 494 transitions. [2020-08-22 22:14:14,005 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 494 transitions. Word has length 58 [2020-08-22 22:14:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:14,006 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 494 transitions. [2020-08-22 22:14:14,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 494 transitions. [2020-08-22 22:14:14,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-08-22 22:14:14,008 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:14,008 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-08-22 22:14:14,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 22:14:14,009 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:14,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:14,009 INFO L82 PathProgramCache]: Analyzing trace with hash 92380246, now seen corresponding path program 1 times [2020-08-22 22:14:14,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:14,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [840770261] [2020-08-22 22:14:14,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:14,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:14,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [840770261] [2020-08-22 22:14:14,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:14,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:14,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937879458] [2020-08-22 22:14:14,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:14,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:14,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:14,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:14,063 INFO L87 Difference]: Start difference. First operand 375 states and 494 transitions. Second operand 3 states. [2020-08-22 22:14:14,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:14,137 INFO L93 Difference]: Finished difference Result 1035 states and 1384 transitions. [2020-08-22 22:14:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:14,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-08-22 22:14:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:14,142 INFO L225 Difference]: With dead ends: 1035 [2020-08-22 22:14:14,143 INFO L226 Difference]: Without dead ends: 693 [2020-08-22 22:14:14,147 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:14,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-08-22 22:14:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2020-08-22 22:14:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-08-22 22:14:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 906 transitions. [2020-08-22 22:14:14,213 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 906 transitions. Word has length 58 [2020-08-22 22:14:14,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:14,213 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 906 transitions. [2020-08-22 22:14:14,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 906 transitions. [2020-08-22 22:14:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-08-22 22:14:14,216 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:14,216 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-08-22 22:14:14,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 22:14:14,217 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:14,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:14,217 INFO L82 PathProgramCache]: Analyzing trace with hash -529027402, now seen corresponding path program 1 times [2020-08-22 22:14:14,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:14,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [174428493] [2020-08-22 22:14:14,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:14,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:14,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [174428493] [2020-08-22 22:14:14,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:14,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:14,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304295691] [2020-08-22 22:14:14,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:14,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:14,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:14,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:14,314 INFO L87 Difference]: Start difference. First operand 691 states and 906 transitions. Second operand 3 states. [2020-08-22 22:14:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:14,382 INFO L93 Difference]: Finished difference Result 839 states and 1100 transitions. [2020-08-22 22:14:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:14,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-08-22 22:14:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:14,387 INFO L225 Difference]: With dead ends: 839 [2020-08-22 22:14:14,388 INFO L226 Difference]: Without dead ends: 837 [2020-08-22 22:14:14,388 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:14,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2020-08-22 22:14:14,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 691. [2020-08-22 22:14:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-08-22 22:14:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 898 transitions. [2020-08-22 22:14:14,441 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 898 transitions. Word has length 59 [2020-08-22 22:14:14,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:14,442 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 898 transitions. [2020-08-22 22:14:14,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 898 transitions. [2020-08-22 22:14:14,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-08-22 22:14:14,444 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:14,444 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-08-22 22:14:14,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 22:14:14,444 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:14,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:14,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1430933584, now seen corresponding path program 1 times [2020-08-22 22:14:14,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:14,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [652164851] [2020-08-22 22:14:14,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:14,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:14,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [652164851] [2020-08-22 22:14:14,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:14,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:14,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624795370] [2020-08-22 22:14:14,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:14,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:14,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:14,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:14,476 INFO L87 Difference]: Start difference. First operand 691 states and 898 transitions. Second operand 3 states. [2020-08-22 22:14:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:14,591 INFO L93 Difference]: Finished difference Result 1959 states and 2564 transitions. [2020-08-22 22:14:14,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:14,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-08-22 22:14:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:14,599 INFO L225 Difference]: With dead ends: 1959 [2020-08-22 22:14:14,599 INFO L226 Difference]: Without dead ends: 1301 [2020-08-22 22:14:14,601 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:14,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2020-08-22 22:14:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1299. [2020-08-22 22:14:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-08-22 22:14:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1666 transitions. [2020-08-22 22:14:14,725 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1666 transitions. Word has length 59 [2020-08-22 22:14:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:14,726 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1666 transitions. [2020-08-22 22:14:14,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1666 transitions. [2020-08-22 22:14:14,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-08-22 22:14:14,728 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:14,728 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-08-22 22:14:14,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 22:14:14,729 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:14,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:14,729 INFO L82 PathProgramCache]: Analyzing trace with hash -631232587, now seen corresponding path program 1 times [2020-08-22 22:14:14,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:14,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [396386280] [2020-08-22 22:14:14,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:14,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:14,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [396386280] [2020-08-22 22:14:14,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:14,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:14,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119920157] [2020-08-22 22:14:14,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:14,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:14,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:14,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:14,770 INFO L87 Difference]: Start difference. First operand 1299 states and 1666 transitions. Second operand 3 states. [2020-08-22 22:14:14,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:14,883 INFO L93 Difference]: Finished difference Result 1559 states and 1988 transitions. [2020-08-22 22:14:14,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:14,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-08-22 22:14:14,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:14,893 INFO L225 Difference]: With dead ends: 1559 [2020-08-22 22:14:14,893 INFO L226 Difference]: Without dead ends: 1557 [2020-08-22 22:14:14,894 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2020-08-22 22:14:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1299. [2020-08-22 22:14:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-08-22 22:14:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1650 transitions. [2020-08-22 22:14:15,000 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1650 transitions. Word has length 60 [2020-08-22 22:14:15,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:15,001 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1650 transitions. [2020-08-22 22:14:15,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1650 transitions. [2020-08-22 22:14:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-08-22 22:14:15,003 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:15,003 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-08-22 22:14:15,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 22:14:15,003 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:15,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:15,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1409021686, now seen corresponding path program 1 times [2020-08-22 22:14:15,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:15,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1247571791] [2020-08-22 22:14:15,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:15,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:15,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1247571791] [2020-08-22 22:14:15,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:15,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:15,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606615291] [2020-08-22 22:14:15,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:15,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:15,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:15,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:15,057 INFO L87 Difference]: Start difference. First operand 1299 states and 1650 transitions. Second operand 3 states. [2020-08-22 22:14:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:15,260 INFO L93 Difference]: Finished difference Result 3735 states and 4756 transitions. [2020-08-22 22:14:15,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:15,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-08-22 22:14:15,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:15,275 INFO L225 Difference]: With dead ends: 3735 [2020-08-22 22:14:15,275 INFO L226 Difference]: Without dead ends: 2469 [2020-08-22 22:14:15,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2020-08-22 22:14:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2467. [2020-08-22 22:14:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-08-22 22:14:15,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3074 transitions. [2020-08-22 22:14:15,467 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3074 transitions. Word has length 60 [2020-08-22 22:14:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:15,468 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 3074 transitions. [2020-08-22 22:14:15,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3074 transitions. [2020-08-22 22:14:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-22 22:14:15,471 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:15,471 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-08-22 22:14:15,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 22:14:15,472 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash -729752476, now seen corresponding path program 1 times [2020-08-22 22:14:15,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:15,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1817457338] [2020-08-22 22:14:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:15,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:15,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1817457338] [2020-08-22 22:14:15,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:15,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:15,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66896710] [2020-08-22 22:14:15,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:15,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:15,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:15,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:15,521 INFO L87 Difference]: Start difference. First operand 2467 states and 3074 transitions. Second operand 3 states. [2020-08-22 22:14:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:15,871 INFO L93 Difference]: Finished difference Result 7143 states and 8900 transitions. [2020-08-22 22:14:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:15,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-08-22 22:14:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:15,890 INFO L225 Difference]: With dead ends: 7143 [2020-08-22 22:14:15,890 INFO L226 Difference]: Without dead ends: 3637 [2020-08-22 22:14:15,900 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:15,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2020-08-22 22:14:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2020-08-22 22:14:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2020-08-22 22:14:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 4370 transitions. [2020-08-22 22:14:16,189 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 4370 transitions. Word has length 61 [2020-08-22 22:14:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:16,189 INFO L479 AbstractCegarLoop]: Abstraction has 3635 states and 4370 transitions. [2020-08-22 22:14:16,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:16,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 4370 transitions. [2020-08-22 22:14:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-22 22:14:16,193 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:16,193 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-08-22 22:14:16,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 22:14:16,193 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:16,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:16,194 INFO L82 PathProgramCache]: Analyzing trace with hash 495374346, now seen corresponding path program 1 times [2020-08-22 22:14:16,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:16,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [310748161] [2020-08-22 22:14:16,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:16,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:16,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-08-22 22:14:16,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [310748161] [2020-08-22 22:14:16,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:16,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:16,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279181034] [2020-08-22 22:14:16,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:16,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:16,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:16,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:16,224 INFO L87 Difference]: Start difference. First operand 3635 states and 4370 transitions. Second operand 3 states. [2020-08-22 22:14:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:16,449 INFO L93 Difference]: Finished difference Result 4087 states and 4852 transitions. [2020-08-22 22:14:16,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:16,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-08-22 22:14:16,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:16,465 INFO L225 Difference]: With dead ends: 4087 [2020-08-22 22:14:16,465 INFO L226 Difference]: Without dead ends: 2917 [2020-08-22 22:14:16,470 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:16,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-08-22 22:14:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2467. [2020-08-22 22:14:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-08-22 22:14:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 2914 transitions. [2020-08-22 22:14:16,664 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 2914 transitions. Word has length 61 [2020-08-22 22:14:16,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:16,665 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 2914 transitions. [2020-08-22 22:14:16,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2914 transitions. [2020-08-22 22:14:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-08-22 22:14:16,668 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:16,668 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-08-22 22:14:16,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 22:14:16,668 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:16,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:16,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1060451273, now seen corresponding path program 1 times [2020-08-22 22:14:16,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:16,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1242122232] [2020-08-22 22:14:16,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:16,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:16,694 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1242122232] [2020-08-22 22:14:16,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:16,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:16,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852112531] [2020-08-22 22:14:16,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:16,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:16,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:16,696 INFO L87 Difference]: Start difference. First operand 2467 states and 2914 transitions. Second operand 3 states. [2020-08-22 22:14:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:16,816 INFO L93 Difference]: Finished difference Result 2467 states and 2914 transitions. [2020-08-22 22:14:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:16,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-08-22 22:14:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:16,817 INFO L225 Difference]: With dead ends: 2467 [2020-08-22 22:14:16,817 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 22:14:16,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:16,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 22:14:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 22:14:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 22:14:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 22:14:16,824 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2020-08-22 22:14:16,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:16,824 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 22:14:16,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:16,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 22:14:16,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 22:14:16,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-22 22:14:16,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 22:14:16,952 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 22:14:17,259 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 35 [2020-08-22 22:14:17,444 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 275 DAG size of output: 3 [2020-08-22 22:14:17,758 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 7 [2020-08-22 22:14:18,199 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 91 [2020-08-22 22:14:18,504 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 23 [2020-08-22 22:14:18,867 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 91 [2020-08-22 22:14:19,007 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-08-22 22:14:19,319 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-08-22 22:14:20,869 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 22:14:21,293 WARN L193 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-08-22 22:14:21,493 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 22:14:21,970 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-08-22 22:14:22,935 WARN L193 SmtUtils]: Spent 906.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 22:14:23,100 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-08-22 22:14:23,245 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 22:14:23,657 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-08-22 22:14:24,550 WARN L193 SmtUtils]: Spent 870.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 22:14:25,603 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 93 [2020-08-22 22:14:25,778 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-08-22 22:14:28,313 WARN L193 SmtUtils]: Spent 2.53 s on a formula simplification that was a NOOP. DAG size: 159 [2020-08-22 22:14:28,636 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-08-22 22:14:28,907 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 22:14:29,231 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-08-22 22:14:30,230 WARN L193 SmtUtils]: Spent 996.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-08-22 22:14:30,239 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 22:14:30,239 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 22:14:30,240 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 22:14:30,240 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 22:14:30,240 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 22:14:30,240 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 22:14:30,241 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (let ((.cse5 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse1 .cse2 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse8 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse6 .cse5 .cse8) (and .cse1 .cse2 .cse6 .cse5 .cse7) (and .cse0 .cse1 .cse5 .cse8 .cse3) (and .cse0 .cse1 .cse6 .cse8 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5) (and .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse1 .cse6 .cse8 .cse7 .cse4) (and .cse1 .cse6 .cse5 .cse8 .cse7) (and .cse1 .cse5 .cse8 .cse7 .cse3) (and .cse0 .cse1 .cse2 .cse6 .cse4))) [2020-08-22 22:14:30,241 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-08-22 22:14:30,241 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 121) the Hoare annotation is: true [2020-08-22 22:14:30,242 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-08-22 22:14:30,242 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-08-22 22:14:30,242 INFO L264 CegarLoopResult]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2020-08-22 22:14:30,242 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-08-22 22:14:30,243 INFO L264 CegarLoopResult]: At program point L86-1(lines 30 116) the Hoare annotation is: (let ((.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p3~0 0)) (.cse5 (= main_~p7~0 0)) (.cse8 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3) (and .cse6 .cse5 .cse7 .cse8 .cse3) (and .cse2 .cse6 .cse9 .cse8 .cse4) (and .cse1 .cse2 .cse9 .cse5 .cse8) (and .cse6 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse1 .cse5 .cse7 .cse3) (and .cse0 .cse1 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse9 .cse5) (and .cse0 .cse2 .cse6 .cse9 .cse4) (and .cse0 .cse6 .cse9 .cse7 .cse4) (and .cse0 .cse2 .cse6 .cse5 .cse3) (and .cse1 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse4) (and .cse1 .cse2 .cse9 .cse8 .cse4) (and .cse6 .cse7 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse1 .cse7 .cse8 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse8 .cse3) (and .cse2 .cse6 .cse9 .cse5 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse7) (and .cse6 .cse9 .cse7 .cse8 .cse4) (and .cse0 .cse6 .cse5 .cse7 .cse3) (and .cse0 .cse6 .cse9 .cse5 .cse7) (and .cse2 .cse6 .cse8 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse5) (and .cse0 .cse1 .cse7 .cse3 .cse4) (and .cse1 .cse9 .cse5 .cse7 .cse8) (and .cse0 .cse6 .cse7 .cse3 .cse4) (and .cse1 .cse5 .cse7 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse9 .cse4) (and .cse2 .cse6 .cse5 .cse8 .cse3))) [2020-08-22 22:14:30,243 INFO L271 CegarLoopResult]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2020-08-22 22:14:30,243 INFO L271 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: true [2020-08-22 22:14:30,243 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-08-22 22:14:30,243 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-08-22 22:14:30,243 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-08-22 22:14:30,243 INFO L264 CegarLoopResult]: At program point L103(line 103) the Hoare annotation is: (let ((.cse0 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse1 (= main_~p7~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse2 .cse4) (and .cse0 .cse2 .cse4) (and .cse1 .cse3 .cse2))) [2020-08-22 22:14:30,244 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-08-22 22:14:30,244 INFO L264 CegarLoopResult]: At program point L120(line 120) the Hoare annotation is: false [2020-08-22 22:14:30,244 INFO L264 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-08-22 22:14:30,244 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-08-22 22:14:30,244 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-08-22 22:14:30,244 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-08-22 22:14:30,244 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (= main_~lk7~0 1) [2020-08-22 22:14:30,244 INFO L264 CegarLoopResult]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2020-08-22 22:14:30,245 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-08-22 22:14:30,245 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 121) the Hoare annotation is: true [2020-08-22 22:14:30,245 INFO L264 CegarLoopResult]: At program point L71-1(lines 30 116) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse11 (= main_~p1~0 0)) (.cse8 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse10 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse8 .cse1 .cse10 .cse7 .cse11 .cse3) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse4) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse11 .cse4) (and .cse0 .cse8 .cse9 .cse6 .cse11 .cse4) (and .cse0 .cse8 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse2 .cse6 .cse11 .cse3 .cse4) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse5) (and .cse8 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse11) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse10 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse5) (and .cse0 .cse8 .cse10 .cse6 .cse11 .cse3) (and .cse2 .cse6 .cse7 .cse11 .cse3 .cse4) (and .cse8 .cse10 .cse6 .cse7 .cse11 .cse3) (and .cse0 .cse2 .cse10 .cse6 .cse11 .cse3) (and .cse8 .cse9 .cse6 .cse7 .cse11 .cse4) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse11 .cse4) (and .cse8 .cse1 .cse9 .cse7 .cse11 .cse4) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse3) (and .cse0 .cse2 .cse10 .cse6 .cse3 .cse5) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse5) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse10 .cse11 .cse3) (and .cse8 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse1 .cse2 .cse10 .cse7 .cse11 .cse3) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse11) (and .cse1 .cse2 .cse10 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse10 .cse6 .cse11) (and .cse8 .cse1 .cse9 .cse10 .cse7 .cse11) (and .cse0 .cse2 .cse9 .cse10 .cse6 .cse5) (and .cse2 .cse9 .cse10 .cse6 .cse7 .cse5) (and .cse2 .cse10 .cse6 .cse7 .cse3 .cse5) (and .cse8 .cse1 .cse7 .cse11 .cse3 .cse4) (and .cse2 .cse10 .cse6 .cse7 .cse11 .cse3) (and .cse0 .cse8 .cse1 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse11) (and .cse1 .cse2 .cse9 .cse7 .cse11 .cse4) (and .cse1 .cse2 .cse7 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse10 .cse7 .cse5))) [2020-08-22 22:14:30,245 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) the Hoare annotation is: false [2020-08-22 22:14:30,246 INFO L264 CegarLoopResult]: At program point L96-1(lines 30 116) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse0 (= main_~p6~0 0)) (.cse5 (= main_~lk7~0 1)) (.cse3 (= main_~p5~0 0)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse1 .cse4 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse1 .cse4))) [2020-08-22 22:14:30,246 INFO L264 CegarLoopResult]: At program point L63-1(lines 30 116) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-08-22 22:14:30,246 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2020-08-22 22:14:30,247 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (let ((.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~p3~0 0)) (.cse0 (= main_~p6~0 0)) (.cse3 (= main_~p7~0 0)) (.cse5 (= main_~lk5~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse2 (= main_~lk2~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse3 .cse7) (and .cse8 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse6 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse3 .cse7 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse9 .cse2 .cse7 .cse10) (and .cse1 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse9 .cse2 .cse3 .cse7) (and .cse6 .cse0 .cse9 .cse2 .cse4 .cse10) (and .cse8 .cse1 .cse9 .cse2 .cse7 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse3) (and .cse6 .cse9 .cse2 .cse3 .cse7 .cse4) (and .cse8 .cse6 .cse0 .cse2 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse10) (and .cse1 .cse9 .cse2 .cse7 .cse4 .cse10) (and .cse6 .cse0 .cse2 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse9 .cse2 .cse3 .cse4) (and .cse8 .cse1 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse3) (and .cse0 .cse1 .cse9 .cse2 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse2 .cse7 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10) (and .cse1 .cse2 .cse7 .cse4 .cse5 .cse10) (and .cse6 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse2 .cse7 .cse4 .cse10))) [2020-08-22 22:14:30,247 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-08-22 22:14:30,247 INFO L264 CegarLoopResult]: At program point L55-1(lines 30 116) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-08-22 22:14:30,247 INFO L264 CegarLoopResult]: At program point L113(line 113) the Hoare annotation is: (= main_~lk7~0 1) [2020-08-22 22:14:30,247 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-08-22 22:14:30,248 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk1~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse8 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse0 .cse5 .cse6 .cse4) (and .cse8 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse5 .cse1 .cse2 .cse4) (and .cse7 .cse8 .cse5 .cse1 .cse4) (and .cse7 .cse0 .cse1 .cse3 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse4) (and .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse7 .cse0 .cse9 .cse3 .cse6) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse8 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse3 .cse6) (and .cse7 .cse0 .cse5 .cse1 .cse9) (and .cse8 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse9 .cse3 .cse6) (and .cse8 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse7 .cse0 .cse5 .cse9 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse3) (and .cse7 .cse8 .cse5 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse3 .cse6) (and .cse7 .cse8 .cse5 .cse1 .cse9))) [2020-08-22 22:14:30,248 INFO L271 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-08-22 22:14:30,248 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-08-22 22:14:30,248 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-08-22 22:14:30,248 INFO L264 CegarLoopResult]: At program point L97(line 97) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~lk5~0 1)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse5) (and .cse0 .cse2 .cse4 .cse5) (and .cse0 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse5) (and .cse0 .cse4 .cse6 .cse5))) [2020-08-22 22:14:30,249 INFO L264 CegarLoopResult]: At program point L64(line 64) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse4 .cse5 .cse3) (and .cse0 .cse1 .cse5) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-08-22 22:14:30,249 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-08-22 22:14:30,249 INFO L271 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-08-22 22:14:30,249 INFO L271 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-08-22 22:14:30,249 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-08-22 22:14:30,250 INFO L264 CegarLoopResult]: At program point L81-1(lines 30 116) the Hoare annotation is: (let ((.cse5 (= main_~lk5~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse6 (= main_~p6~0 0)) (.cse2 (= main_~p7~0 0)) (.cse11 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse9 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse10 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse3) (and .cse8 .cse7 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse0 .cse9 .cse1 .cse3 .cse10) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse9 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse4 .cse5 .cse11 .cse10) (and .cse7 .cse3 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse7 .cse9 .cse2 .cse3 .cse11) (and .cse8 .cse6 .cse7 .cse9 .cse1 .cse2) (and .cse8 .cse0 .cse6 .cse2 .cse5 .cse11) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse6 .cse1 .cse5 .cse10) (and .cse8 .cse0 .cse6 .cse9 .cse11 .cse10) (and .cse8 .cse6 .cse7 .cse9 .cse11 .cse10) (and .cse7 .cse2 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse6 .cse1 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse6 .cse5 .cse11 .cse10) (and .cse8 .cse6 .cse7 .cse2 .cse5 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse5 .cse11) (and .cse6 .cse7 .cse9 .cse1 .cse4 .cse10) (and .cse6 .cse7 .cse1 .cse4 .cse5 .cse10) (and .cse8 .cse0 .cse1 .cse3 .cse5 .cse10) (and .cse8 .cse6 .cse7 .cse9 .cse1 .cse10) (and .cse8 .cse0 .cse3 .cse5 .cse11 .cse10) (and .cse7 .cse9 .cse2 .cse3 .cse4 .cse11) (and .cse7 .cse1 .cse3 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse7 .cse5 .cse11 .cse10) (and .cse0 .cse6 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse4 .cse5 .cse11) (and .cse0 .cse9 .cse2 .cse3 .cse4 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse10) (and .cse8 .cse6 .cse7 .cse1 .cse5 .cse10) (and .cse0 .cse9 .cse3 .cse4 .cse11 .cse10) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse8 .cse6 .cse7 .cse1 .cse2 .cse5) (and .cse6 .cse7 .cse2 .cse4 .cse5 .cse11) (and .cse8 .cse0 .cse9 .cse2 .cse3 .cse11) (and .cse8 .cse0 .cse6 .cse1 .cse2 .cse5) (and .cse8 .cse7 .cse2 .cse3 .cse5 .cse11) (and .cse6 .cse7 .cse9 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse9 .cse3 .cse11 .cse10) (and .cse0 .cse6 .cse9 .cse1 .cse4 .cse10) (and .cse8 .cse7 .cse9 .cse1 .cse2 .cse3) (and .cse8 .cse7 .cse9 .cse1 .cse3 .cse10) (and .cse8 .cse0 .cse6 .cse9 .cse2 .cse11) (and .cse6 .cse7 .cse9 .cse4 .cse11 .cse10) (and .cse0 .cse6 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse6 .cse7 .cse9 .cse2 .cse11) (and .cse8 .cse0 .cse6 .cse9 .cse1 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11) (and .cse0 .cse6 .cse9 .cse4 .cse11 .cse10) (and .cse7 .cse9 .cse1 .cse3 .cse4 .cse10) (and .cse7 .cse9 .cse3 .cse4 .cse11 .cse10) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse7 .cse1 .cse3 .cse5 .cse10) (and .cse0 .cse6 .cse9 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse6 .cse9 .cse1 .cse2) (and .cse8 .cse7 .cse3 .cse5 .cse11 .cse10) (and .cse8 .cse7 .cse9 .cse3 .cse11 .cse10) (and .cse6 .cse7 .cse9 .cse2 .cse4 .cse11) (and .cse0 .cse6 .cse9 .cse2 .cse4 .cse11) (and .cse0 .cse9 .cse1 .cse3 .cse4 .cse10))) [2020-08-22 22:14:30,250 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-08-22 22:14:30,250 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-08-22 22:14:30,250 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-08-22 22:14:30,250 INFO L264 CegarLoopResult]: At program point L106-1(lines 30 116) the Hoare annotation is: (or (= main_~p7~0 0) (= main_~lk7~0 1)) [2020-08-22 22:14:30,250 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-08-22 22:14:30,251 INFO L264 CegarLoopResult]: At program point L98(line 98) the Hoare annotation is: (let ((.cse2 (= main_~p5~0 0)) (.cse3 (= main_~p7~0 0)) (.cse1 (= main_~p6~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse6 (= main_~lk5~0 1)) (.cse4 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse4) (and .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse2 .cse5 .cse4) (and .cse0 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse4) (and .cse0 .cse5 .cse6 .cse4))) [2020-08-22 22:14:30,251 INFO L271 CegarLoopResult]: At program point L32(lines 32 34) the Hoare annotation is: true [2020-08-22 22:14:30,251 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-08-22 22:14:30,251 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-08-22 22:14:30,251 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-08-22 22:14:30,252 INFO L264 CegarLoopResult]: At program point L82(line 82) the Hoare annotation is: (let ((.cse7 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse10 (= main_~p7~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse3 (= main_~lk2~0 1)) (.cse11 (= main_~lk6~0 1)) (.cse4 (= main_~p4~0 0)) (.cse9 (= main_~lk5~0 1)) (.cse5 (= main_~lk1~0 1)) (.cse6 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse11 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse12 .cse5) (and .cse8 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse8 .cse3 .cse10 .cse11 .cse4 .cse9 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse12 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse8 .cse10 .cse11 .cse4 .cse9 .cse12 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse12 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse10 .cse11 .cse9 .cse5) (and .cse7 .cse8 .cse3 .cse11 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse11 .cse12 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse12 .cse5) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse12 .cse5) (and .cse8 .cse3 .cse11 .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse10 .cse11 .cse4 .cse9 .cse12 .cse5) (and .cse7 .cse8 .cse2 .cse3 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse11 .cse12 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse3 .cse11 .cse9 .cse5 .cse6) (and .cse0 .cse3 .cse10 .cse11 .cse4 .cse9 .cse5) (and .cse0 .cse1 .cse4 .cse9 .cse12 .cse5 .cse6) (and .cse1 .cse8 .cse4 .cse9 .cse12 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse11 .cse9 .cse12 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse12 .cse5 .cse6) (and .cse8 .cse2 .cse11 .cse4 .cse12 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse11 .cse12 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse12 .cse5) (and .cse7 .cse8 .cse10 .cse11 .cse9 .cse12 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse12 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse11 .cse4 .cse5) (and .cse0 .cse11 .cse4 .cse9 .cse12 .cse5 .cse6) (and .cse8 .cse11 .cse4 .cse9 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse0 .cse2 .cse11 .cse4 .cse12 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse9 .cse12 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse7 .cse0 .cse3 .cse10 .cse11 .cse9 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse12 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse8 .cse2 .cse10 .cse11 .cse4 .cse12 .cse5) (and .cse7 .cse0 .cse2 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse11 .cse9 .cse12 .cse5) (and .cse0 .cse2 .cse10 .cse11 .cse4 .cse12 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse12 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse12 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse3 .cse11 .cse4 .cse9 .cse5 .cse6))) [2020-08-22 22:14:30,252 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-08-22 22:14:30,252 INFO L264 CegarLoopResult]: At program point L107(line 107) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2020-08-22 22:14:30,252 INFO L271 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-08-22 22:14:30,253 INFO L264 CegarLoopResult]: At program point L91-1(lines 30 116) the Hoare annotation is: (let ((.cse0 (= main_~p5~0 0)) (.cse2 (= main_~p4~0 0)) (.cse1 (= main_~lk6~0 1)) (.cse7 (= main_~p7~0 0)) (.cse5 (= main_~lk4~0 1)) (.cse6 (= main_~p6~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse3 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse5 .cse6 .cse0 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse5 .cse0 .cse7 .cse1) (and .cse5 .cse6 .cse0 .cse3) (and .cse5 .cse1 .cse4 .cse3) (and .cse7 .cse1 .cse2 .cse4) (and .cse6 .cse0 .cse2 .cse3) (and .cse6 .cse7 .cse2 .cse4) (and .cse6 .cse2 .cse4 .cse3) (and .cse6 .cse0 .cse7 .cse2) (and .cse0 .cse7 .cse1 .cse2) (and .cse5 .cse7 .cse1 .cse4) (and .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse6 .cse4 .cse3))) [2020-08-22 22:14:30,253 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-08-22 22:14:30,254 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (let ((.cse9 (= main_~lk4~0 1)) (.cse12 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk6~0 1)) (.cse11 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse10 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse7 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse9 .cse1 .cse10 .cse3 .cse11 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse7 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse3 .cse7 .cse11 .cse5) (and .cse10 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse1 .cse10 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse5 .cse6) (and .cse10 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse9 .cse1 .cse10 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse9 .cse0 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse7 .cse11 .cse12 .cse5) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse12 .cse5) (and .cse10 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse10 .cse2 .cse3 .cse8 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse3 .cse7 .cse8 .cse5) (and .cse9 .cse0 .cse3 .cse8 .cse11 .cse5 .cse6) (and .cse0 .cse3 .cse7 .cse8 .cse4 .cse11 .cse5) (and .cse0 .cse1 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse1 .cse2 .cse12 .cse5 .cse6) (and .cse9 .cse0 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 .cse5) (and .cse9 .cse0 .cse1 .cse11 .cse12 .cse5 .cse6) (and .cse10 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse10 .cse2 .cse7 .cse8 .cse12 .cse5) (and .cse0 .cse1 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse0 .cse1 .cse2 .cse7 .cse12 .cse5) (and .cse9 .cse10 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse10 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5) (and .cse10 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse8 .cse4 .cse11 .cse12 .cse5 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse0 .cse2 .cse8 .cse4 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse2 .cse3 .cse7 .cse5) (and .cse9 .cse0 .cse3 .cse7 .cse8 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse4 .cse12 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse11 .cse5) (and .cse9 .cse0 .cse1 .cse3 .cse11 .cse5 .cse6) (and .cse10 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse0 .cse2 .cse8 .cse12 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse9 .cse0 .cse7 .cse8 .cse11 .cse12 .cse5) (and .cse0 .cse2 .cse7 .cse8 .cse4 .cse12 .cse5) (and .cse9 .cse10 .cse8 .cse11 .cse12 .cse5 .cse6) (and .cse9 .cse1 .cse10 .cse3 .cse7 .cse11 .cse5) (and .cse1 .cse10 .cse7 .cse4 .cse11 .cse12 .cse5) (and .cse0 .cse3 .cse8 .cse4 .cse11 .cse5 .cse6) (and .cse1 .cse10 .cse2 .cse3 .cse7 .cse4 .cse5))) [2020-08-22 22:14:30,254 INFO L264 CegarLoopResult]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1))) (or (and .cse0 (= main_~lk7~0 1)) (and (= main_~p7~0 0) .cse0))) [2020-08-22 22:14:30,255 INFO L264 CegarLoopResult]: At program point L75-1(lines 30 116) the Hoare annotation is: (let ((.cse13 (= main_~p1~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse11 (= main_~p2~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse12 (= main_~lk6~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse6 (= main_~lk7~0 1)) (.cse1 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse2 (= main_~p5~0 0)) (.cse3 (= main_~lk2~0 1)) (.cse10 (= main_~p7~0 0)) (.cse4 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse13) (and .cse7 .cse1 .cse8 .cse10 .cse13 .cse9 .cse11) (and .cse8 .cse3 .cse10 .cse12 .cse4 .cse9 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse12 .cse4 .cse13) (and .cse7 .cse0 .cse2 .cse3 .cse12 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse12 .cse13 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse12 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse13 .cse6) (and .cse0 .cse3 .cse12 .cse4 .cse13 .cse9 .cse6) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse13 .cse9 .cse6) (and .cse8 .cse3 .cse12 .cse4 .cse9 .cse5 .cse6) (and .cse0 .cse10 .cse12 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse2 .cse12 .cse4 .cse13 .cse11 .cse6) (and .cse8 .cse12 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse12 .cse5) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse13 .cse6) (and .cse7 .cse0 .cse3 .cse12 .cse9 .cse5 .cse6) (and .cse0 .cse3 .cse10 .cse12 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse10 .cse13 .cse11) (and .cse1 .cse8 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse7 .cse0 .cse12 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse12 .cse4 .cse13 .cse6) (and .cse0 .cse12 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse1 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse12 .cse4 .cse13) (and .cse7 .cse0 .cse1 .cse2 .cse13 .cse11 .cse6) (and .cse7 .cse8 .cse10 .cse12 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse10 .cse4 .cse13 .cse9 .cse11) (and .cse8 .cse12 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse0 .cse12 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5 .cse6) (and .cse8 .cse3 .cse12 .cse4 .cse13 .cse9 .cse6) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse13 .cse9) (and .cse0 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse8 .cse2 .cse10 .cse12 .cse4 .cse13 .cse11) (and .cse7 .cse0 .cse3 .cse10 .cse12 .cse13 .cse9) (and .cse7 .cse0 .cse2 .cse12 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse10 .cse12 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse13) (and .cse0 .cse2 .cse10 .cse12 .cse4 .cse11 .cse5) (and .cse7 .cse8 .cse10 .cse12 .cse13 .cse9 .cse11) (and .cse7 .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse8 .cse10 .cse12 .cse4 .cse13 .cse9 .cse11) (and .cse1 .cse8 .cse10 .cse4 .cse13 .cse9 .cse11) (and .cse7 .cse8 .cse2 .cse3 .cse10 .cse12 .cse13) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse13) (and .cse7 .cse0 .cse2 .cse12 .cse13 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse10 .cse12 .cse4 .cse5) (and .cse7 .cse0 .cse3 .cse12 .cse13 .cse9 .cse6) (and .cse8 .cse2 .cse3 .cse12 .cse4 .cse13 .cse6) (and .cse8 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6) (and .cse8 .cse2 .cse12 .cse4 .cse13 .cse11 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse11 .cse5 .cse6) (and .cse0 .cse10 .cse12 .cse4 .cse13 .cse9 .cse11) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse9 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse10 .cse13 .cse9) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse11 .cse5) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6) (and .cse7 .cse1 .cse8 .cse2 .cse13 .cse11 .cse6) (and .cse8 .cse10 .cse12 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse13 .cse9) (and .cse7 .cse1 .cse8 .cse2 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse12 .cse9 .cse5 .cse6) (and .cse7 .cse0 .cse2 .cse10 .cse12 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse10 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse13 .cse11) (and .cse7 .cse1 .cse8 .cse2 .cse3 .cse10 .cse13) (and .cse7 .cse8 .cse2 .cse3 .cse12 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse12 .cse13 .cse11 .cse6) (and .cse1 .cse8 .cse4 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse8 .cse2 .cse12 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse10 .cse13 .cse9 .cse11) (and .cse1 .cse8 .cse3 .cse10 .cse4 .cse13 .cse9) (and .cse7 .cse0 .cse10 .cse12 .cse13 .cse9 .cse11) (and .cse7 .cse8 .cse2 .cse3 .cse12 .cse13 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse1 .cse8 .cse3 .cse13 .cse9 .cse6) (and .cse1 .cse8 .cse3 .cse4 .cse13 .cse9 .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse12 .cse13 .cse6) (and .cse1 .cse8 .cse2 .cse4 .cse13 .cse11 .cse6) (and .cse8 .cse2 .cse12 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse12 .cse13 .cse11) (and .cse7 .cse8 .cse3 .cse12 .cse13 .cse9 .cse6) (and .cse7 .cse8 .cse2 .cse10 .cse12 .cse11 .cse5) (and .cse0 .cse3 .cse10 .cse12 .cse4 .cse13 .cse9) (and .cse0 .cse1 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse8 .cse2 .cse3 .cse10 .cse12 .cse4 .cse5) (and .cse8 .cse3 .cse10 .cse12 .cse4 .cse13 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse13 .cse11) (and .cse7 .cse8 .cse3 .cse10 .cse12 .cse13 .cse9) (and .cse7 .cse1 .cse8 .cse9 .cse11 .cse5 .cse6) (and .cse7 .cse0 .cse12 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse0 .cse3 .cse10 .cse12 .cse9 .cse5) (and .cse7 .cse0 .cse2 .cse3 .cse10 .cse12 .cse13) (and .cse0 .cse1 .cse3 .cse10 .cse4 .cse9 .cse5) (and .cse1 .cse8 .cse2 .cse10 .cse4 .cse13 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse13 .cse9 .cse6) (and .cse8 .cse2 .cse10 .cse12 .cse4 .cse11 .cse5) (and .cse7 .cse8 .cse12 .cse13 .cse9 .cse11 .cse6) (and .cse7 .cse0 .cse1 .cse13 .cse9 .cse11 .cse6) (and .cse0 .cse2 .cse10 .cse12 .cse4 .cse13 .cse11) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse13 .cse6) (and .cse7 .cse8 .cse12 .cse9 .cse11 .cse5 .cse6) (and .cse1 .cse8 .cse10 .cse4 .cse9 .cse11 .cse5) (and .cse0 .cse3 .cse12 .cse4 .cse9 .cse5 .cse6) (and .cse1 .cse8 .cse2 .cse3 .cse10 .cse4 .cse5))) [2020-08-22 22:14:30,255 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-08-22 22:14:30,255 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-08-22 22:14:30,255 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-08-22 22:14:30,256 INFO L264 CegarLoopResult]: At program point L67-1(lines 30 116) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk1~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse8 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse0 .cse5 .cse6 .cse4) (and .cse8 .cse5 .cse2 .cse6 .cse4) (and .cse8 .cse5 .cse1 .cse2 .cse4) (and .cse7 .cse8 .cse5 .cse1 .cse4) (and .cse7 .cse0 .cse1 .cse3 .cse4) (and .cse7 .cse0 .cse5 .cse1 .cse4) (and .cse7 .cse8 .cse5 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse7 .cse8 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse7 .cse0 .cse9 .cse3 .cse6) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse8 .cse3 .cse6 .cse4) (and .cse8 .cse2 .cse9 .cse3 .cse6) (and .cse7 .cse0 .cse5 .cse1 .cse9) (and .cse8 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse9 .cse3 .cse6) (and .cse8 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse8 .cse1 .cse9 .cse3) (and .cse7 .cse0 .cse5 .cse9 .cse6) (and .cse7 .cse0 .cse1 .cse9 .cse3) (and .cse7 .cse8 .cse5 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse0 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse1 .cse2 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse3 .cse6) (and .cse7 .cse8 .cse5 .cse1 .cse9))) [2020-08-22 22:14:30,256 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: (let ((.cse3 (= main_~p7~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse2 (= main_~p6~0 0)) (.cse6 (= main_~p5~0 0)) (.cse5 (= main_~lk7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5) (and .cse1 .cse2 .cse6 .cse7 .cse5) (and .cse1 .cse2 .cse7 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse1 .cse8 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse3 .cse8) (and .cse1 .cse2 .cse6 .cse3 .cse7) (and .cse0 .cse1 .cse3 .cse8 .cse4) (and .cse0 .cse1 .cse6 .cse8 .cse5) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse0 .cse1 .cse8 .cse4 .cse5) (and .cse1 .cse6 .cse8 .cse7 .cse5) (and .cse1 .cse6 .cse3 .cse8 .cse7) (and .cse1 .cse3 .cse8 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse6 .cse5))) [2020-08-22 22:14:30,256 INFO L264 CegarLoopResult]: At program point L59-1(lines 30 116) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-08-22 22:14:30,256 INFO L271 CegarLoopResult]: At program point L117(lines 5 121) the Hoare annotation is: true [2020-08-22 22:14:30,257 INFO L271 CegarLoopResult]: At program point L51(lines 51 53) the Hoare annotation is: true [2020-08-22 22:14:30,257 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-08-22 22:14:30,257 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-08-22 22:14:30,257 INFO L264 CegarLoopResult]: At program point L51-2(lines 30 116) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-08-22 22:14:30,257 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-08-22 22:14:30,258 INFO L264 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (let ((.cse6 (= main_~lk6~0 1)) (.cse10 (= main_~p1~0 0)) (.cse8 (= main_~lk3~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~p2~0 0)) (.cse1 (= main_~p6~0 0)) (.cse2 (= main_~p3~0 0)) (.cse9 (= main_~p5~0 0)) (.cse11 (= main_~lk2~0 1)) (.cse7 (= main_~p4~0 0)) (.cse5 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse8 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse4) (and .cse8 .cse1 .cse11 .cse7 .cse10 .cse3) (and .cse0 .cse8 .cse9 .cse6 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse6 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse10 .cse4) (and .cse0 .cse8 .cse9 .cse6 .cse10 .cse4) (and .cse0 .cse8 .cse11 .cse6 .cse3 .cse5) (and .cse8 .cse9 .cse11 .cse6 .cse7 .cse10) (and .cse0 .cse2 .cse6 .cse10 .cse3 .cse4) (and .cse8 .cse1 .cse9 .cse11 .cse7 .cse5) (and .cse8 .cse9 .cse11 .cse6 .cse7 .cse5) (and .cse2 .cse9 .cse11 .cse6 .cse7 .cse10) (and .cse0 .cse8 .cse1 .cse11 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse10) (and .cse8 .cse1 .cse11 .cse7 .cse3 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse11 .cse6 .cse5) (and .cse0 .cse8 .cse11 .cse6 .cse10 .cse3) (and .cse2 .cse6 .cse7 .cse10 .cse3 .cse4) (and .cse8 .cse11 .cse6 .cse7 .cse10 .cse3) (and .cse0 .cse2 .cse11 .cse6 .cse10 .cse3) (and .cse8 .cse9 .cse6 .cse7 .cse10 .cse4) (and .cse1 .cse2 .cse9 .cse7 .cse4 .cse5) (and .cse8 .cse6 .cse7 .cse3 .cse4 .cse5) (and .cse2 .cse9 .cse6 .cse7 .cse10 .cse4) (and .cse8 .cse1 .cse9 .cse7 .cse10 .cse4) (and .cse0 .cse8 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse5) (and .cse0 .cse1 .cse2 .cse11 .cse10 .cse3) (and .cse8 .cse1 .cse9 .cse7 .cse4 .cse5) (and .cse0 .cse2 .cse11 .cse6 .cse3 .cse5) (and .cse8 .cse6 .cse7 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse11 .cse5) (and .cse0 .cse8 .cse1 .cse11 .cse10 .cse3) (and .cse8 .cse11 .cse6 .cse7 .cse3 .cse5) (and .cse0 .cse2 .cse9 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse7 .cse10 .cse3) (and .cse1 .cse2 .cse11 .cse7 .cse3 .cse5) (and .cse0 .cse8 .cse1 .cse9 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse4) (and .cse1 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse8 .cse1 .cse9 .cse11 .cse7 .cse10) (and .cse0 .cse2 .cse9 .cse11 .cse6 .cse5) (and .cse2 .cse9 .cse11 .cse6 .cse7 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse3 .cse5) (and .cse2 .cse11 .cse6 .cse7 .cse10 .cse3) (and .cse8 .cse1 .cse7 .cse10 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse4) (and .cse0 .cse2 .cse9 .cse6 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse11 .cse7 .cse10) (and .cse1 .cse2 .cse7 .cse10 .cse3 .cse4) (and .cse1 .cse2 .cse9 .cse7 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse4) (and .cse0 .cse8 .cse1 .cse9 .cse11 .cse10) (and .cse8 .cse1 .cse7 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse9 .cse4 .cse5) (and .cse1 .cse2 .cse9 .cse11 .cse7 .cse5))) [2020-08-22 22:14:30,258 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-08-22 22:14:30,258 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-08-22 22:14:30,258 INFO L264 CegarLoopResult]: At program point L68(line 68) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-08-22 22:14:30,259 INFO L264 CegarLoopResult]: At program point L101-1(lines 30 116) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse2) (and .cse3 .cse1))) [2020-08-22 22:14:30,259 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-08-22 22:14:30,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 10:14:30 BoogieIcfgContainer [2020-08-22 22:14:30,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 22:14:30,275 INFO L168 Benchmark]: Toolchain (without parser) took 18578.13 ms. Allocated memory was 140.0 MB in the beginning and 633.9 MB in the end (delta: 493.9 MB). Free memory was 104.6 MB in the beginning and 168.3 MB in the end (delta: -63.7 MB). Peak memory consumption was 465.7 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:30,275 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 140.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-08-22 22:14:30,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.87 ms. Allocated memory is still 140.0 MB. Free memory was 104.4 MB in the beginning and 94.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:30,277 INFO L168 Benchmark]: Boogie Preprocessor took 139.12 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 94.0 MB in the beginning and 182.0 MB in the end (delta: -88.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:30,278 INFO L168 Benchmark]: RCFGBuilder took 407.55 ms. Allocated memory is still 203.9 MB. Free memory was 182.0 MB in the beginning and 161.4 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:30,278 INFO L168 Benchmark]: TraceAbstraction took 17744.96 ms. Allocated memory was 203.9 MB in the beginning and 633.9 MB in the end (delta: 429.9 MB). Free memory was 160.7 MB in the beginning and 168.3 MB in the end (delta: -7.6 MB). Peak memory consumption was 457.8 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:30,281 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.27 ms. Allocated memory is still 140.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 280.87 ms. Allocated memory is still 140.0 MB. Free memory was 104.4 MB in the beginning and 94.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.12 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 94.0 MB in the beginning and 182.0 MB in the end (delta: -88.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 407.55 ms. Allocated memory is still 203.9 MB. Free memory was 182.0 MB in the beginning and 161.4 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17744.96 ms. Allocated memory was 203.9 MB in the beginning and 633.9 MB in the end (delta: 429.9 MB). Free memory was 160.7 MB in the beginning and 168.3 MB in the end (delta: -7.6 MB). Peak memory consumption was 457.8 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.4s, 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, 70 GetRequests, 56 SyntacticMatches, 0 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.9s HoareSimplificationTime, 88 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 10.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 819 NumberOfCodeBlocks, 819 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 805 ConstructedInterpolants, 0 QuantifiedInterpolants, 58429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...