/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-3af5e1f [2020-09-04 21:59:59,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:59:59,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:59:59,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:59:59,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:59:59,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:59:59,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:59:59,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:59:59,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:59:59,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:59:59,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:59:59,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:59:59,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:59:59,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:59:59,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:59:59,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:59:59,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:59:59,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:59:59,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:59:59,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:59:59,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:59:59,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:59:59,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:59:59,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:59:59,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:59:59,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:59:59,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:59:59,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:59:59,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:59:59,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:59:59,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:59:59,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:59:59,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:59:59,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:59:59,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:59:59,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:59:59,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:59:59,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:59:59,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:59:59,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:59:59,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:59:59,901 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:59:59,913 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:59:59,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:59:59,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:59:59,916 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:59:59,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:59:59,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:59:59,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:59:59,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:59:59,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:59:59,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:59:59,917 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:59:59,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:59:59,918 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:59:59,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:59:59,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:59:59,918 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:59:59,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:59:59,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:59:59,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:59:59,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:59:59,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:59:59,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:59:59,920 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-09-04 22:00:00,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 22:00:00,385 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 22:00:00,390 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 22:00:00,392 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 22:00:00,394 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 22:00:00,396 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_5.c [2020-09-04 22:00:00,499 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9bb98b540/3657253ab22c427f88c796a810dc450d/FLAG51696f03c [2020-09-04 22:00:01,086 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 22:00:01,087 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/locks/test_locks_5.c [2020-09-04 22:00:01,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9bb98b540/3657253ab22c427f88c796a810dc450d/FLAG51696f03c [2020-09-04 22:00:01,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9bb98b540/3657253ab22c427f88c796a810dc450d [2020-09-04 22:00:01,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 22:00:01,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 22:00:01,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 22:00:01,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 22:00:01,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 22:00:01,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:00:01" (1/1) ... [2020-09-04 22:00:01,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@790fb128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:01, skipping insertion in model container [2020-09-04 22:00:01,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 10:00:01" (1/1) ... [2020-09-04 22:00:01,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 22:00:01,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 22:00:01,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:00:01,702 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 22:00:01,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 22:00:01,743 INFO L208 MainTranslator]: Completed translation [2020-09-04 22:00:01,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:01 WrapperNode [2020-09-04 22:00:01,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 22:00:01,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 22:00:01,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 22:00:01,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 22:00:01,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:01" (1/1) ... [2020-09-04 22:00:01,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:01" (1/1) ... [2020-09-04 22:00:01,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:01" (1/1) ... [2020-09-04 22:00:01,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:01" (1/1) ... [2020-09-04 22:00:01,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:01" (1/1) ... [2020-09-04 22:00:01,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:01" (1/1) ... [2020-09-04 22:00:01,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:01" (1/1) ... [2020-09-04 22:00:01,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 22:00:01,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 22:00:01,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 22:00:01,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 22:00:01,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:01" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 22:00:01,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 22:00:01,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 22:00:01,944 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 22:00:01,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 22:00:01,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 22:00:01,945 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 22:00:01,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 22:00:01,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 22:00:02,260 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 22:00:02,260 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 22:00:02,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:00:02 BoogieIcfgContainer [2020-09-04 22:00:02,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 22:00:02,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 22:00:02,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 22:00:02,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 22:00:02,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 10:00:01" (1/3) ... [2020-09-04 22:00:02,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2a29d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:00:02, skipping insertion in model container [2020-09-04 22:00:02,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 10:00:01" (2/3) ... [2020-09-04 22:00:02,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2a29d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 10:00:02, skipping insertion in model container [2020-09-04 22:00:02,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 10:00:02" (3/3) ... [2020-09-04 22:00:02,281 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2020-09-04 22:00:02,296 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 22:00:02,313 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 22:00:02,367 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 22:00:02,403 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 22:00:02,403 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 22:00:02,403 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 22:00:02,403 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 22:00:02,403 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 22:00:02,404 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 22:00:02,404 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 22:00:02,404 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 22:00:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2020-09-04 22:00:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-04 22:00:02,437 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:02,439 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-09-04 22:00:02,439 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:02,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:02,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1222569836, now seen corresponding path program 1 times [2020-09-04 22:00:02,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:02,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1957040470] [2020-09-04 22:00:02,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:02,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:02,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1957040470] [2020-09-04 22:00:02,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:02,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:02,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41176259] [2020-09-04 22:00:02,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:02,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:02,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:02,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:02,760 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2020-09-04 22:00:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:02,847 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2020-09-04 22:00:02,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:02,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-09-04 22:00:02,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:02,867 INFO L225 Difference]: With dead ends: 147 [2020-09-04 22:00:02,867 INFO L226 Difference]: Without dead ends: 96 [2020-09-04 22:00:02,873 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-09-04 22:00:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-09-04 22:00:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2020-09-04 22:00:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-04 22:00:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2020-09-04 22:00:02,947 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 43 [2020-09-04 22:00:02,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:02,948 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2020-09-04 22:00:02,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2020-09-04 22:00:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 22:00:02,950 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:02,950 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-09-04 22:00:02,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 22:00:02,951 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:02,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:02,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1252462105, now seen corresponding path program 1 times [2020-09-04 22:00:02,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:02,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1453774801] [2020-09-04 22:00:02,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:03,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:03,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1453774801] [2020-09-04 22:00:03,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:03,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:03,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303258615] [2020-09-04 22:00:03,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:03,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:03,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:03,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:03,040 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand 3 states. [2020-09-04 22:00:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:03,077 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2020-09-04 22:00:03,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:03,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-09-04 22:00:03,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:03,081 INFO L225 Difference]: With dead ends: 116 [2020-09-04 22:00:03,082 INFO L226 Difference]: Without dead ends: 114 [2020-09-04 22:00:03,083 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-09-04 22:00:03,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-09-04 22:00:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2020-09-04 22:00:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-04 22:00:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2020-09-04 22:00:03,106 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 44 [2020-09-04 22:00:03,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:03,106 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2020-09-04 22:00:03,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2020-09-04 22:00:03,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 22:00:03,109 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:03,109 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-09-04 22:00:03,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 22:00:03,110 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:03,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:03,110 INFO L82 PathProgramCache]: Analyzing trace with hash 755286414, now seen corresponding path program 1 times [2020-09-04 22:00:03,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:03,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [589791918] [2020-09-04 22:00:03,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:03,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:03,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [589791918] [2020-09-04 22:00:03,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:03,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:03,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376394735] [2020-09-04 22:00:03,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:03,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:03,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:03,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:03,171 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 3 states. [2020-09-04 22:00:03,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:03,229 INFO L93 Difference]: Finished difference Result 226 states and 299 transitions. [2020-09-04 22:00:03,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:03,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-09-04 22:00:03,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:03,233 INFO L225 Difference]: With dead ends: 226 [2020-09-04 22:00:03,233 INFO L226 Difference]: Without dead ends: 157 [2020-09-04 22:00:03,234 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-09-04 22:00:03,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-09-04 22:00:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2020-09-04 22:00:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-09-04 22:00:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 200 transitions. [2020-09-04 22:00:03,270 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 200 transitions. Word has length 44 [2020-09-04 22:00:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:03,270 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 200 transitions. [2020-09-04 22:00:03,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 200 transitions. [2020-09-04 22:00:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-04 22:00:03,273 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:03,273 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-09-04 22:00:03,273 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 22:00:03,273 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:03,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:03,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1863120818, now seen corresponding path program 1 times [2020-09-04 22:00:03,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:03,275 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [284948273] [2020-09-04 22:00:03,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:03,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:03,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [284948273] [2020-09-04 22:00:03,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:03,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:03,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575152004] [2020-09-04 22:00:03,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:03,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:03,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:03,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:03,339 INFO L87 Difference]: Start difference. First operand 155 states and 200 transitions. Second operand 3 states. [2020-09-04 22:00:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:03,406 INFO L93 Difference]: Finished difference Result 191 states and 246 transitions. [2020-09-04 22:00:03,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:03,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-09-04 22:00:03,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:03,410 INFO L225 Difference]: With dead ends: 191 [2020-09-04 22:00:03,410 INFO L226 Difference]: Without dead ends: 189 [2020-09-04 22:00:03,411 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-09-04 22:00:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-09-04 22:00:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2020-09-04 22:00:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-09-04 22:00:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 198 transitions. [2020-09-04 22:00:03,444 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 198 transitions. Word has length 45 [2020-09-04 22:00:03,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:03,445 INFO L479 AbstractCegarLoop]: Abstraction has 155 states and 198 transitions. [2020-09-04 22:00:03,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:03,445 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2020-09-04 22:00:03,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-04 22:00:03,447 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:03,447 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-09-04 22:00:03,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 22:00:03,448 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:03,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:03,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1939288392, now seen corresponding path program 1 times [2020-09-04 22:00:03,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:03,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [788797364] [2020-09-04 22:00:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:03,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:03,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [788797364] [2020-09-04 22:00:03,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:03,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:03,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736805179] [2020-09-04 22:00:03,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:03,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:03,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:03,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:03,495 INFO L87 Difference]: Start difference. First operand 155 states and 198 transitions. Second operand 3 states. [2020-09-04 22:00:03,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:03,562 INFO L93 Difference]: Finished difference Result 403 states and 528 transitions. [2020-09-04 22:00:03,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:03,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-09-04 22:00:03,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:03,566 INFO L225 Difference]: With dead ends: 403 [2020-09-04 22:00:03,567 INFO L226 Difference]: Without dead ends: 273 [2020-09-04 22:00:03,568 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-09-04 22:00:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-09-04 22:00:03,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2020-09-04 22:00:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2020-09-04 22:00:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 346 transitions. [2020-09-04 22:00:03,616 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 346 transitions. Word has length 45 [2020-09-04 22:00:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:03,619 INFO L479 AbstractCegarLoop]: Abstraction has 271 states and 346 transitions. [2020-09-04 22:00:03,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 346 transitions. [2020-09-04 22:00:03,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-09-04 22:00:03,622 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:03,622 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-09-04 22:00:03,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 22:00:03,622 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:03,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:03,624 INFO L82 PathProgramCache]: Analyzing trace with hash -11355582, now seen corresponding path program 1 times [2020-09-04 22:00:03,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:03,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2010459582] [2020-09-04 22:00:03,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:03,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:03,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:03,703 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2010459582] [2020-09-04 22:00:03,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:03,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:03,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589028760] [2020-09-04 22:00:03,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:03,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:03,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:03,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:03,706 INFO L87 Difference]: Start difference. First operand 271 states and 346 transitions. Second operand 3 states. [2020-09-04 22:00:03,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:03,763 INFO L93 Difference]: Finished difference Result 739 states and 956 transitions. [2020-09-04 22:00:03,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:03,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-09-04 22:00:03,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:03,768 INFO L225 Difference]: With dead ends: 739 [2020-09-04 22:00:03,768 INFO L226 Difference]: Without dead ends: 493 [2020-09-04 22:00:03,770 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-09-04 22:00:03,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2020-09-04 22:00:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 491. [2020-09-04 22:00:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-09-04 22:00:03,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 618 transitions. [2020-09-04 22:00:03,823 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 618 transitions. Word has length 46 [2020-09-04 22:00:03,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:03,823 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 618 transitions. [2020-09-04 22:00:03,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 618 transitions. [2020-09-04 22:00:03,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-09-04 22:00:03,828 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:03,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:03,828 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 22:00:03,831 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:03,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:03,831 INFO L82 PathProgramCache]: Analyzing trace with hash 338056749, now seen corresponding path program 1 times [2020-09-04 22:00:03,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:03,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1290468547] [2020-09-04 22:00:03,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:03,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:03,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1290468547] [2020-09-04 22:00:03,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:03,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:03,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520174866] [2020-09-04 22:00:03,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:03,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:03,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:03,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:03,902 INFO L87 Difference]: Start difference. First operand 491 states and 618 transitions. Second operand 3 states. [2020-09-04 22:00:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:03,979 INFO L93 Difference]: Finished difference Result 599 states and 748 transitions. [2020-09-04 22:00:03,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:03,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-09-04 22:00:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:03,984 INFO L225 Difference]: With dead ends: 599 [2020-09-04 22:00:03,984 INFO L226 Difference]: Without dead ends: 597 [2020-09-04 22:00:03,986 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-09-04 22:00:03,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-09-04 22:00:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 491. [2020-09-04 22:00:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-09-04 22:00:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 610 transitions. [2020-09-04 22:00:04,035 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 610 transitions. Word has length 46 [2020-09-04 22:00:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:04,036 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 610 transitions. [2020-09-04 22:00:04,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 610 transitions. [2020-09-04 22:00:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-09-04 22:00:04,040 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:04,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 22:00:04,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 22:00:04,041 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:04,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:04,042 INFO L82 PathProgramCache]: Analyzing trace with hash -144915038, now seen corresponding path program 1 times [2020-09-04 22:00:04,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:04,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1145052550] [2020-09-04 22:00:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:04,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:04,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1145052550] [2020-09-04 22:00:04,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:04,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:04,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860355132] [2020-09-04 22:00:04,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:04,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:04,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:04,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:04,117 INFO L87 Difference]: Start difference. First operand 491 states and 610 transitions. Second operand 3 states. [2020-09-04 22:00:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:04,180 INFO L93 Difference]: Finished difference Result 591 states and 724 transitions. [2020-09-04 22:00:04,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:04,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-09-04 22:00:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:04,185 INFO L225 Difference]: With dead ends: 591 [2020-09-04 22:00:04,185 INFO L226 Difference]: Without dead ends: 589 [2020-09-04 22:00:04,187 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-09-04 22:00:04,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-09-04 22:00:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 491. [2020-09-04 22:00:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-09-04 22:00:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 602 transitions. [2020-09-04 22:00:04,238 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 602 transitions. Word has length 47 [2020-09-04 22:00:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:04,239 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 602 transitions. [2020-09-04 22:00:04,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 602 transitions. [2020-09-04 22:00:04,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-09-04 22:00:04,241 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:04,242 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-09-04 22:00:04,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 22:00:04,242 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:04,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:04,243 INFO L82 PathProgramCache]: Analyzing trace with hash -351776260, now seen corresponding path program 1 times [2020-09-04 22:00:04,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:04,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [55452224] [2020-09-04 22:00:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:04,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:04,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [55452224] [2020-09-04 22:00:04,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:04,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:04,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607774234] [2020-09-04 22:00:04,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:04,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:04,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:04,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:04,327 INFO L87 Difference]: Start difference. First operand 491 states and 602 transitions. Second operand 3 states. [2020-09-04 22:00:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:04,427 INFO L93 Difference]: Finished difference Result 1373 states and 1691 transitions. [2020-09-04 22:00:04,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:04,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2020-09-04 22:00:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:04,430 INFO L225 Difference]: With dead ends: 1373 [2020-09-04 22:00:04,430 INFO L226 Difference]: Without dead ends: 491 [2020-09-04 22:00:04,433 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-09-04 22:00:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2020-09-04 22:00:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2020-09-04 22:00:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-09-04 22:00:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 570 transitions. [2020-09-04 22:00:04,470 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 570 transitions. Word has length 47 [2020-09-04 22:00:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:04,471 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 570 transitions. [2020-09-04 22:00:04,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 570 transitions. [2020-09-04 22:00:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-09-04 22:00:04,472 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 22:00:04,472 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-09-04 22:00:04,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 22:00:04,473 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 22:00:04,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 22:00:04,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2062829121, now seen corresponding path program 1 times [2020-09-04 22:00:04,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 22:00:04,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [937364568] [2020-09-04 22:00:04,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 22:00:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:04,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 22:00:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 22:00:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 22:00:04,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [937364568] [2020-09-04 22:00:04,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 22:00:04,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 22:00:04,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804712582] [2020-09-04 22:00:04,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 22:00:04,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 22:00:04,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 22:00:04,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 22:00:04,542 INFO L87 Difference]: Start difference. First operand 491 states and 570 transitions. Second operand 3 states. [2020-09-04 22:00:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 22:00:04,587 INFO L93 Difference]: Finished difference Result 491 states and 570 transitions. [2020-09-04 22:00:04,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 22:00:04,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-09-04 22:00:04,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 22:00:04,589 INFO L225 Difference]: With dead ends: 491 [2020-09-04 22:00:04,589 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 22:00:04,591 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-09-04 22:00:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 22:00:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 22:00:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 22:00:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 22:00:04,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-09-04 22:00:04,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 22:00:04,592 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 22:00:04,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 22:00:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 22:00:04,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 22:00:04,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 22:00:04,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 22:00:05,412 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 22:00:05,809 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 22:00:06,006 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 22:00:06,116 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-09-04 22:00:06,454 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 22:00:06,765 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-09-04 22:00:06,945 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-09-04 22:00:07,354 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-09-04 22:00:07,457 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 22:00:07,457 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 22:00:07,457 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 22:00:07,457 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 22:00:07,458 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 22:00:07,458 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 22:00:07,458 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 4 93) the Hoare annotation is: true [2020-09-04 22:00:07,458 INFO L264 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (= main_~lk5~0 1) [2020-09-04 22:00:07,458 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-09-04 22:00:07,460 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-09-04 22:00:07,460 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-09-04 22:00:07,460 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-09-04 22:00:07,461 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-09-04 22:00:07,461 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-09-04 22:00:07,461 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-09-04 22:00:07,461 INFO L271 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-09-04 22:00:07,462 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-09-04 22:00:07,462 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-09-04 22:00:07,462 INFO L271 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-09-04 22:00:07,462 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-09-04 22:00:07,463 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-09-04 22:00:07,463 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (or (= main_~p1~0 0) (= main_~lk1~0 1)) [2020-09-04 22:00:07,463 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-09-04 22:00:07,463 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 4 93) the Hoare annotation is: true [2020-09-04 22:00:07,464 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) the Hoare annotation is: false [2020-09-04 22:00:07,464 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-09-04 22:00:07,464 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2020-09-04 22:00:07,464 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-09-04 22:00:07,465 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-09-04 22:00:07,465 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-09-04 22:00:07,465 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-09-04 22:00:07,465 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-09-04 22:00:07,466 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-09-04 22:00:07,466 INFO L271 CegarLoopResult]: At program point L89(lines 5 93) the Hoare annotation is: true [2020-09-04 22:00:07,466 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 22:00:07,466 INFO L271 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: true [2020-09-04 22:00:07,466 INFO L271 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: true [2020-09-04 22:00:07,466 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-09-04 22:00:07,467 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-09-04 22:00:07,467 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-09-04 22:00:07,468 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-09-04 22:00:07,468 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-09-04 22:00:07,468 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-09-04 22:00:07,468 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-09-04 22:00:07,469 INFO L271 CegarLoopResult]: At program point L41(lines 41 43) the Hoare annotation is: true [2020-09-04 22:00:07,469 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-09-04 22:00:07,469 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-09-04 22:00:07,469 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-09-04 22:00:07,469 INFO L271 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-09-04 22:00:07,470 INFO L271 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-09-04 22:00:07,470 INFO L271 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: true [2020-09-04 22:00:07,470 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-09-04 22:00:07,470 INFO L271 CegarLoopResult]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2020-09-04 22:00:07,470 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-09-04 22:00:07,471 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-09-04 22:00:07,471 INFO L271 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: true [2020-09-04 22:00:07,471 INFO L271 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: true [2020-09-04 22:00:07,471 INFO L271 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: true [2020-09-04 22:00:07,471 INFO L264 CegarLoopResult]: At program point L92(line 92) the Hoare annotation is: false [2020-09-04 22:00:07,471 INFO L271 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: true [2020-09-04 22:00:07,472 INFO L264 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: (= main_~lk5~0 1) [2020-09-04 22:00:07,472 INFO L264 CegarLoopResult]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2020-09-04 22:00:07,472 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-09-04 22:00:07,472 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-09-04 22:00:07,472 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-09-04 22:00:07,472 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-09-04 22:00:07,473 INFO L271 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-09-04 22:00:07,473 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-09-04 22:00:07,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 10:00:07 BoogieIcfgContainer [2020-09-04 22:00:07,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 22:00:07,492 INFO L168 Benchmark]: Toolchain (without parser) took 6081.41 ms. Allocated memory was 138.4 MB in the beginning and 283.6 MB in the end (delta: 145.2 MB). Free memory was 103.1 MB in the beginning and 116.9 MB in the end (delta: -13.8 MB). Peak memory consumption was 131.4 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:07,493 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 138.4 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 22:00:07,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.15 ms. Allocated memory is still 138.4 MB. Free memory was 102.8 MB in the beginning and 92.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:07,495 INFO L168 Benchmark]: Boogie Preprocessor took 124.55 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 92.8 MB in the beginning and 180.5 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:07,495 INFO L168 Benchmark]: RCFGBuilder took 398.47 ms. Allocated memory is still 201.9 MB. Free memory was 180.5 MB in the beginning and 163.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:07,496 INFO L168 Benchmark]: TraceAbstraction took 5220.54 ms. Allocated memory was 201.9 MB in the beginning and 283.6 MB in the end (delta: 81.8 MB). Free memory was 162.5 MB in the beginning and 116.9 MB in the end (delta: 45.7 MB). Peak memory consumption was 127.5 MB. Max. memory is 7.1 GB. [2020-09-04 22:00:07,500 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.28 ms. Allocated memory is still 138.4 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 332.15 ms. Allocated memory is still 138.4 MB. Free memory was 102.8 MB in the beginning and 92.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.55 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 92.8 MB in the beginning and 180.5 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 398.47 ms. Allocated memory is still 201.9 MB. Free memory was 180.5 MB in the beginning and 163.2 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5220.54 ms. Allocated memory was 201.9 MB in the beginning and 283.6 MB in the end (delta: 81.8 MB). Free memory was 162.5 MB in the beginning and 116.9 MB in the end (delta: 45.7 MB). Peak memory consumption was 127.5 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: 2.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, 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.1s 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.8s HoareSimplificationTime, 68 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s 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...