/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 22:14:05,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 22:14:05,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 22:14:05,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 22:14:05,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 22:14:05,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 22:14:05,284 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 22:14:05,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 22:14:05,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 22:14:05,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 22:14:05,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 22:14:05,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 22:14:05,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 22:14:05,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 22:14:05,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 22:14:05,303 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 22:14:05,304 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 22:14:05,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 22:14:05,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 22:14:05,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 22:14:05,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 22:14:05,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 22:14:05,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 22:14:05,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 22:14:05,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 22:14:05,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 22:14:05,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 22:14:05,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 22:14:05,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 22:14:05,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 22:14:05,337 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 22:14:05,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 22:14:05,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 22:14:05,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 22:14:05,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 22:14:05,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 22:14:05,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 22:14:05,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 22:14:05,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 22:14:05,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 22:14:05,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 22:14:05,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 22:14:05,360 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 22:14:05,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 22:14:05,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 22:14:05,362 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 22:14:05,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 22:14:05,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 22:14:05,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 22:14:05,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 22:14:05,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 22:14:05,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 22:14:05,364 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 22:14:05,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 22:14:05,365 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 22:14:05,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 22:14:05,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 22:14:05,366 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 22:14:05,366 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 22:14:05,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 22:14:05,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 22:14:05,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 22:14:05,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 22:14:05,367 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 22:14:05,367 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-08-22 22:14:05,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 22:14:05,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 22:14:05,693 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 22:14:05,695 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 22:14:05,696 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 22:14:05,696 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2020-08-22 22:14:05,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d074a3593/3e471ea166934a4e9a71e1f4a0a9dc2f/FLAG3f82de663 [2020-08-22 22:14:06,204 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 22:14:06,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_5.c [2020-08-22 22:14:06,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d074a3593/3e471ea166934a4e9a71e1f4a0a9dc2f/FLAG3f82de663 [2020-08-22 22:14:06,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d074a3593/3e471ea166934a4e9a71e1f4a0a9dc2f [2020-08-22 22:14:06,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 22:14:06,639 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 22:14:06,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 22:14:06,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 22:14:06,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 22:14:06,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:14:06" (1/1) ... [2020-08-22 22:14:06,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f14bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:06, skipping insertion in model container [2020-08-22 22:14:06,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 10:14:06" (1/1) ... [2020-08-22 22:14:06,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 22:14:06,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 22:14:06,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:14:06,912 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 22:14:06,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 22:14:06,960 INFO L208 MainTranslator]: Completed translation [2020-08-22 22:14:06,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:06 WrapperNode [2020-08-22 22:14:06,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 22:14:06,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 22:14:06,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 22:14:06,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 22:14:06,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:06" (1/1) ... [2020-08-22 22:14:06,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:06" (1/1) ... [2020-08-22 22:14:07,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:06" (1/1) ... [2020-08-22 22:14:07,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:06" (1/1) ... [2020-08-22 22:14:07,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:06" (1/1) ... [2020-08-22 22:14:07,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:06" (1/1) ... [2020-08-22 22:14:07,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:06" (1/1) ... [2020-08-22 22:14:07,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 22:14:07,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 22:14:07,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 22:14:07,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 22:14:07,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 22:14:07,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 22:14:07,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 22:14:07,144 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 22:14:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 22:14:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 22:14:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 22:14:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 22:14:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 22:14:07,472 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 22:14:07,473 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-08-22 22:14:07,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:14:07 BoogieIcfgContainer [2020-08-22 22:14:07,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 22:14:07,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 22:14:07,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 22:14:07,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 22:14:07,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 10:14:06" (1/3) ... [2020-08-22 22:14:07,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b2db69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:14:07, skipping insertion in model container [2020-08-22 22:14:07,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 10:14:06" (2/3) ... [2020-08-22 22:14:07,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b2db69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 10:14:07, skipping insertion in model container [2020-08-22 22:14:07,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 10:14:07" (3/3) ... [2020-08-22 22:14:07,486 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2020-08-22 22:14:07,497 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 22:14:07,504 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 22:14:07,518 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 22:14:07,540 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 22:14:07,541 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 22:14:07,541 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 22:14:07,541 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 22:14:07,541 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 22:14:07,541 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 22:14:07,542 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 22:14:07,542 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 22:14:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2020-08-22 22:14:07,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-08-22 22:14:07,570 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:07,571 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] [2020-08-22 22:14:07,572 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:07,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:07,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1222569836, now seen corresponding path program 1 times [2020-08-22 22:14:07,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:07,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1252990596] [2020-08-22 22:14:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:07,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:07,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1252990596] [2020-08-22 22:14:07,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:07,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:07,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145867811] [2020-08-22 22:14:07,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:07,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:07,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:07,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:07,809 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2020-08-22 22:14:07,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:07,887 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2020-08-22 22:14:07,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:07,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-08-22 22:14:07,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:07,901 INFO L225 Difference]: With dead ends: 147 [2020-08-22 22:14:07,901 INFO L226 Difference]: Without dead ends: 96 [2020-08-22 22:14:07,905 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-08-22 22:14:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2020-08-22 22:14:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-08-22 22:14:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2020-08-22 22:14:07,965 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 43 [2020-08-22 22:14:07,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:07,966 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2020-08-22 22:14:07,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2020-08-22 22:14:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-08-22 22:14:07,969 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:07,969 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] [2020-08-22 22:14:07,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 22:14:07,970 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:07,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:07,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1252462105, now seen corresponding path program 1 times [2020-08-22 22:14:07,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:07,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1979242216] [2020-08-22 22:14:07,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:08,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:08,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1979242216] [2020-08-22 22:14:08,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:08,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:08,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603247893] [2020-08-22 22:14:08,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:08,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:08,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:08,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:08,049 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand 3 states. [2020-08-22 22:14:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:08,122 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2020-08-22 22:14:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:08,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-08-22 22:14:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:08,127 INFO L225 Difference]: With dead ends: 116 [2020-08-22 22:14:08,127 INFO L226 Difference]: Without dead ends: 114 [2020-08-22 22:14:08,130 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:08,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-08-22 22:14:08,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2020-08-22 22:14:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-08-22 22:14:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2020-08-22 22:14:08,172 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 44 [2020-08-22 22:14:08,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:08,175 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2020-08-22 22:14:08,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2020-08-22 22:14:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-08-22 22:14:08,177 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:08,177 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] [2020-08-22 22:14:08,177 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 22:14:08,177 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:08,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:08,178 INFO L82 PathProgramCache]: Analyzing trace with hash 755286414, now seen corresponding path program 1 times [2020-08-22 22:14:08,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:08,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [106930234] [2020-08-22 22:14:08,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:08,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:08,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [106930234] [2020-08-22 22:14:08,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:08,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:08,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820355036] [2020-08-22 22:14:08,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:08,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:08,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:08,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:08,229 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 3 states. [2020-08-22 22:14:08,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:08,266 INFO L93 Difference]: Finished difference Result 226 states and 299 transitions. [2020-08-22 22:14:08,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:08,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-08-22 22:14:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:08,268 INFO L225 Difference]: With dead ends: 226 [2020-08-22 22:14:08,269 INFO L226 Difference]: Without dead ends: 157 [2020-08-22 22:14:08,270 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-08-22 22:14:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2020-08-22 22:14:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-08-22 22:14:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 200 transitions. [2020-08-22 22:14:08,316 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 200 transitions. Word has length 44 [2020-08-22 22:14:08,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:08,316 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 200 transitions. [2020-08-22 22:14:08,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 200 transitions. [2020-08-22 22:14:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-08-22 22:14:08,321 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:08,324 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] [2020-08-22 22:14:08,324 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 22:14:08,324 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:08,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:08,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1863120818, now seen corresponding path program 1 times [2020-08-22 22:14:08,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:08,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [598368011] [2020-08-22 22:14:08,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:08,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:08,396 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [598368011] [2020-08-22 22:14:08,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:08,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:08,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428715491] [2020-08-22 22:14:08,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:08,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:08,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:08,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:08,400 INFO L87 Difference]: Start difference. First operand 155 states and 200 transitions. Second operand 3 states. [2020-08-22 22:14:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:08,461 INFO L93 Difference]: Finished difference Result 191 states and 246 transitions. [2020-08-22 22:14:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:08,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-08-22 22:14:08,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:08,467 INFO L225 Difference]: With dead ends: 191 [2020-08-22 22:14:08,467 INFO L226 Difference]: Without dead ends: 189 [2020-08-22 22:14:08,468 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-08-22 22:14:08,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2020-08-22 22:14:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-08-22 22:14:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 198 transitions. [2020-08-22 22:14:08,491 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 198 transitions. Word has length 45 [2020-08-22 22:14:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:08,492 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 198 transitions. [2020-08-22 22:14:08,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2020-08-22 22:14:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-08-22 22:14:08,494 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:08,494 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] [2020-08-22 22:14:08,494 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 22:14:08,495 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1939288392, now seen corresponding path program 1 times [2020-08-22 22:14:08,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:08,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [791653200] [2020-08-22 22:14:08,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:08,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:08,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [791653200] [2020-08-22 22:14:08,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:08,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:08,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969446978] [2020-08-22 22:14:08,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:08,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:08,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:08,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:08,545 INFO L87 Difference]: Start difference. First operand 155 states and 198 transitions. Second operand 3 states. [2020-08-22 22:14:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:08,582 INFO L93 Difference]: Finished difference Result 403 states and 528 transitions. [2020-08-22 22:14:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:08,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-08-22 22:14:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:08,585 INFO L225 Difference]: With dead ends: 403 [2020-08-22 22:14:08,585 INFO L226 Difference]: Without dead ends: 273 [2020-08-22 22:14:08,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-08-22 22:14:08,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2020-08-22 22:14:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2020-08-22 22:14:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 346 transitions. [2020-08-22 22:14:08,616 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 346 transitions. Word has length 45 [2020-08-22 22:14:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:08,616 INFO L479 AbstractCegarLoop]: Abstraction has 271 states and 346 transitions. [2020-08-22 22:14:08,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 346 transitions. [2020-08-22 22:14:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-08-22 22:14:08,619 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:08,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 22:14:08,619 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 22:14:08,619 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:08,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:08,620 INFO L82 PathProgramCache]: Analyzing trace with hash -11355582, now seen corresponding path program 1 times [2020-08-22 22:14:08,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:08,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [463013316] [2020-08-22 22:14:08,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:08,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:08,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [463013316] [2020-08-22 22:14:08,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:08,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:08,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016260661] [2020-08-22 22:14:08,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:08,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:08,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:08,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:08,685 INFO L87 Difference]: Start difference. First operand 271 states and 346 transitions. Second operand 3 states. [2020-08-22 22:14:08,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:08,748 INFO L93 Difference]: Finished difference Result 739 states and 956 transitions. [2020-08-22 22:14:08,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:08,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-08-22 22:14:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:08,751 INFO L225 Difference]: With dead ends: 739 [2020-08-22 22:14:08,752 INFO L226 Difference]: Without dead ends: 493 [2020-08-22 22:14:08,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:08,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2020-08-22 22:14:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2020-08-22 22:14:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-08-22 22:14:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 618 transitions. [2020-08-22 22:14:08,797 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 618 transitions. Word has length 46 [2020-08-22 22:14:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:08,798 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 618 transitions. [2020-08-22 22:14:08,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 618 transitions. [2020-08-22 22:14:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-08-22 22:14:08,801 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:08,801 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] [2020-08-22 22:14:08,801 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 22:14:08,801 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:08,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:08,802 INFO L82 PathProgramCache]: Analyzing trace with hash 338056749, now seen corresponding path program 1 times [2020-08-22 22:14:08,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:08,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1309760428] [2020-08-22 22:14:08,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:08,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:08,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1309760428] [2020-08-22 22:14:08,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:08,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:08,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678135030] [2020-08-22 22:14:08,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:08,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:08,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:08,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:08,844 INFO L87 Difference]: Start difference. First operand 491 states and 618 transitions. Second operand 3 states. [2020-08-22 22:14:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:08,902 INFO L93 Difference]: Finished difference Result 599 states and 748 transitions. [2020-08-22 22:14:08,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:08,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-08-22 22:14:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:08,908 INFO L225 Difference]: With dead ends: 599 [2020-08-22 22:14:08,908 INFO L226 Difference]: Without dead ends: 597 [2020-08-22 22:14:08,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-08-22 22:14:08,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 491. [2020-08-22 22:14:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-08-22 22:14:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 610 transitions. [2020-08-22 22:14:08,950 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 610 transitions. Word has length 46 [2020-08-22 22:14:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:08,951 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 610 transitions. [2020-08-22 22:14:08,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:08,952 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 610 transitions. [2020-08-22 22:14:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-08-22 22:14:08,958 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:08,959 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] [2020-08-22 22:14:08,959 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 22:14:08,959 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:08,959 INFO L82 PathProgramCache]: Analyzing trace with hash -144915038, now seen corresponding path program 1 times [2020-08-22 22:14:08,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:08,960 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [478936110] [2020-08-22 22:14:08,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:09,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:09,013 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [478936110] [2020-08-22 22:14:09,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:09,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:09,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487837810] [2020-08-22 22:14:09,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:09,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:09,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:09,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:09,016 INFO L87 Difference]: Start difference. First operand 491 states and 610 transitions. Second operand 3 states. [2020-08-22 22:14:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:09,084 INFO L93 Difference]: Finished difference Result 591 states and 724 transitions. [2020-08-22 22:14:09,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:09,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-08-22 22:14:09,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:09,089 INFO L225 Difference]: With dead ends: 591 [2020-08-22 22:14:09,090 INFO L226 Difference]: Without dead ends: 589 [2020-08-22 22:14:09,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-08-22 22:14:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 491. [2020-08-22 22:14:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-08-22 22:14:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 602 transitions. [2020-08-22 22:14:09,139 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 602 transitions. Word has length 47 [2020-08-22 22:14:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:09,139 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 602 transitions. [2020-08-22 22:14:09,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 602 transitions. [2020-08-22 22:14:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-08-22 22:14:09,142 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:09,142 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] [2020-08-22 22:14:09,143 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 22:14:09,143 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:09,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash -351776260, now seen corresponding path program 1 times [2020-08-22 22:14:09,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:09,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1496221914] [2020-08-22 22:14:09,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:09,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:09,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1496221914] [2020-08-22 22:14:09,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:09,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:09,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244989402] [2020-08-22 22:14:09,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:09,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:09,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:09,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:09,177 INFO L87 Difference]: Start difference. First operand 491 states and 602 transitions. Second operand 3 states. [2020-08-22 22:14:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:09,273 INFO L93 Difference]: Finished difference Result 1373 states and 1691 transitions. [2020-08-22 22:14:09,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:09,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-08-22 22:14:09,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:09,277 INFO L225 Difference]: With dead ends: 1373 [2020-08-22 22:14:09,277 INFO L226 Difference]: Without dead ends: 491 [2020-08-22 22:14:09,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2020-08-22 22:14:09,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2020-08-22 22:14:09,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-08-22 22:14:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 570 transitions. [2020-08-22 22:14:09,314 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 570 transitions. Word has length 47 [2020-08-22 22:14:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:09,314 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 570 transitions. [2020-08-22 22:14:09,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-08-22 22:14:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-08-22 22:14:09,316 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 22:14:09,316 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] [2020-08-22 22:14:09,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 22:14:09,316 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 22:14:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 22:14:09,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2062829121, now seen corresponding path program 1 times [2020-08-22 22:14:09,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 22:14:09,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [514251350] [2020-08-22 22:14:09,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 22:14:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:09,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 22:14:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 22:14:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 22:14:09,341 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [514251350] [2020-08-22 22:14:09,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 22:14:09,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-08-22 22:14:09,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785732657] [2020-08-22 22:14:09,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 22:14:09,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 22:14:09,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 22:14:09,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:09,343 INFO L87 Difference]: Start difference. First operand 491 states and 570 transitions. Second operand 3 states. [2020-08-22 22:14:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 22:14:09,381 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-08-22 22:14:09,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 22:14:09,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-08-22 22:14:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 22:14:09,382 INFO L225 Difference]: With dead ends: 491 [2020-08-22 22:14:09,382 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 22:14:09,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-08-22 22:14:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 22:14:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 22:14:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 22:14:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 22:14:09,385 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-08-22 22:14:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 22:14:09,385 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 22:14:09,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 22:14:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 22:14:09,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 22:14:09,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 22:14:09,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 22:14:10,113 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-08-22 22:14:10,283 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 22:14:10,656 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 22:14:10,939 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-08-22 22:14:11,091 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-08-22 22:14:11,433 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-08-22 22:14:11,538 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 22:14:11,538 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 22:14:11,538 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 22:14:11,539 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 22:14:11,539 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 22:14:11,539 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 22:14:11,539 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 93) the Hoare annotation is: true [2020-08-22 22:14:11,539 INFO L264 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (= main_~lk5~0 1) [2020-08-22 22:14:11,540 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-08-22 22:14:11,541 INFO L264 CegarLoopResult]: At program point L69(line 69) the Hoare annotation is: (let ((.cse6 (= main_~p5~0 0)) (.cse5 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse0 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse1) (and .cse5 .cse6 .cse1 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse3))) [2020-08-22 22:14:11,542 INFO L264 CegarLoopResult]: At program point L53-1(lines 24 88) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-08-22 22:14:11,542 INFO L264 CegarLoopResult]: At program point L78-1(lines 24 88) the Hoare annotation is: (or (= main_~p5~0 0) (= main_~lk5~0 1)) [2020-08-22 22:14:11,542 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-08-22 22:14:11,542 INFO L264 CegarLoopResult]: At program point L45-1(lines 24 88) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-08-22 22:14:11,542 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-08-22 22:14:11,543 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-08-22 22:14:11,543 INFO L264 CegarLoopResult]: At program point L70(line 70) the Hoare annotation is: (let ((.cse6 (= main_~p5~0 0)) (.cse5 (= main_~lk3~0 1)) (.cse2 (= main_~p4~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse0 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse3 (= main_~lk5~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse6 .cse1) (and .cse4 .cse0 .cse6 .cse1) (and .cse5 .cse6 .cse1 .cse2) (and .cse5 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1 .cse3))) [2020-08-22 22:14:11,543 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-08-22 22:14:11,543 INFO L271 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-08-22 22:14:11,544 INFO L264 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse5 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse0 .cse1 .cse5) (and .cse4 .cse5 .cse3) (and .cse4 .cse3 .cse2) (and .cse4 .cse1 .cse5) (and .cse0 .cse5 .cse3))) [2020-08-22 22:14:11,546 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1))) (or (and .cse0 (= main_~lk5~0 1)) (and .cse0 (= main_~p5~0 0)))) [2020-08-22 22:14:11,546 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-08-22 22:14:11,546 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-08-22 22:14:11,547 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 93) the Hoare annotation is: true [2020-08-22 22:14:11,547 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) the Hoare annotation is: false [2020-08-22 22:14:11,548 INFO L264 CegarLoopResult]: At program point L63-1(lines 24 88) the Hoare annotation is: (let ((.cse6 (= main_~lk3~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse4 (= main_~lk2~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse1 (= main_~p3~0 0)) (.cse7 (= main_~p5~0 0)) (.cse5 (= main_~p4~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse2) (and .cse0 .cse6 .cse7 .cse4) (and .cse6 .cse4 .cse5 .cse2) (and .cse0 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse3) (and .cse6 .cse7 .cse5 .cse3) (and .cse1 .cse7 .cse4 .cse5) (and .cse0 .cse6 .cse4 .cse2) (and .cse6 .cse5 .cse2 .cse3) (and .cse0 .cse6 .cse7 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse6 .cse7 .cse4 .cse5) (and .cse0 .cse1 .cse7 .cse4) (and .cse0 .cse1 .cse4 .cse2) (and .cse1 .cse7 .cse5 .cse3))) [2020-08-22 22:14:11,548 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2020-08-22 22:14:11,548 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-08-22 22:14:11,548 INFO L264 CegarLoopResult]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= main_~lk4~0 1))) (or (and .cse0 (= main_~lk5~0 1)) (and .cse0 (= main_~p5~0 0)))) [2020-08-22 22:14:11,548 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-08-22 22:14:11,549 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-08-22 22:14:11,549 INFO L264 CegarLoopResult]: At program point L64(line 64) the Hoare annotation is: (let ((.cse7 (= main_~p5~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse6 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse7 .cse6 .cse4) (and .cse5 .cse7 .cse2 .cse6 .cse4) (and .cse8 .cse5 .cse7 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse7 .cse1 .cse4) (and .cse8 .cse5 .cse7 .cse6 .cse4) (and .cse8 .cse5 .cse1 .cse3 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse3 .cse6 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4))) [2020-08-22 22:14:11,549 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-08-22 22:14:11,549 INFO L271 CegarLoopResult]: At program point L89(lines 5 93) the Hoare annotation is: true [2020-08-22 22:14:11,550 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-08-22 22:14:11,550 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-08-22 22:14:11,550 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-08-22 22:14:11,550 INFO L264 CegarLoopResult]: At program point L73-1(lines 24 88) the Hoare annotation is: (let ((.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~p5~0 0)) (.cse0 (= main_~p4~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse3 .cse0))) [2020-08-22 22:14:11,550 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-08-22 22:14:11,551 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (let ((.cse7 (= main_~p5~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse6 (= main_~p2~0 0)) (.cse5 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse7 .cse2 .cse6 .cse4) (and .cse5 .cse7 .cse1 .cse2 .cse4) (and .cse5 .cse7 .cse2 .cse6 .cse4) (and .cse8 .cse0 .cse7 .cse6 .cse4) (and .cse8 .cse5 .cse7 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse7 .cse1 .cse4) (and .cse8 .cse5 .cse7 .cse6 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse4) (and .cse8 .cse5 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse8 .cse5 .cse3 .cse6 .cse4) (and .cse5 .cse1 .cse2 .cse3 .cse4))) [2020-08-22 22:14:11,551 INFO L264 CegarLoopResult]: At program point L57-1(lines 24 88) the Hoare annotation is: (let ((.cse0 (= main_~lk3~0 1)) (.cse6 (= main_~p2~0 0)) (.cse2 (= main_~p4~0 0)) (.cse3 (= main_~lk5~0 1)) (.cse4 (= main_~lk1~0 1)) (.cse8 (= main_~lk4~0 1)) (.cse7 (= main_~p3~0 0)) (.cse5 (= main_~p5~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse9 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse6 .cse4) (and .cse7 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse5 .cse6 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse4) (and .cse8 .cse7 .cse5 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse5 .cse1 .cse2 .cse4) (and .cse8 .cse0 .cse9 .cse3 .cse6) (and .cse8 .cse7 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse9 .cse6) (and .cse7 .cse2 .cse9 .cse3 .cse6) (and .cse8 .cse7 .cse3 .cse6 .cse4) (and .cse8 .cse0 .cse5 .cse1 .cse9) (and .cse7 .cse5 .cse1 .cse2 .cse9) (and .cse7 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse9 .cse3 .cse6) (and .cse8 .cse7 .cse1 .cse9 .cse3) (and .cse8 .cse0 .cse5 .cse9 .cse6) (and .cse8 .cse0 .cse1 .cse9 .cse3) (and .cse8 .cse7 .cse5 .cse9 .cse6) (and .cse0 .cse5 .cse1 .cse2 .cse9) (and .cse8 .cse0 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse5 .cse2 .cse9 .cse6) (and .cse8 .cse7 .cse9 .cse3 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse7 .cse5 .cse1 .cse9))) [2020-08-22 22:14:11,552 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-08-22 22:14:11,552 INFO L264 CegarLoopResult]: At program point L49-1(lines 24 88) the Hoare annotation is: (let ((.cse2 (= main_~lk1~0 1)) (.cse0 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p3~0 0)) (.cse1 (= main_~lk2~0 1)) (.cse5 (= main_~p1~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 .cse1 .cse2) (and .cse4 .cse5 .cse3) (and .cse0 .cse1 .cse5) (and .cse4 .cse3 .cse2) (and .cse0 .cse5 .cse3) (and .cse4 .cse1 .cse5))) [2020-08-22 22:14:11,552 INFO L264 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse1 .cse4 .cse3) (and .cse0 .cse1 .cse4))) [2020-08-22 22:14:11,552 INFO L271 CegarLoopResult]: At program point L41(lines 41 43) the Hoare annotation is: true [2020-08-22 22:14:11,552 INFO L264 CegarLoopResult]: At program point L41-2(lines 24 88) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-08-22 22:14:11,553 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-08-22 22:14:11,553 INFO L264 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (let ((.cse6 (= main_~p2~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~p3~0 0)) (.cse3 (= main_~p1~0 0)) (.cse0 (= main_~lk3~0 1)) (.cse1 (= main_~lk2~0 1)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~lk1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse4 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse1 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse4 .cse5 .cse3 .cse6) (and .cse5 .cse2 .cse3 .cse6) (and .cse5 .cse1 .cse2 .cse7) (and .cse0 .cse2 .cse6 .cse7) (and .cse5 .cse2 .cse6 .cse7) (and .cse4 .cse0 .cse6 .cse7) (and .cse4 .cse0 .cse1 .cse3) (and .cse4 .cse0 .cse1 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7))) [2020-08-22 22:14:11,553 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-08-22 22:14:11,553 INFO L271 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-08-22 22:14:11,554 INFO L271 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: true [2020-08-22 22:14:11,554 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (= main_~lk2~0 1)) (.cse2 (= main_~p1~0 0)) (.cse3 (= main_~p2~0 0)) (.cse1 (= main_~lk1~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse2) (and .cse3 .cse1))) [2020-08-22 22:14:11,554 INFO L271 CegarLoopResult]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2020-08-22 22:14:11,554 INFO L264 CegarLoopResult]: At program point L75(line 75) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse4 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse2) (and .cse1 .cse4 .cse3) (and .cse0 .cse1 .cse4))) [2020-08-22 22:14:11,554 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-08-22 22:14:11,554 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-08-22 22:14:11,555 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-08-22 22:14:11,555 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-08-22 22:14:11,555 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: false [2020-08-22 22:14:11,555 INFO L271 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: true [2020-08-22 22:14:11,555 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (= main_~lk5~0 1) [2020-08-22 22:14:11,556 INFO L264 CegarLoopResult]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2020-08-22 22:14:11,556 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-08-22 22:14:11,556 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-08-22 22:14:11,556 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-08-22 22:14:11,556 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-08-22 22:14:11,556 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-08-22 22:14:11,557 INFO L264 CegarLoopResult]: At program point L68-1(lines 24 88) the Hoare annotation is: (let ((.cse1 (= main_~p3~0 0)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse2 (= main_~p5~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse1 .cse5 .cse4) (and .cse1 .cse2 .cse5) (and .cse0 .cse1 .cse4) (and .cse3 .cse5 .cse4) (and .cse3 .cse2 .cse5) (and .cse0 .cse3 .cse2))) [2020-08-22 22:14:11,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 10:14:11 BoogieIcfgContainer [2020-08-22 22:14:11,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 22:14:11,585 INFO L168 Benchmark]: Toolchain (without parser) took 4945.99 ms. Allocated memory was 139.5 MB in the beginning and 281.0 MB in the end (delta: 141.6 MB). Free memory was 103.7 MB in the beginning and 95.1 MB in the end (delta: 8.5 MB). Peak memory consumption was 150.2 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:11,586 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-22 22:14:11,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.60 ms. Allocated memory is still 139.5 MB. Free memory was 103.5 MB in the beginning and 93.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:11,592 INFO L168 Benchmark]: Boogie Preprocessor took 125.68 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 93.5 MB in the beginning and 180.1 MB in the end (delta: -86.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:11,593 INFO L168 Benchmark]: RCFGBuilder took 390.34 ms. Allocated memory is still 202.4 MB. Free memory was 180.1 MB in the beginning and 162.4 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:11,594 INFO L168 Benchmark]: TraceAbstraction took 4103.25 ms. Allocated memory was 202.4 MB in the beginning and 281.0 MB in the end (delta: 78.6 MB). Free memory was 162.4 MB in the beginning and 95.1 MB in the end (delta: 67.2 MB). Peak memory consumption was 146.0 MB. Max. memory is 7.1 GB. [2020-08-22 22:14:11,604 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.17 ms. Allocated memory is still 139.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 321.60 ms. Allocated memory is still 139.5 MB. Free memory was 103.5 MB in the beginning and 93.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.68 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 93.5 MB in the beginning and 180.1 MB in the end (delta: -86.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 390.34 ms. Allocated memory is still 202.4 MB. Free memory was 180.1 MB in the beginning and 162.4 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4103.25 ms. Allocated memory was 202.4 MB in the beginning and 281.0 MB in the end (delta: 78.6 MB). Free memory was 162.4 MB in the beginning and 95.1 MB in the end (delta: 67.2 MB). Peak memory consumption was 146.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 24]: 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, 68 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.8s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 956 SDtfs, 332 SDslu, 668 SDs, 0 SdLazy, 49 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 266 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 956 NumberOfFragments, 2378 HoareAnnotationTreeSize, 68 FomulaSimplifications, 9164 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 68 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 455 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 445 ConstructedInterpolants, 0 QuantifiedInterpolants, 24725 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...