/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/loops-crafted-1/sumt5.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 23:24:02,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 23:24:02,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 23:24:02,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 23:24:02,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 23:24:02,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 23:24:02,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 23:24:02,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 23:24:02,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 23:24:02,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 23:24:02,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 23:24:02,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 23:24:02,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 23:24:02,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 23:24:02,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 23:24:02,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 23:24:02,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 23:24:02,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 23:24:02,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 23:24:02,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 23:24:02,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 23:24:02,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 23:24:02,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 23:24:02,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 23:24:02,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 23:24:02,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 23:24:02,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 23:24:02,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 23:24:02,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 23:24:02,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 23:24:02,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 23:24:02,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 23:24:02,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 23:24:02,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 23:24:02,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 23:24:02,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 23:24:02,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 23:24:02,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 23:24:02,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 23:24:02,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 23:24:02,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 23:24:02,959 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 23:24:02,972 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 23:24:02,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 23:24:02,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 23:24:02,974 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 23:24:02,974 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 23:24:02,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 23:24:02,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 23:24:02,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 23:24:02,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 23:24:02,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 23:24:02,975 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 23:24:02,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 23:24:02,976 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 23:24:02,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 23:24:02,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 23:24:02,977 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 23:24:02,977 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 23:24:02,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 23:24:02,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 23:24:02,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 23:24:02,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 23:24:02,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 23:24:02,978 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 23:24:03,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 23:24:03,528 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 23:24:03,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 23:24:03,538 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 23:24:03,538 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 23:24:03,540 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c [2020-09-04 23:24:03,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c4aaab4e0/64984caf99614eb28bcc00b38c3a59e5/FLAG3c0c19b05 [2020-09-04 23:24:04,216 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 23:24:04,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loops-crafted-1/sumt5.c [2020-09-04 23:24:04,226 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c4aaab4e0/64984caf99614eb28bcc00b38c3a59e5/FLAG3c0c19b05 [2020-09-04 23:24:04,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c4aaab4e0/64984caf99614eb28bcc00b38c3a59e5 [2020-09-04 23:24:04,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 23:24:04,573 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 23:24:04,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 23:24:04,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 23:24:04,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 23:24:04,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:24:04" (1/1) ... [2020-09-04 23:24:04,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44dc5d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:04, skipping insertion in model container [2020-09-04 23:24:04,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 11:24:04" (1/1) ... [2020-09-04 23:24:04,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 23:24:04,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 23:24:04,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:24:04,887 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 23:24:04,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 23:24:04,939 INFO L208 MainTranslator]: Completed translation [2020-09-04 23:24:04,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:04 WrapperNode [2020-09-04 23:24:04,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 23:24:04,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 23:24:04,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 23:24:04,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 23:24:04,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:04" (1/1) ... [2020-09-04 23:24:04,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:04" (1/1) ... [2020-09-04 23:24:04,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:04" (1/1) ... [2020-09-04 23:24:04,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:04" (1/1) ... [2020-09-04 23:24:05,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:04" (1/1) ... [2020-09-04 23:24:05,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:04" (1/1) ... [2020-09-04 23:24:05,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:04" (1/1) ... [2020-09-04 23:24:05,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 23:24:05,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 23:24:05,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 23:24:05,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 23:24:05,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:04" (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 23:24:05,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 23:24:05,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 23:24:05,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 23:24:05,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 23:24:05,166 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 23:24:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 23:24:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 23:24:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 23:24:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 23:24:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 23:24:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 23:24:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 23:24:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 23:24:05,472 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 23:24:05,473 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 23:24:05,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:24:05 BoogieIcfgContainer [2020-09-04 23:24:05,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 23:24:05,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 23:24:05,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 23:24:05,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 23:24:05,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 11:24:04" (1/3) ... [2020-09-04 23:24:05,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eefe4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:24:05, skipping insertion in model container [2020-09-04 23:24:05,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 11:24:04" (2/3) ... [2020-09-04 23:24:05,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eefe4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 11:24:05, skipping insertion in model container [2020-09-04 23:24:05,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 11:24:05" (3/3) ... [2020-09-04 23:24:05,493 INFO L109 eAbstractionObserver]: Analyzing ICFG sumt5.c [2020-09-04 23:24:05,508 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 23:24:05,520 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 23:24:05,548 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 23:24:05,580 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 23:24:05,581 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 23:24:05,581 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 23:24:05,581 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 23:24:05,581 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 23:24:05,582 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 23:24:05,582 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 23:24:05,582 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 23:24:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-09-04 23:24:05,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 23:24:05,618 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:05,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] [2020-09-04 23:24:05,620 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:05,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:05,631 INFO L82 PathProgramCache]: Analyzing trace with hash -687260303, now seen corresponding path program 1 times [2020-09-04 23:24:05,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:05,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [573407483] [2020-09-04 23:24:05,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:05,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:05,828 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 23:24:05,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [573407483] [2020-09-04 23:24:05,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:24:05,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 23:24:05,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458009376] [2020-09-04 23:24:05,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 23:24:05,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:05,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 23:24:05,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 23:24:05,864 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-09-04 23:24:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:05,947 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2020-09-04 23:24:05,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 23:24:05,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 23:24:05,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:05,972 INFO L225 Difference]: With dead ends: 52 [2020-09-04 23:24:05,972 INFO L226 Difference]: Without dead ends: 32 [2020-09-04 23:24:05,981 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 23:24:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-09-04 23:24:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-09-04 23:24:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-09-04 23:24:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-09-04 23:24:06,036 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 21 [2020-09-04 23:24:06,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:06,036 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-09-04 23:24:06,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 23:24:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-09-04 23:24:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 23:24:06,038 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:06,038 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] [2020-09-04 23:24:06,039 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 23:24:06,039 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:06,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:06,040 INFO L82 PathProgramCache]: Analyzing trace with hash -715889454, now seen corresponding path program 1 times [2020-09-04 23:24:06,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:06,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1561267576] [2020-09-04 23:24:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:06,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:06,696 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 23:24:06,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1561267576] [2020-09-04 23:24:06,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 23:24:06,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 23:24:06,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535374621] [2020-09-04 23:24:06,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:24:06,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:06,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:24:06,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:24:06,702 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 12 states. [2020-09-04 23:24:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:07,533 INFO L93 Difference]: Finished difference Result 91 states and 116 transitions. [2020-09-04 23:24:07,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 23:24:07,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-09-04 23:24:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:07,537 INFO L225 Difference]: With dead ends: 91 [2020-09-04 23:24:07,538 INFO L226 Difference]: Without dead ends: 72 [2020-09-04 23:24:07,540 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2020-09-04 23:24:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-09-04 23:24:07,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 34. [2020-09-04 23:24:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-09-04 23:24:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-09-04 23:24:07,557 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 21 [2020-09-04 23:24:07,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:07,558 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-09-04 23:24:07,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:24:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-09-04 23:24:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 23:24:07,559 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:07,560 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] [2020-09-04 23:24:07,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 23:24:07,560 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:07,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:07,561 INFO L82 PathProgramCache]: Analyzing trace with hash -805340680, now seen corresponding path program 1 times [2020-09-04 23:24:07,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:07,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1163173890] [2020-09-04 23:24:07,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:08,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:24:08,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1163173890] [2020-09-04 23:24:08,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:24:08,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 23:24:08,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977777617] [2020-09-04 23:24:08,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 23:24:08,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:08,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 23:24:08,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2020-09-04 23:24:08,637 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 18 states. [2020-09-04 23:24:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:12,268 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2020-09-04 23:24:12,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 23:24:12,268 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2020-09-04 23:24:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:12,274 INFO L225 Difference]: With dead ends: 87 [2020-09-04 23:24:12,274 INFO L226 Difference]: Without dead ends: 82 [2020-09-04 23:24:12,276 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2020-09-04 23:24:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-09-04 23:24:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 37. [2020-09-04 23:24:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-09-04 23:24:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-09-04 23:24:12,311 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-09-04 23:24:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:12,312 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-09-04 23:24:12,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 23:24:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-09-04 23:24:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-09-04 23:24:12,314 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:12,314 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 23:24:12,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 23:24:12,316 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:12,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:12,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1490056162, now seen corresponding path program 2 times [2020-09-04 23:24:12,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:12,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [916115578] [2020-09-04 23:24:12,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:12,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:24:12,642 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [916115578] [2020-09-04 23:24:12,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:24:12,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 23:24:12,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771000900] [2020-09-04 23:24:12,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 23:24:12,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:12,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 23:24:12,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-09-04 23:24:12,644 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2020-09-04 23:24:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:13,021 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2020-09-04 23:24:13,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 23:24:13,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-09-04 23:24:13,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:13,023 INFO L225 Difference]: With dead ends: 62 [2020-09-04 23:24:13,023 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 23:24:13,024 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:24:13,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 23:24:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2020-09-04 23:24:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 23:24:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2020-09-04 23:24:13,040 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2020-09-04 23:24:13,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:13,040 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2020-09-04 23:24:13,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 23:24:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-09-04 23:24:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 23:24:13,042 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:13,042 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 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 23:24:13,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 23:24:13,042 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:13,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:13,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1369450661, now seen corresponding path program 1 times [2020-09-04 23:24:13,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:13,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1469882693] [2020-09-04 23:24:13,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:13,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:24:13,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1469882693] [2020-09-04 23:24:13,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:24:13,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-04 23:24:13,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211035094] [2020-09-04 23:24:13,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 23:24:13,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:13,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 23:24:13,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 23:24:13,145 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 5 states. [2020-09-04 23:24:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:13,328 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2020-09-04 23:24:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 23:24:13,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-09-04 23:24:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:13,330 INFO L225 Difference]: With dead ends: 61 [2020-09-04 23:24:13,330 INFO L226 Difference]: Without dead ends: 45 [2020-09-04 23:24:13,331 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:24:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-04 23:24:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-09-04 23:24:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-09-04 23:24:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-09-04 23:24:13,358 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 30 [2020-09-04 23:24:13,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:13,359 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-09-04 23:24:13,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 23:24:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-09-04 23:24:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 23:24:13,360 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:13,361 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 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 23:24:13,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 23:24:13,361 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:13,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:13,362 INFO L82 PathProgramCache]: Analyzing trace with hash -895592636, now seen corresponding path program 1 times [2020-09-04 23:24:13,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:13,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [343716119] [2020-09-04 23:24:13,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:13,764 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 29 [2020-09-04 23:24:14,003 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2020-09-04 23:24:14,231 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2020-09-04 23:24:14,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:24:14,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [343716119] [2020-09-04 23:24:14,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:24:14,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 23:24:14,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377501200] [2020-09-04 23:24:14,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:24:14,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:14,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:24:14,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:24:14,301 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 10 states. [2020-09-04 23:24:14,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:14,977 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2020-09-04 23:24:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 23:24:14,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-09-04 23:24:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:14,981 INFO L225 Difference]: With dead ends: 59 [2020-09-04 23:24:14,984 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 23:24:14,985 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-09-04 23:24:14,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 23:24:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2020-09-04 23:24:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-09-04 23:24:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-09-04 23:24:15,027 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 31 [2020-09-04 23:24:15,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:15,028 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-09-04 23:24:15,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:24:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-09-04 23:24:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-09-04 23:24:15,037 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:15,038 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 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 23:24:15,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 23:24:15,039 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:15,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:15,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1240166497, now seen corresponding path program 1 times [2020-09-04 23:24:15,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:15,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [539160155] [2020-09-04 23:24:15,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:16,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:24:16,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [539160155] [2020-09-04 23:24:16,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:24:16,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 23:24:16,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146101104] [2020-09-04 23:24:16,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 23:24:16,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:16,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 23:24:16,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2020-09-04 23:24:16,326 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 20 states. [2020-09-04 23:24:17,432 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2020-09-04 23:24:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:18,248 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2020-09-04 23:24:18,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 23:24:18,249 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2020-09-04 23:24:18,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:18,251 INFO L225 Difference]: With dead ends: 70 [2020-09-04 23:24:18,251 INFO L226 Difference]: Without dead ends: 65 [2020-09-04 23:24:18,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 23:24:18,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-09-04 23:24:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 44. [2020-09-04 23:24:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-04 23:24:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2020-09-04 23:24:18,300 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 32 [2020-09-04 23:24:18,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:18,303 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2020-09-04 23:24:18,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 23:24:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-09-04 23:24:18,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 23:24:18,304 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:18,304 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 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 23:24:18,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 23:24:18,305 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:18,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:18,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1007147513, now seen corresponding path program 2 times [2020-09-04 23:24:18,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:18,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [370615238] [2020-09-04 23:24:18,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:18,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:24:19,023 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [370615238] [2020-09-04 23:24:19,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:24:19,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 23:24:19,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319544408] [2020-09-04 23:24:19,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 23:24:19,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 23:24:19,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-09-04 23:24:19,026 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 12 states. [2020-09-04 23:24:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:19,776 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2020-09-04 23:24:19,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 23:24:19,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2020-09-04 23:24:19,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:19,779 INFO L225 Difference]: With dead ends: 69 [2020-09-04 23:24:19,779 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 23:24:19,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2020-09-04 23:24:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 23:24:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2020-09-04 23:24:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-04 23:24:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-09-04 23:24:19,795 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 36 [2020-09-04 23:24:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:19,795 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-09-04 23:24:19,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 23:24:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-09-04 23:24:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-04 23:24:19,796 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:19,797 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 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 23:24:19,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 23:24:19,797 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:19,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:19,798 INFO L82 PathProgramCache]: Analyzing trace with hash 715815570, now seen corresponding path program 1 times [2020-09-04 23:24:19,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:19,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1537354618] [2020-09-04 23:24:19,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:19,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:24:19,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1537354618] [2020-09-04 23:24:19,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:24:19,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 23:24:19,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324600496] [2020-09-04 23:24:19,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 23:24:19,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:19,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 23:24:19,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 23:24:19,883 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2020-09-04 23:24:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:20,097 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2020-09-04 23:24:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 23:24:20,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-09-04 23:24:20,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:20,099 INFO L225 Difference]: With dead ends: 68 [2020-09-04 23:24:20,100 INFO L226 Difference]: Without dead ends: 52 [2020-09-04 23:24:20,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-09-04 23:24:20,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-09-04 23:24:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2020-09-04 23:24:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-09-04 23:24:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-09-04 23:24:20,119 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 37 [2020-09-04 23:24:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:20,120 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-09-04 23:24:20,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 23:24:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-09-04 23:24:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-09-04 23:24:20,121 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:20,121 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 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 23:24:20,122 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 23:24:20,122 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:20,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:20,122 INFO L82 PathProgramCache]: Analyzing trace with hash -676848915, now seen corresponding path program 1 times [2020-09-04 23:24:20,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:20,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [752744684] [2020-09-04 23:24:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:20,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:24:20,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [752744684] [2020-09-04 23:24:20,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:24:20,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 23:24:20,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721174708] [2020-09-04 23:24:20,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 23:24:20,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:20,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 23:24:20,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-09-04 23:24:20,549 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 10 states. [2020-09-04 23:24:38,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:38,494 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2020-09-04 23:24:38,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 23:24:38,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2020-09-04 23:24:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:38,496 INFO L225 Difference]: With dead ends: 67 [2020-09-04 23:24:38,496 INFO L226 Difference]: Without dead ends: 51 [2020-09-04 23:24:38,497 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-09-04 23:24:38,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-09-04 23:24:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2020-09-04 23:24:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-09-04 23:24:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-09-04 23:24:38,517 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 38 [2020-09-04 23:24:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:38,517 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-09-04 23:24:38,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 23:24:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-09-04 23:24:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-09-04 23:24:38,518 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:38,518 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 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 23:24:38,519 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 23:24:38,519 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:38,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:38,519 INFO L82 PathProgramCache]: Analyzing trace with hash 130279800, now seen corresponding path program 1 times [2020-09-04 23:24:38,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:38,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2073352266] [2020-09-04 23:24:38,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:39,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:24:39,903 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2073352266] [2020-09-04 23:24:39,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:24:39,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-04 23:24:39,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286285092] [2020-09-04 23:24:39,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 23:24:39,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:39,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 23:24:39,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2020-09-04 23:24:39,906 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 22 states. [2020-09-04 23:24:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:44,436 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2020-09-04 23:24:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 23:24:44,437 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 39 [2020-09-04 23:24:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:44,439 INFO L225 Difference]: With dead ends: 91 [2020-09-04 23:24:44,439 INFO L226 Difference]: Without dead ends: 72 [2020-09-04 23:24:44,441 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=244, Invalid=1162, Unknown=0, NotChecked=0, Total=1406 [2020-09-04 23:24:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-09-04 23:24:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2020-09-04 23:24:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-09-04 23:24:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-09-04 23:24:44,456 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 39 [2020-09-04 23:24:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:44,456 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-09-04 23:24:44,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 23:24:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-09-04 23:24:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-04 23:24:44,457 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:44,458 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 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 23:24:44,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 23:24:44,458 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:44,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2144322658, now seen corresponding path program 2 times [2020-09-04 23:24:44,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:44,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [347746096] [2020-09-04 23:24:44,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:45,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:24:45,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [347746096] [2020-09-04 23:24:45,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:24:45,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-04 23:24:45,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110140880] [2020-09-04 23:24:45,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 23:24:45,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:45,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 23:24:45,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-09-04 23:24:45,190 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 13 states. [2020-09-04 23:24:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:46,046 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2020-09-04 23:24:46,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 23:24:46,047 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2020-09-04 23:24:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:46,048 INFO L225 Difference]: With dead ends: 76 [2020-09-04 23:24:46,048 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 23:24:46,049 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2020-09-04 23:24:46,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 23:24:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2020-09-04 23:24:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-09-04 23:24:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2020-09-04 23:24:46,071 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 43 [2020-09-04 23:24:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:46,071 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2020-09-04 23:24:46,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 23:24:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-09-04 23:24:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 23:24:46,077 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:46,078 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 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 23:24:46,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 23:24:46,078 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:46,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:46,079 INFO L82 PathProgramCache]: Analyzing trace with hash -176875557, now seen corresponding path program 1 times [2020-09-04 23:24:46,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:46,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [981108133] [2020-09-04 23:24:46,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:46,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 23:24:46,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [981108133] [2020-09-04 23:24:46,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:24:46,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 23:24:46,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158784895] [2020-09-04 23:24:46,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 23:24:46,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:46,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 23:24:46,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 23:24:46,193 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 7 states. [2020-09-04 23:24:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:46,491 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2020-09-04 23:24:46,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 23:24:46,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2020-09-04 23:24:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:46,493 INFO L225 Difference]: With dead ends: 72 [2020-09-04 23:24:46,493 INFO L226 Difference]: Without dead ends: 56 [2020-09-04 23:24:46,494 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-09-04 23:24:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-09-04 23:24:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2020-09-04 23:24:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-04 23:24:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2020-09-04 23:24:46,518 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 44 [2020-09-04 23:24:46,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:46,518 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2020-09-04 23:24:46,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 23:24:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2020-09-04 23:24:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-04 23:24:46,519 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 23:24:46,519 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 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 23:24:46,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 23:24:46,520 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 23:24:46,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 23:24:46,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1714497220, now seen corresponding path program 1 times [2020-09-04 23:24:46,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 23:24:46,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1035319290] [2020-09-04 23:24:46,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 23:24:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:47,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 23:24:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 23:24:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 23:24:47,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1035319290] [2020-09-04 23:24:47,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 23:24:47,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 23:24:47,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969981122] [2020-09-04 23:24:47,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 23:24:47,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 23:24:47,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 23:24:47,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2020-09-04 23:24:47,382 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 19 states. [2020-09-04 23:24:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 23:24:48,691 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2020-09-04 23:24:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 23:24:48,692 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2020-09-04 23:24:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 23:24:48,692 INFO L225 Difference]: With dead ends: 55 [2020-09-04 23:24:48,693 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 23:24:48,695 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 23:24:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 23:24:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 23:24:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 23:24:48,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 23:24:48,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2020-09-04 23:24:48,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 23:24:48,696 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 23:24:48,697 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 23:24:48,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 23:24:48,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 23:24:48,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 23:24:48,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 23:24:48,829 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 102 [2020-09-04 23:24:48,957 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 105 [2020-09-04 23:24:49,081 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 99 [2020-09-04 23:24:49,218 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 112 [2020-09-04 23:24:49,997 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 136 [2020-09-04 23:24:50,331 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 43 [2020-09-04 23:24:50,719 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2020-09-04 23:24:50,915 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2020-09-04 23:24:51,238 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2020-09-04 23:24:51,422 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2020-09-04 23:24:51,538 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2020-09-04 23:24:52,027 WARN L193 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 47 [2020-09-04 23:24:52,152 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2020-09-04 23:24:52,490 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 43 [2020-09-04 23:24:52,497 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-09-04 23:24:52,497 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~SIZE~0 |old(~SIZE~0)|) [2020-09-04 23:24:52,498 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-09-04 23:24:52,498 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 23:24:52,498 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-09-04 23:24:52,498 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 23:24:52,498 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 23:24:52,498 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:24:52,499 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:24:52,499 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-09-04 23:24:52,499 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-09-04 23:24:52,499 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-09-04 23:24:52,499 INFO L264 CegarLoopResult]: At program point L27(lines 27 30) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 .cse0) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 23:24:52,499 INFO L264 CegarLoopResult]: At program point L27-2(lines 21 30) the Hoare annotation is: (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0)) (.cse5 (+ main_~l~0 1))) (let ((.cse3 (* 4294967296 (div main_~n~0 4294967296))) (.cse4 (<= .cse1 .cse5))) (or (not (<= ~SIZE~0 20000001)) (let ((.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= 1 .cse1) (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 main_~i~0) (<= (+ .cse3 main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0 main_~n~0)) (<= .cse2 main_~l~0) (<= main_~l~0 0) .cse4 (<= .cse0 0))) (not (<= 20000001 ~SIZE~0)) (and (<= (+ .cse3 main_~l~0 3) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) .cse4 (<= .cse5 .cse1))))) [2020-09-04 23:24:52,500 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 14 35) the Hoare annotation is: true [2020-09-04 23:24:52,500 INFO L264 CegarLoopResult]: At program point L23(lines 23 30) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 .cse0) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 23:24:52,500 INFO L264 CegarLoopResult]: At program point L19-2(lines 19 32) the Hoare annotation is: (let ((.cse9 (+ main_~i~0 main_~k~0)) (.cse8 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (let ((.cse3 (<= .cse8 main_~l~0)) (.cse0 (<= 0 .cse9)) (.cse2 (<= main_~l~0 .cse8)) (.cse4 (<= main_~i~0 0)) (.cse5 (<= 0 main_~i~0)) (.cse1 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse6 (<= .cse9 0))) (or (and .cse0 (<= 0 .cse1) .cse2 .cse3 .cse4 (<= 1 main_~l~0) (<= .cse1 0) .cse5 .cse6 (<= (* 4294967295 main_~l~0) 4294967295)) (not (<= ~SIZE~0 20000001)) (and .cse2 (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) .cse3) (not (<= 20000001 ~SIZE~0)) (let ((.cse7 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0))) (and .cse0 .cse2 .cse4 (<= main_~l~0 .cse1) (<= 0 .cse7) (<= .cse8 0) .cse5 (<= .cse7 main_~l~0) (<= .cse1 main_~l~0) .cse6))))) [2020-09-04 23:24:52,501 INFO L264 CegarLoopResult]: At program point L19-3(lines 19 32) the Hoare annotation is: (let ((.cse2 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (or (let ((.cse1 (+ main_~l~0 (* 4294967296 (div .cse2 4294967296)))) (.cse0 (* 4294967296 (div main_~l~0 4294967296)))) (and (<= main_~i~0 0) (<= (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0 .cse0) .cse1) (<= 0 main_~i~0) (< .cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0 .cse0 1)))) (not (<= ~SIZE~0 20000001)) (and (<= main_~l~0 .cse2) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse2 main_~l~0)) (not (<= 20000001 ~SIZE~0)))) [2020-09-04 23:24:52,501 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-09-04 23:24:52,501 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (<= main_~i~0 0) (<= 0 main_~i~0)) (not (<= 20000001 ~SIZE~0))) [2020-09-04 23:24:52,501 INFO L264 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~i~0 0) (<= 0 main_~i~0) (<= .cse0 0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 23:24:52,501 INFO L264 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (or (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= 0 .cse1) (<= main_~i~0 0) (<= .cse1 0) (<= 0 main_~i~0) (<= .cse0 0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-09-04 23:24:52,501 INFO L264 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 .cse0) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 23:24:52,501 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 .cse0) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 23:24:52,502 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (or (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~i~0 0) (<= main_~l~0 .cse1) (<= 0 main_~i~0) (<= .cse1 main_~l~0) (<= main_~l~0 0) (<= .cse0 0) (<= 0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-09-04 23:24:52,502 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (or (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~i~0 0) (<= 0 .cse1) (<= main_~l~0 .cse2) (<= 0 main_~i~0) (<= .cse1 main_~l~0) (<= .cse2 main_~l~0) (<= main_~l~0 0) (<= .cse0 0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-09-04 23:24:52,502 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-09-04 23:24:52,502 INFO L264 CegarLoopResult]: At program point L25(lines 25 30) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 .cse0) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 23:24:52,502 INFO L264 CegarLoopResult]: At program point L21(lines 21 30) the Hoare annotation is: (let ((.cse4 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (let ((.cse1 (<= main_~l~0 .cse4)) (.cse5 (* 4294967296 (div main_~n~0 4294967296)))) (or (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) .cse1 (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 .cse3) (<= .cse4 0) (<= 0 main_~i~0) (<= .cse3 main_~l~0) (<= (+ .cse5 main_~l~0 1) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0 main_~n~0)) (<= .cse2 main_~l~0) (<= .cse0 0))) (not (<= ~SIZE~0 20000001)) (and .cse1 (<= (+ .cse5 main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse4 main_~l~0)) (not (<= 20000001 ~SIZE~0))))) [2020-09-04 23:24:52,502 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0)) (.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~l~0 .cse1) (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 .cse3) (<= .cse1 0) (<= 0 main_~i~0) (<= .cse3 main_~l~0) (<= .cse2 main_~l~0) (<= .cse0 0)))) [2020-09-04 23:24:52,503 INFO L264 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0)) (.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~l~0 .cse1) (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 .cse3) (<= .cse1 0) (<= 0 main_~i~0) (<= .cse3 main_~l~0) (<= .cse2 main_~l~0) (<= .cse0 0)))) [2020-09-04 23:24:52,503 INFO L264 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0)) (.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~l~0 .cse1) (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 .cse3) (<= .cse1 0) (<= 0 main_~i~0) (<= .cse3 main_~l~0) (<= .cse2 main_~l~0) (<= .cse0 0)))) [2020-09-04 23:24:52,503 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 14 35) the Hoare annotation is: true [2020-09-04 23:24:52,503 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 .cse0) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 23:24:52,503 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 14 35) the Hoare annotation is: true [2020-09-04 23:24:52,503 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (and (<= main_~l~0 .cse0) (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse0 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-09-04 23:24:52,504 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse4 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0))) (let ((.cse1 (<= main_~l~0 .cse4)) (.cse5 (* 4294967296 (div main_~n~0 4294967296)))) (or (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) .cse1 (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 .cse3) (<= .cse4 0) (<= 0 main_~i~0) (<= .cse3 main_~l~0) (<= (+ .cse5 main_~l~0 1) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0 main_~n~0)) (<= .cse2 main_~l~0) (<= .cse0 0))) (not (<= ~SIZE~0 20000001)) (and .cse1 (<= (+ .cse5 main_~l~0 2) (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~n~0 main_~v4~0)) (<= .cse4 main_~l~0)) (not (<= 20000001 ~SIZE~0))))) [2020-09-04 23:24:52,504 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0 main_~v4~0)) (.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v3~0)) (.cse2 (+ main_~i~0 main_~j~0 main_~k~0)) (.cse0 (+ main_~i~0 main_~k~0))) (and (<= 0 .cse0) (<= main_~l~0 .cse1) (<= main_~i~0 0) (<= main_~l~0 .cse2) (<= 0 .cse3) (<= .cse1 0) (<= 0 main_~i~0) (<= .cse3 main_~l~0) (<= .cse2 main_~l~0) (<= .cse0 0)))) [2020-09-04 23:24:52,504 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-09-04 23:24:52,504 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-09-04 23:24:52,504 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-09-04 23:24:52,505 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 23:24:52,505 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 23:24:52,505 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-09-04 23:24:52,505 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 23:24:52,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 11:24:52 BoogieIcfgContainer [2020-09-04 23:24:52,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 23:24:52,535 INFO L168 Benchmark]: Toolchain (without parser) took 47963.13 ms. Allocated memory was 145.2 MB in the beginning and 346.6 MB in the end (delta: 201.3 MB). Free memory was 102.8 MB in the beginning and 253.0 MB in the end (delta: -150.1 MB). Peak memory consumption was 212.9 MB. Max. memory is 7.1 GB. [2020-09-04 23:24:52,536 INFO L168 Benchmark]: CDTParser took 1.00 ms. Allocated memory is still 145.2 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 23:24:52,536 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.22 ms. Allocated memory is still 145.2 MB. Free memory was 102.6 MB in the beginning and 92.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-09-04 23:24:52,537 INFO L168 Benchmark]: Boogie Preprocessor took 139.40 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 92.8 MB in the beginning and 181.4 MB in the end (delta: -88.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-09-04 23:24:52,538 INFO L168 Benchmark]: RCFGBuilder took 400.71 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 165.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2020-09-04 23:24:52,539 INFO L168 Benchmark]: TraceAbstraction took 47049.60 ms. Allocated memory was 202.4 MB in the beginning and 346.6 MB in the end (delta: 144.2 MB). Free memory was 164.7 MB in the beginning and 253.0 MB in the end (delta: -88.3 MB). Peak memory consumption was 217.5 MB. Max. memory is 7.1 GB. [2020-09-04 23:24:52,542 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00 ms. Allocated memory is still 145.2 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 365.22 ms. Allocated memory is still 145.2 MB. Free memory was 102.6 MB in the beginning and 92.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 139.40 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 92.8 MB in the beginning and 181.4 MB in the end (delta: -88.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 400.71 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 165.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47049.60 ms. Allocated memory was 202.4 MB in the beginning and 346.6 MB in the end (delta: 144.2 MB). Free memory was 164.7 MB in the beginning and 253.0 MB in the end (delta: -88.3 MB). Peak memory consumption was 217.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 19]: Loop Invariant Derived loop invariant: ((((((((((((0 <= i + k && 0 <= i + j + k) && l <= i + j + k + v3 + v4) && i + j + k + v3 + v4 <= l) && i <= 0) && 1 <= l) && i + j + k <= 0) && 0 <= i) && i + k <= 0) && 4294967295 * l <= 4294967295) || !(SIZE <= 20000001)) || ((l <= i + j + k + v3 + v4 && 4294967296 * (n / 4294967296) + l + 2 <= i + j + k + v3 + n + v4) && i + j + k + v3 + v4 <= l)) || !(20000001 <= SIZE)) || (((((((((0 <= i + k && l <= i + j + k + v3 + v4) && i <= 0) && l <= i + j + k) && 0 <= i + j + k + v3) && i + j + k + v3 + v4 <= 0) && 0 <= i) && i + j + k + v3 <= l) && i + j + k <= l) && i + k <= 0) - ProcedureContractResult [Line: 14]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 43.1s, OverallIterations: 14, TraceHistogramMax: 4, AutomataDifference: 33.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 351 SDtfs, 2168 SDslu, 467 SDs, 0 SdLazy, 3055 SolverSat, 309 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 25.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=13, 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, 14 MinimizatonAttempts, 169 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 40 LocationsWithAnnotation, 130 PreInvPairs, 204 NumberOfFragments, 1393 HoareAnnotationTreeSize, 130 FomulaSimplifications, 3309793 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 40 FomulaSimplificationsInter, 3257 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 457 ConstructedInterpolants, 0 QuantifiedInterpolants, 276685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 32/159 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...