/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 19:00:43,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 19:00:43,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 19:00:43,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 19:00:43,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 19:00:43,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 19:00:43,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 19:00:43,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 19:00:43,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 19:00:43,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 19:00:43,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 19:00:43,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 19:00:43,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 19:00:43,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 19:00:43,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 19:00:43,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 19:00:43,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 19:00:43,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 19:00:43,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 19:00:43,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 19:00:43,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 19:00:43,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 19:00:43,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 19:00:43,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 19:00:43,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 19:00:43,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 19:00:43,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 19:00:43,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 19:00:43,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 19:00:43,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 19:00:43,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 19:00:43,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 19:00:43,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 19:00:43,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 19:00:43,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 19:00:43,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 19:00:43,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 19:00:43,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 19:00:43,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 19:00:43,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 19:00:43,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 19:00:43,569 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 19:00:43,591 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 19:00:43,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 19:00:43,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 19:00:43,594 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 19:00:43,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 19:00:43,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 19:00:43,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 19:00:43,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 19:00:43,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 19:00:43,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 19:00:43,597 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 19:00:43,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 19:00:43,597 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 19:00:43,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 19:00:43,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 19:00:43,599 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 19:00:43,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 19:00:43,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 19:00:43,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 19:00:43,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 19:00:43,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 19:00:43,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 19:00:43,600 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-08-22 19:00:43,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 19:00:43,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 19:00:43,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 19:00:43,929 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 19:00:43,929 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 19:00:43,930 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 19:00:44,016 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e934ccbbc/195e5e5ae7b04be2bf061b9e22abd351/FLAG7a99df8fa [2020-08-22 19:00:44,574 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 19:00:44,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2020-08-22 19:00:44,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e934ccbbc/195e5e5ae7b04be2bf061b9e22abd351/FLAG7a99df8fa [2020-08-22 19:00:44,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e934ccbbc/195e5e5ae7b04be2bf061b9e22abd351 [2020-08-22 19:00:44,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 19:00:44,928 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 19:00:44,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 19:00:44,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 19:00:44,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 19:00:44,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 07:00:44" (1/1) ... [2020-08-22 19:00:44,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2391df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:44, skipping insertion in model container [2020-08-22 19:00:44,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 07:00:44" (1/1) ... [2020-08-22 19:00:44,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 19:00:44,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 19:00:45,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 19:00:45,185 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 19:00:45,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 19:00:45,226 INFO L208 MainTranslator]: Completed translation [2020-08-22 19:00:45,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:45 WrapperNode [2020-08-22 19:00:45,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 19:00:45,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 19:00:45,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 19:00:45,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 19:00:45,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:45" (1/1) ... [2020-08-22 19:00:45,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:45" (1/1) ... [2020-08-22 19:00:45,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:45" (1/1) ... [2020-08-22 19:00:45,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:45" (1/1) ... [2020-08-22 19:00:45,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:45" (1/1) ... [2020-08-22 19:00:45,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:45" (1/1) ... [2020-08-22 19:00:45,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:45" (1/1) ... [2020-08-22 19:00:45,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 19:00:45,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 19:00:45,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 19:00:45,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 19:00:45,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:45" (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 19:00:45,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 19:00:45,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 19:00:45,427 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 19:00:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 19:00:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 19:00:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 19:00:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 19:00:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 19:00:45,790 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 19:00:45,790 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-22 19:00:45,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 07:00:45 BoogieIcfgContainer [2020-08-22 19:00:45,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 19:00:45,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 19:00:45,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 19:00:45,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 19:00:45,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 07:00:44" (1/3) ... [2020-08-22 19:00:45,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f351b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 07:00:45, skipping insertion in model container [2020-08-22 19:00:45,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 07:00:45" (2/3) ... [2020-08-22 19:00:45,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f351b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 07:00:45, skipping insertion in model container [2020-08-22 19:00:45,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 07:00:45" (3/3) ... [2020-08-22 19:00:45,821 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2020-08-22 19:00:45,830 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 19:00:45,839 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 19:00:45,855 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 19:00:45,880 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 19:00:45,881 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 19:00:45,881 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-08-22 19:00:45,881 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 19:00:45,882 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 19:00:45,882 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 19:00:45,882 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 19:00:45,882 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 19:00:45,906 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2020-08-22 19:00:45,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-22 19:00:45,918 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:45,920 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 19:00:45,920 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:45,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:45,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1826051656, now seen corresponding path program 1 times [2020-08-22 19:00:45,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:45,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [316914393] [2020-08-22 19:00:45,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:46,007 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:46,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:46,201 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 19:00:46,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [316914393] [2020-08-22 19:00:46,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:46,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:46,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773313026] [2020-08-22 19:00:46,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:46,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:46,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:46,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:46,242 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2020-08-22 19:00:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:46,328 INFO L93 Difference]: Finished difference Result 191 states and 260 transitions. [2020-08-22 19:00:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:46,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2020-08-22 19:00:46,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:46,352 INFO L225 Difference]: With dead ends: 191 [2020-08-22 19:00:46,353 INFO L226 Difference]: Without dead ends: 128 [2020-08-22 19:00:46,360 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 19:00:46,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-08-22 19:00:46,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2020-08-22 19:00:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-08-22 19:00:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2020-08-22 19:00:46,451 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 55 [2020-08-22 19:00:46,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:46,452 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2020-08-22 19:00:46,452 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2020-08-22 19:00:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-08-22 19:00:46,455 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:46,456 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 19:00:46,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 19:00:46,456 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:46,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:46,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1965492109, now seen corresponding path program 1 times [2020-08-22 19:00:46,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:46,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1494585049] [2020-08-22 19:00:46,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:46,461 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:46,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:46,578 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 19:00:46,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1494585049] [2020-08-22 19:00:46,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:46,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:46,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099302675] [2020-08-22 19:00:46,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:46,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:46,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:46,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:46,583 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 3 states. [2020-08-22 19:00:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:46,624 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2020-08-22 19:00:46,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:46,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-08-22 19:00:46,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:46,628 INFO L225 Difference]: With dead ends: 154 [2020-08-22 19:00:46,628 INFO L226 Difference]: Without dead ends: 152 [2020-08-22 19:00:46,630 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 19:00:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-08-22 19:00:46,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2020-08-22 19:00:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-08-22 19:00:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2020-08-22 19:00:46,662 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 56 [2020-08-22 19:00:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:46,663 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2020-08-22 19:00:46,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2020-08-22 19:00:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-08-22 19:00:46,665 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:46,666 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 19:00:46,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 19:00:46,666 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:46,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:46,667 INFO L82 PathProgramCache]: Analyzing trace with hash 773271458, now seen corresponding path program 1 times [2020-08-22 19:00:46,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:46,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1428514310] [2020-08-22 19:00:46,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:46,670 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:46,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:46,721 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 19:00:46,722 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1428514310] [2020-08-22 19:00:46,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:46,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:46,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344737158] [2020-08-22 19:00:46,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:46,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:46,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:46,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:46,725 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 3 states. [2020-08-22 19:00:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:46,785 INFO L93 Difference]: Finished difference Result 306 states and 415 transitions. [2020-08-22 19:00:46,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:46,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-08-22 19:00:46,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:46,790 INFO L225 Difference]: With dead ends: 306 [2020-08-22 19:00:46,790 INFO L226 Difference]: Without dead ends: 213 [2020-08-22 19:00:46,792 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 19:00:46,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-08-22 19:00:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2020-08-22 19:00:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-08-22 19:00:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2020-08-22 19:00:46,833 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 56 [2020-08-22 19:00:46,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:46,834 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2020-08-22 19:00:46,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:46,835 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2020-08-22 19:00:46,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-08-22 19:00:46,837 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:46,838 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 19:00:46,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 19:00:46,838 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:46,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:46,839 INFO L82 PathProgramCache]: Analyzing trace with hash -610540190, now seen corresponding path program 1 times [2020-08-22 19:00:46,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:46,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675253193] [2020-08-22 19:00:46,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:46,842 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:46,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:46,951 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 19:00:46,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675253193] [2020-08-22 19:00:46,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:46,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:46,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712718751] [2020-08-22 19:00:46,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:46,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:46,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:46,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:46,954 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand 3 states. [2020-08-22 19:00:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:46,995 INFO L93 Difference]: Finished difference Result 259 states and 346 transitions. [2020-08-22 19:00:46,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:46,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-08-22 19:00:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:46,999 INFO L225 Difference]: With dead ends: 259 [2020-08-22 19:00:46,999 INFO L226 Difference]: Without dead ends: 257 [2020-08-22 19:00:47,000 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 19:00:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-08-22 19:00:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 211. [2020-08-22 19:00:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-08-22 19:00:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 278 transitions. [2020-08-22 19:00:47,033 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 278 transitions. Word has length 57 [2020-08-22 19:00:47,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:47,033 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 278 transitions. [2020-08-22 19:00:47,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 278 transitions. [2020-08-22 19:00:47,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-08-22 19:00:47,035 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:47,036 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 19:00:47,036 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 19:00:47,036 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:47,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:47,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1798143236, now seen corresponding path program 1 times [2020-08-22 19:00:47,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:47,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2026770671] [2020-08-22 19:00:47,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:47,039 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:47,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 19:00:47,079 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2026770671] [2020-08-22 19:00:47,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:47,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:47,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029693655] [2020-08-22 19:00:47,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:47,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:47,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:47,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:47,081 INFO L87 Difference]: Start difference. First operand 211 states and 278 transitions. Second operand 3 states. [2020-08-22 19:00:47,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:47,131 INFO L93 Difference]: Finished difference Result 555 states and 752 transitions. [2020-08-22 19:00:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:47,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2020-08-22 19:00:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:47,135 INFO L225 Difference]: With dead ends: 555 [2020-08-22 19:00:47,135 INFO L226 Difference]: Without dead ends: 377 [2020-08-22 19:00:47,138 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 19:00:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-08-22 19:00:47,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2020-08-22 19:00:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-08-22 19:00:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 498 transitions. [2020-08-22 19:00:47,232 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 498 transitions. Word has length 57 [2020-08-22 19:00:47,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:47,237 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 498 transitions. [2020-08-22 19:00:47,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 498 transitions. [2020-08-22 19:00:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-08-22 19:00:47,240 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:47,240 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 19:00:47,240 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 19:00:47,240 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:47,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:47,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1136837537, now seen corresponding path program 1 times [2020-08-22 19:00:47,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:47,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [271450010] [2020-08-22 19:00:47,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:47,244 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:47,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:47,284 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 19:00:47,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [271450010] [2020-08-22 19:00:47,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:47,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:47,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617475344] [2020-08-22 19:00:47,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:47,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:47,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:47,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:47,287 INFO L87 Difference]: Start difference. First operand 375 states and 498 transitions. Second operand 3 states. [2020-08-22 19:00:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:47,342 INFO L93 Difference]: Finished difference Result 459 states and 612 transitions. [2020-08-22 19:00:47,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:47,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-08-22 19:00:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:47,347 INFO L225 Difference]: With dead ends: 459 [2020-08-22 19:00:47,347 INFO L226 Difference]: Without dead ends: 457 [2020-08-22 19:00:47,348 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 19:00:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2020-08-22 19:00:47,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 375. [2020-08-22 19:00:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-08-22 19:00:47,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 494 transitions. [2020-08-22 19:00:47,383 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 494 transitions. Word has length 58 [2020-08-22 19:00:47,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:47,388 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 494 transitions. [2020-08-22 19:00:47,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 494 transitions. [2020-08-22 19:00:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-08-22 19:00:47,399 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:47,399 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 19:00:47,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 19:00:47,402 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:47,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:47,403 INFO L82 PathProgramCache]: Analyzing trace with hash 92380246, now seen corresponding path program 1 times [2020-08-22 19:00:47,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:47,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [856191798] [2020-08-22 19:00:47,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:47,406 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:47,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:47,494 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 19:00:47,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [856191798] [2020-08-22 19:00:47,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:47,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:47,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965231330] [2020-08-22 19:00:47,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:47,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:47,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:47,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:47,497 INFO L87 Difference]: Start difference. First operand 375 states and 494 transitions. Second operand 3 states. [2020-08-22 19:00:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:47,582 INFO L93 Difference]: Finished difference Result 1035 states and 1384 transitions. [2020-08-22 19:00:47,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:47,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2020-08-22 19:00:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:47,588 INFO L225 Difference]: With dead ends: 1035 [2020-08-22 19:00:47,588 INFO L226 Difference]: Without dead ends: 693 [2020-08-22 19:00:47,590 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 19:00:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-08-22 19:00:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2020-08-22 19:00:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-08-22 19:00:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 906 transitions. [2020-08-22 19:00:47,658 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 906 transitions. Word has length 58 [2020-08-22 19:00:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:47,659 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 906 transitions. [2020-08-22 19:00:47,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 906 transitions. [2020-08-22 19:00:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-08-22 19:00:47,661 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:47,662 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 19:00:47,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 19:00:47,662 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:47,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:47,663 INFO L82 PathProgramCache]: Analyzing trace with hash -529027402, now seen corresponding path program 1 times [2020-08-22 19:00:47,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:47,663 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [74199247] [2020-08-22 19:00:47,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:47,665 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:47,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:47,730 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 19:00:47,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [74199247] [2020-08-22 19:00:47,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:47,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:47,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246993042] [2020-08-22 19:00:47,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:47,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:47,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:47,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:47,733 INFO L87 Difference]: Start difference. First operand 691 states and 906 transitions. Second operand 3 states. [2020-08-22 19:00:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:47,810 INFO L93 Difference]: Finished difference Result 839 states and 1100 transitions. [2020-08-22 19:00:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:47,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-08-22 19:00:47,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:47,815 INFO L225 Difference]: With dead ends: 839 [2020-08-22 19:00:47,816 INFO L226 Difference]: Without dead ends: 837 [2020-08-22 19:00:47,817 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 19:00:47,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2020-08-22 19:00:47,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 691. [2020-08-22 19:00:47,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2020-08-22 19:00:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 898 transitions. [2020-08-22 19:00:47,874 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 898 transitions. Word has length 59 [2020-08-22 19:00:47,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:47,874 INFO L479 AbstractCegarLoop]: Abstraction has 691 states and 898 transitions. [2020-08-22 19:00:47,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 898 transitions. [2020-08-22 19:00:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-08-22 19:00:47,876 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:47,876 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 19:00:47,877 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 19:00:47,877 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:47,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:47,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1430933584, now seen corresponding path program 1 times [2020-08-22 19:00:47,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:47,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [952811948] [2020-08-22 19:00:47,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:47,880 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:47,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:47,909 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 19:00:47,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [952811948] [2020-08-22 19:00:47,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:47,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:47,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086912176] [2020-08-22 19:00:47,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:47,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:47,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:47,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:47,912 INFO L87 Difference]: Start difference. First operand 691 states and 898 transitions. Second operand 3 states. [2020-08-22 19:00:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:48,038 INFO L93 Difference]: Finished difference Result 1959 states and 2564 transitions. [2020-08-22 19:00:48,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:48,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-08-22 19:00:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:48,048 INFO L225 Difference]: With dead ends: 1959 [2020-08-22 19:00:48,049 INFO L226 Difference]: Without dead ends: 1301 [2020-08-22 19:00:48,051 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 19:00:48,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2020-08-22 19:00:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1299. [2020-08-22 19:00:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-08-22 19:00:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1666 transitions. [2020-08-22 19:00:48,183 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1666 transitions. Word has length 59 [2020-08-22 19:00:48,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:48,184 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1666 transitions. [2020-08-22 19:00:48,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1666 transitions. [2020-08-22 19:00:48,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-08-22 19:00:48,190 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:48,190 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 19:00:48,190 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 19:00:48,191 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:48,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:48,194 INFO L82 PathProgramCache]: Analyzing trace with hash -631232587, now seen corresponding path program 1 times [2020-08-22 19:00:48,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:48,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [81550428] [2020-08-22 19:00:48,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:48,198 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:48,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:48,251 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 19:00:48,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [81550428] [2020-08-22 19:00:48,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:48,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:48,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458627559] [2020-08-22 19:00:48,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:48,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:48,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:48,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:48,254 INFO L87 Difference]: Start difference. First operand 1299 states and 1666 transitions. Second operand 3 states. [2020-08-22 19:00:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:48,373 INFO L93 Difference]: Finished difference Result 1559 states and 1988 transitions. [2020-08-22 19:00:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:48,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-08-22 19:00:48,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:48,383 INFO L225 Difference]: With dead ends: 1559 [2020-08-22 19:00:48,383 INFO L226 Difference]: Without dead ends: 1557 [2020-08-22 19:00:48,385 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 19:00:48,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2020-08-22 19:00:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1299. [2020-08-22 19:00:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2020-08-22 19:00:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1650 transitions. [2020-08-22 19:00:48,505 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1650 transitions. Word has length 60 [2020-08-22 19:00:48,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:48,505 INFO L479 AbstractCegarLoop]: Abstraction has 1299 states and 1650 transitions. [2020-08-22 19:00:48,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1650 transitions. [2020-08-22 19:00:48,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-08-22 19:00:48,507 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:48,508 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 19:00:48,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 19:00:48,508 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:48,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:48,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1409021686, now seen corresponding path program 1 times [2020-08-22 19:00:48,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:48,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1175461977] [2020-08-22 19:00:48,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:48,512 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:48,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:48,554 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 19:00:48,556 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1175461977] [2020-08-22 19:00:48,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:48,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:48,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168168222] [2020-08-22 19:00:48,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:48,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:48,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:48,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:48,559 INFO L87 Difference]: Start difference. First operand 1299 states and 1650 transitions. Second operand 3 states. [2020-08-22 19:00:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:48,762 INFO L93 Difference]: Finished difference Result 3735 states and 4756 transitions. [2020-08-22 19:00:48,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:48,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-08-22 19:00:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:48,776 INFO L225 Difference]: With dead ends: 3735 [2020-08-22 19:00:48,776 INFO L226 Difference]: Without dead ends: 2469 [2020-08-22 19:00:48,780 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 19:00:48,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2020-08-22 19:00:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2467. [2020-08-22 19:00:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-08-22 19:00:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3074 transitions. [2020-08-22 19:00:48,969 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3074 transitions. Word has length 60 [2020-08-22 19:00:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:48,969 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 3074 transitions. [2020-08-22 19:00:48,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3074 transitions. [2020-08-22 19:00:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-22 19:00:48,972 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:48,973 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 19:00:48,973 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 19:00:48,973 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:48,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash -729752476, now seen corresponding path program 1 times [2020-08-22 19:00:48,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:48,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2129124912] [2020-08-22 19:00:48,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:48,977 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:49,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:49,023 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 19:00:49,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2129124912] [2020-08-22 19:00:49,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:49,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:49,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797512264] [2020-08-22 19:00:49,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:49,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:49,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:49,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:49,026 INFO L87 Difference]: Start difference. First operand 2467 states and 3074 transitions. Second operand 3 states. [2020-08-22 19:00:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:49,381 INFO L93 Difference]: Finished difference Result 7143 states and 8900 transitions. [2020-08-22 19:00:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:49,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-08-22 19:00:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:49,402 INFO L225 Difference]: With dead ends: 7143 [2020-08-22 19:00:49,402 INFO L226 Difference]: Without dead ends: 3637 [2020-08-22 19:00:49,410 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 19:00:49,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2020-08-22 19:00:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3635. [2020-08-22 19:00:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2020-08-22 19:00:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 4370 transitions. [2020-08-22 19:00:49,765 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 4370 transitions. Word has length 61 [2020-08-22 19:00:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:49,766 INFO L479 AbstractCegarLoop]: Abstraction has 3635 states and 4370 transitions. [2020-08-22 19:00:49,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 4370 transitions. [2020-08-22 19:00:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-22 19:00:49,770 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:49,771 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 19:00:49,771 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 19:00:49,771 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:49,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:49,772 INFO L82 PathProgramCache]: Analyzing trace with hash 495374346, now seen corresponding path program 1 times [2020-08-22 19:00:49,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:49,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1609942517] [2020-08-22 19:00:49,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:49,777 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:49,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:49,818 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 19:00:49,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1609942517] [2020-08-22 19:00:49,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:49,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:49,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635103771] [2020-08-22 19:00:49,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:49,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:49,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:49,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:49,823 INFO L87 Difference]: Start difference. First operand 3635 states and 4370 transitions. Second operand 3 states. [2020-08-22 19:00:50,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:50,134 INFO L93 Difference]: Finished difference Result 4087 states and 4852 transitions. [2020-08-22 19:00:50,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:50,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-08-22 19:00:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:50,153 INFO L225 Difference]: With dead ends: 4087 [2020-08-22 19:00:50,153 INFO L226 Difference]: Without dead ends: 2917 [2020-08-22 19:00:50,160 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 19:00:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-08-22 19:00:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2467. [2020-08-22 19:00:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2020-08-22 19:00:50,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 2914 transitions. [2020-08-22 19:00:50,387 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 2914 transitions. Word has length 61 [2020-08-22 19:00:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:50,387 INFO L479 AbstractCegarLoop]: Abstraction has 2467 states and 2914 transitions. [2020-08-22 19:00:50,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 2914 transitions. [2020-08-22 19:00:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-08-22 19:00:50,390 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 19:00:50,390 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 19:00:50,391 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 19:00:50,391 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 19:00:50,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 19:00:50,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1060451273, now seen corresponding path program 1 times [2020-08-22 19:00:50,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 19:00:50,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [336663708] [2020-08-22 19:00:50,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 19:00:50,399 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 19:00:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:50,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 19:00:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 19:00:50,428 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 19:00:50,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [336663708] [2020-08-22 19:00:50,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 19:00:50,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 19:00:50,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502264340] [2020-08-22 19:00:50,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 19:00:50,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 19:00:50,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 19:00:50,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 19:00:50,431 INFO L87 Difference]: Start difference. First operand 2467 states and 2914 transitions. Second operand 3 states. [2020-08-22 19:00:50,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 19:00:50,555 INFO L93 Difference]: Finished difference Result 2467 states and 2914 transitions. [2020-08-22 19:00:50,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 19:00:50,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-08-22 19:00:50,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 19:00:50,556 INFO L225 Difference]: With dead ends: 2467 [2020-08-22 19:00:50,556 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 19:00:50,562 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 19:00:50,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 19:00:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 19:00:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 19:00:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 19:00:50,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2020-08-22 19:00:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 19:00:50,563 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 19:00:50,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 19:00:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 19:00:50,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 19:00:50,564 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-22 19:00:50,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 19:00:50,694 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 19:00:50,953 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 35 [2020-08-22 19:00:51,363 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 340 DAG size of output: 7 [2020-08-22 19:00:51,776 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 91 [2020-08-22 19:00:52,051 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 23 [2020-08-22 19:00:52,172 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 11 [2020-08-22 19:00:52,493 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 91 [2020-08-22 19:00:52,936 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2020-08-22 19:00:53,235 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 15 [2020-08-22 19:00:54,554 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 19:00:55,009 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-08-22 19:00:55,248 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 19:00:55,765 WARN L193 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-08-22 19:00:56,741 WARN L193 SmtUtils]: Spent 919.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 19:00:56,897 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-08-22 19:00:57,058 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 19:00:57,473 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-08-22 19:00:58,378 WARN L193 SmtUtils]: Spent 895.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-08-22 19:00:59,407 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 93 [2020-08-22 19:00:59,573 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-08-22 19:01:02,151 WARN L193 SmtUtils]: Spent 2.57 s on a formula simplification that was a NOOP. DAG size: 159 [2020-08-22 19:01:02,488 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-08-22 19:01:02,772 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 19:01:03,104 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-08-22 19:01:04,107 WARN L193 SmtUtils]: Spent 1000.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-08-22 19:01:04,116 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 19:01:04,116 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 19:01:04,116 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 19:01:04,116 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 19:01:04,116 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 19:01:04,116 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 19:01:04,117 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 19:01:04,117 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 19:01:04,118 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 121) the Hoare annotation is: true [2020-08-22 19:01:04,118 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-08-22 19:01:04,118 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-08-22 19:01:04,118 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 19:01:04,118 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-08-22 19:01:04,119 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 19:01:04,119 INFO L271 CegarLoopResult]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2020-08-22 19:01:04,119 INFO L271 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: true [2020-08-22 19:01:04,119 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-08-22 19:01:04,119 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-08-22 19:01:04,119 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-08-22 19:01:04,119 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 19:01:04,120 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-08-22 19:01:04,120 INFO L264 CegarLoopResult]: At program point L120(line 120) the Hoare annotation is: false [2020-08-22 19:01:04,120 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 19:01:04,120 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-08-22 19:01:04,120 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-08-22 19:01:04,120 INFO L271 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: true [2020-08-22 19:01:04,120 INFO L264 CegarLoopResult]: At program point L112(line 112) the Hoare annotation is: (= main_~lk7~0 1) [2020-08-22 19:01:04,120 INFO L264 CegarLoopResult]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2020-08-22 19:01:04,121 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-08-22 19:01:04,121 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 121) the Hoare annotation is: true [2020-08-22 19:01:04,121 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 19:01:04,122 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) the Hoare annotation is: false [2020-08-22 19:01:04,122 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 19:01:04,122 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 19:01:04,122 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2020-08-22 19:01:04,123 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 19:01:04,123 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-08-22 19:01:04,123 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 19:01:04,123 INFO L264 CegarLoopResult]: At program point L113(line 113) the Hoare annotation is: (= main_~lk7~0 1) [2020-08-22 19:01:04,123 INFO L271 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: true [2020-08-22 19:01:04,123 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 19:01:04,123 INFO L271 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-08-22 19:01:04,124 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-08-22 19:01:04,124 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-08-22 19:01:04,124 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 19:01:04,124 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 19:01:04,124 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-08-22 19:01:04,124 INFO L271 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-08-22 19:01:04,124 INFO L271 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-08-22 19:01:04,124 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 19:01:04,125 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 19:01:04,125 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-08-22 19:01:04,125 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-08-22 19:01:04,125 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-08-22 19:01:04,125 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 19:01:04,125 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-08-22 19:01:04,125 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 19:01:04,126 INFO L271 CegarLoopResult]: At program point L32(lines 32 34) the Hoare annotation is: true [2020-08-22 19:01:04,126 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-08-22 19:01:04,126 INFO L271 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-08-22 19:01:04,126 INFO L271 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-08-22 19:01:04,127 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 19:01:04,127 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-08-22 19:01:04,127 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 19:01:04,127 INFO L271 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-08-22 19:01:04,128 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 19:01:04,128 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-08-22 19:01:04,128 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 19:01:04,129 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 19:01:04,130 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 19:01:04,130 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-08-22 19:01:04,130 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-08-22 19:01:04,130 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-08-22 19:01:04,131 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 19:01:04,131 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 19:01:04,131 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 19:01:04,132 INFO L271 CegarLoopResult]: At program point L117(lines 5 121) the Hoare annotation is: true [2020-08-22 19:01:04,132 INFO L271 CegarLoopResult]: At program point L51(lines 51 53) the Hoare annotation is: true [2020-08-22 19:01:04,132 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-08-22 19:01:04,132 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-08-22 19:01:04,132 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 19:01:04,132 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-08-22 19:01:04,133 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 19:01:04,133 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-08-22 19:01:04,133 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-08-22 19:01:04,133 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 19:01:04,134 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 19:01:04,134 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-08-22 19:01:04,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 07:01:04 BoogieIcfgContainer [2020-08-22 19:01:04,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 19:01:04,152 INFO L168 Benchmark]: Toolchain (without parser) took 19224.31 ms. Allocated memory was 140.0 MB in the beginning and 642.8 MB in the end (delta: 502.8 MB). Free memory was 104.1 MB in the beginning and 231.7 MB in the end (delta: -127.5 MB). Peak memory consumption was 473.2 MB. Max. memory is 7.1 GB. [2020-08-22 19:01:04,153 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 19:01:04,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.55 ms. Allocated memory is still 140.0 MB. Free memory was 103.9 MB in the beginning and 93.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-08-22 19:01:04,154 INFO L168 Benchmark]: Boogie Preprocessor took 133.92 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 93.7 MB in the beginning and 182.1 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-08-22 19:01:04,155 INFO L168 Benchmark]: RCFGBuilder took 434.88 ms. Allocated memory is still 203.9 MB. Free memory was 182.1 MB in the beginning and 161.6 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2020-08-22 19:01:04,156 INFO L168 Benchmark]: TraceAbstraction took 18338.77 ms. Allocated memory was 203.9 MB in the beginning and 642.8 MB in the end (delta: 438.8 MB). Free memory was 161.0 MB in the beginning and 231.7 MB in the end (delta: -70.7 MB). Peak memory consumption was 466.1 MB. Max. memory is 7.1 GB. [2020-08-22 19:01:04,159 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 297.55 ms. Allocated memory is still 140.0 MB. Free memory was 103.9 MB in the beginning and 93.7 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.92 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 93.7 MB in the beginning and 182.1 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 434.88 ms. Allocated memory is still 203.9 MB. Free memory was 182.1 MB in the beginning and 161.6 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18338.77 ms. Allocated memory was 203.9 MB in the beginning and 642.8 MB in the end (delta: 438.8 MB). Free memory was 161.0 MB in the beginning and 231.7 MB in the end (delta: -70.7 MB). Peak memory consumption was 466.1 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.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.5s, 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.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1022 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 88 LocationsWithAnnotation, 88 PreInvPairs, 4768 NumberOfFragments, 13918 HoareAnnotationTreeSize, 88 FomulaSimplifications, 98944 FormulaSimplificationTreeSizeReduction, 2.8s HoareSimplificationTime, 88 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 10.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...