/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:12:55,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:12:55,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:12:55,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:12:55,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:12:55,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:12:55,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:12:55,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:12:55,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:12:55,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:12:55,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:12:55,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:12:55,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:12:55,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:12:55,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:12:55,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:12:55,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:12:55,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:12:55,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:12:55,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:12:55,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:12:55,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:12:55,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:12:55,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:12:55,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:12:55,689 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:12:55,689 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:12:55,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:12:55,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:12:55,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:12:55,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:12:55,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:12:55,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:12:55,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:12:55,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:12:55,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:12:55,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:12:55,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:12:55,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:12:55,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:12:55,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:12:55,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-03 00:12:55,719 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:12:55,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:12:55,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:12:55,722 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:12:55,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:12:55,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:12:55,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:12:55,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:12:55,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:12:55,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:12:55,724 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:12:55,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:12:55,724 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:12:55,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:12:55,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:12:55,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:12:55,725 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:12:55,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:12:55,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:12:55,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:12:55,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:12:55,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:12:55,726 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:12:55,726 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-03 00:12:56,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:12:56,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:12:56,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:12:56,071 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:12:56,071 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:12:56,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_9.c [2021-05-03 00:12:56,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8508b69f1/74cbbc102abd438fa3a52e20f36f6ba4/FLAGffa3e9518 [2021-05-03 00:12:56,520 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:12:56,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_9.c [2021-05-03 00:12:56,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8508b69f1/74cbbc102abd438fa3a52e20f36f6ba4/FLAGffa3e9518 [2021-05-03 00:12:56,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8508b69f1/74cbbc102abd438fa3a52e20f36f6ba4 [2021-05-03 00:12:56,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:12:56,548 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:12:56,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:12:56,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:12:56,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:12:56,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:12:56" (1/1) ... [2021-05-03 00:12:56,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed931e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:56, skipping insertion in model container [2021-05-03 00:12:56,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:12:56" (1/1) ... [2021-05-03 00:12:56,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:12:56,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:12:56,717 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_9.c[318,331] [2021-05-03 00:12:56,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:12:56,735 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:12:56,801 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_9.c[318,331] [2021-05-03 00:12:56,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:12:56,828 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:12:56,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:56 WrapperNode [2021-05-03 00:12:56,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:12:56,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:12:56,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:12:56,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:12:56,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:56" (1/1) ... [2021-05-03 00:12:56,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:56" (1/1) ... [2021-05-03 00:12:56,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:56" (1/1) ... [2021-05-03 00:12:56,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:56" (1/1) ... [2021-05-03 00:12:56,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:56" (1/1) ... [2021-05-03 00:12:56,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:56" (1/1) ... [2021-05-03 00:12:56,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:56" (1/1) ... [2021-05-03 00:12:56,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:12:56,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:12:56,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:12:56,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:12:56,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:12:56,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:12:56,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:12:56,941 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:12:56,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-03 00:12:56,942 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:12:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-03 00:12:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:12:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:12:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:12:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-03 00:12:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:12:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:12:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:12:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:12:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:12:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:12:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:12:57,201 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:12:57,201 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-03 00:12:57,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:12:57 BoogieIcfgContainer [2021-05-03 00:12:57,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:12:57,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:12:57,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:12:57,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:12:57,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:12:56" (1/3) ... [2021-05-03 00:12:57,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae8aef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:12:57, skipping insertion in model container [2021-05-03 00:12:57,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:56" (2/3) ... [2021-05-03 00:12:57,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae8aef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:12:57, skipping insertion in model container [2021-05-03 00:12:57,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:12:57" (3/3) ... [2021-05-03 00:12:57,209 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_9.c [2021-05-03 00:12:57,214 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:12:57,217 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:12:57,231 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:12:57,247 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:12:57,248 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:12:57,248 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:12:57,248 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:12:57,248 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:12:57,248 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:12:57,248 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:12:57,248 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:12:57,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-03 00:12:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-03 00:12:57,279 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:57,279 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:57,280 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:57,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:57,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 1 times [2021-05-03 00:12:57,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:57,298 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1526865956] [2021-05-03 00:12:57,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:57,343 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:12:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:57,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:57,475 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:57,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1526865956] [2021-05-03 00:12:57,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1526865956] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:57,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:57,478 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-03 00:12:57,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22724662] [2021-05-03 00:12:57,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-03 00:12:57,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:57,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-03 00:12:57,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:12:57,498 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:57,576 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-05-03 00:12:57,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-03 00:12:57,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-03 00:12:57,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:57,583 INFO L225 Difference]: With dead ends: 32 [2021-05-03 00:12:57,583 INFO L226 Difference]: Without dead ends: 13 [2021-05-03 00:12:57,587 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:12:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-05-03 00:12:57,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-05-03 00:12:57,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-05-03 00:12:57,626 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2021-05-03 00:12:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:57,626 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-05-03 00:12:57,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-05-03 00:12:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-03 00:12:57,627 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:57,628 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:57,628 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:12:57,628 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:57,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:57,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2021-05-03 00:12:57,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:57,629 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1943178878] [2021-05-03 00:12:57,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:57,632 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:12:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:57,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:57,758 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:57,758 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1943178878] [2021-05-03 00:12:57,758 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1943178878] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:57,759 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:57,759 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-03 00:12:57,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908780707] [2021-05-03 00:12:57,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-03 00:12:57,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:57,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-03 00:12:57,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-03 00:12:57,761 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:57,856 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-05-03 00:12:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-03 00:12:57,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-03 00:12:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:57,857 INFO L225 Difference]: With dead ends: 22 [2021-05-03 00:12:57,857 INFO L226 Difference]: Without dead ends: 15 [2021-05-03 00:12:57,858 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:12:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-05-03 00:12:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-05-03 00:12:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-05-03 00:12:57,865 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2021-05-03 00:12:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:57,865 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-05-03 00:12:57,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:57,865 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-05-03 00:12:57,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-03 00:12:57,866 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:57,866 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:57,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:12:57,866 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:57,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:57,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1372110560, now seen corresponding path program 1 times [2021-05-03 00:12:57,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:57,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2012603906] [2021-05-03 00:12:57,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:57,907 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_11 500000) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] [2021-05-03 00:12:57,929 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:12:57,935 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:57,955 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:57,986 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:12:58,005 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:58,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:58,184 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:58,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2012603906] [2021-05-03 00:12:58,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2012603906] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:58,184 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:58,185 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-03 00:12:58,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703583880] [2021-05-03 00:12:58,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-03 00:12:58,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:58,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-03 00:12:58,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-03 00:12:58,188 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:58,325 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2021-05-03 00:12:58,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-03 00:12:58,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-03 00:12:58,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:58,328 INFO L225 Difference]: With dead ends: 24 [2021-05-03 00:12:58,328 INFO L226 Difference]: Without dead ends: 17 [2021-05-03 00:12:58,328 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 138.2ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:12:58,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-03 00:12:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-05-03 00:12:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-05-03 00:12:58,342 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2021-05-03 00:12:58,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:58,343 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-05-03 00:12:58,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-05-03 00:12:58,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-03 00:12:58,343 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:58,344 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:58,344 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-03 00:12:58,344 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:58,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:58,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1002491197, now seen corresponding path program 2 times [2021-05-03 00:12:58,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:58,345 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1096913658] [2021-05-03 00:12:58,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:58,356 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_15 500000) (< v_main_~x~0_15 999999)) InVars {main_~x~0=v_main_~x~0_15} OutVars{main_~x~0=v_main_~x~0_15} AuxVars[] AssignedVars[] [2021-05-03 00:12:58,366 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:12:58,370 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:58,377 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:58,401 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:12:58,416 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:58,423 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_17 500000) InVars {main_~x~0=v_main_~x~0_17} OutVars{main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[] [2021-05-03 00:12:58,429 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:12:58,432 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:58,439 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:58,457 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:12:58,470 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:58,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:58,644 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:58,644 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1096913658] [2021-05-03 00:12:58,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1096913658] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:58,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:58,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-03 00:12:58,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598302304] [2021-05-03 00:12:58,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-03 00:12:58,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:58,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-03 00:12:58,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-05-03 00:12:58,649 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:58,810 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2021-05-03 00:12:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-03 00:12:58,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-03 00:12:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:58,813 INFO L225 Difference]: With dead ends: 26 [2021-05-03 00:12:58,813 INFO L226 Difference]: Without dead ends: 19 [2021-05-03 00:12:58,814 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 169.4ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:12:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-03 00:12:58,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-05-03 00:12:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-05-03 00:12:58,823 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2021-05-03 00:12:58,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:58,823 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-05-03 00:12:58,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:58,824 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2021-05-03 00:12:58,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-03 00:12:58,826 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:58,826 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:58,826 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-03 00:12:58,826 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:58,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:58,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1927821798, now seen corresponding path program 3 times [2021-05-03 00:12:58,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:58,827 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1877921724] [2021-05-03 00:12:58,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:58,835 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_22 500000) (< v_main_~x~0_22 999999)) InVars {main_~x~0=v_main_~x~0_22} OutVars{main_~x~0=v_main_~x~0_22} AuxVars[] AssignedVars[] [2021-05-03 00:12:58,846 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:12:58,849 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:58,856 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:58,874 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:12:58,889 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:58,895 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_24 500000) InVars {main_~x~0=v_main_~x~0_24} OutVars{main_~x~0=v_main_~x~0_24} AuxVars[] AssignedVars[] [2021-05-03 00:12:58,906 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:12:58,911 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:58,920 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:58,937 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:12:58,950 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:59,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:59,095 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:59,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1877921724] [2021-05-03 00:12:59,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1877921724] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:59,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:59,096 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-03 00:12:59,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462343077] [2021-05-03 00:12:59,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-03 00:12:59,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:59,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-03 00:12:59,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:12:59,097 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:59,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:59,276 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-05-03 00:12:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-03 00:12:59,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-03 00:12:59,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:59,281 INFO L225 Difference]: With dead ends: 28 [2021-05-03 00:12:59,282 INFO L226 Difference]: Without dead ends: 21 [2021-05-03 00:12:59,282 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 184.0ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:12:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-05-03 00:12:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-05-03 00:12:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-05-03 00:12:59,296 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2021-05-03 00:12:59,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:59,296 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-05-03 00:12:59,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:59,296 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-05-03 00:12:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-03 00:12:59,297 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:59,297 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:59,298 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-03 00:12:59,298 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:59,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:59,298 INFO L82 PathProgramCache]: Analyzing trace with hash -460063817, now seen corresponding path program 4 times [2021-05-03 00:12:59,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:59,298 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [616981895] [2021-05-03 00:12:59,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:59,307 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_30 500000) (< v_main_~x~0_30 999999)) InVars {main_~x~0=v_main_~x~0_30} OutVars{main_~x~0=v_main_~x~0_30} AuxVars[] AssignedVars[] [2021-05-03 00:12:59,313 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:12:59,329 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:59,336 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:59,344 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:12:59,360 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:59,366 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_32 500000) InVars {main_~x~0=v_main_~x~0_32} OutVars{main_~x~0=v_main_~x~0_32} AuxVars[] AssignedVars[] [2021-05-03 00:12:59,368 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:12:59,379 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:59,385 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:59,397 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:12:59,413 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:59,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:59,554 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:59,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [616981895] [2021-05-03 00:12:59,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [616981895] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:59,555 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:59,555 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-03 00:12:59,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622029863] [2021-05-03 00:12:59,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-03 00:12:59,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:59,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-03 00:12:59,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-03 00:12:59,556 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:59,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:59,797 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-05-03 00:12:59,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:12:59,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-03 00:12:59,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:59,799 INFO L225 Difference]: With dead ends: 30 [2021-05-03 00:12:59,799 INFO L226 Difference]: Without dead ends: 23 [2021-05-03 00:12:59,799 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 261.2ms TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:12:59,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-03 00:12:59,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-05-03 00:12:59,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-05-03 00:12:59,808 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2021-05-03 00:12:59,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:59,808 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-05-03 00:12:59,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-05-03 00:12:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-03 00:12:59,809 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:59,809 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:59,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-03 00:12:59,809 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:59,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:59,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1306082836, now seen corresponding path program 5 times [2021-05-03 00:12:59,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:59,810 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1286954401] [2021-05-03 00:12:59,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:59,831 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_39 999999) (< v_main_~x~0_39 500000)) InVars {main_~x~0=v_main_~x~0_39} OutVars{main_~x~0=v_main_~x~0_39} AuxVars[] AssignedVars[] [2021-05-03 00:12:59,834 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:12:59,841 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:59,863 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:59,872 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:12:59,882 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:59,885 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_41 500000) InVars {main_~x~0=v_main_~x~0_41} OutVars{main_~x~0=v_main_~x~0_41} AuxVars[] AssignedVars[] [2021-05-03 00:12:59,887 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:12:59,888 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:59,898 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:59,913 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:12:59,923 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:59,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:00,077 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:00,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1286954401] [2021-05-03 00:13:00,078 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1286954401] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:00,078 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:00,078 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:13:00,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520595370] [2021-05-03 00:13:00,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:13:00,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:00,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:13:00,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:13:00,080 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:00,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:00,345 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-05-03 00:13:00,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-03 00:13:00,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-03 00:13:00,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:00,347 INFO L225 Difference]: With dead ends: 32 [2021-05-03 00:13:00,347 INFO L226 Difference]: Without dead ends: 25 [2021-05-03 00:13:00,347 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 237.0ms TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:13:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-03 00:13:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-05-03 00:13:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-05-03 00:13:00,352 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2021-05-03 00:13:00,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:00,352 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-05-03 00:13:00,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-05-03 00:13:00,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-03 00:13:00,353 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:00,353 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:00,353 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-03 00:13:00,353 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:00,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:00,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2060934449, now seen corresponding path program 6 times [2021-05-03 00:13:00,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:00,354 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1511663736] [2021-05-03 00:13:00,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:00,359 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_49 999999) (< v_main_~x~0_49 500000)) InVars {main_~x~0=v_main_~x~0_49} OutVars{main_~x~0=v_main_~x~0_49} AuxVars[] AssignedVars[] [2021-05-03 00:13:00,362 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:00,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:00,375 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:00,389 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:00,400 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:00,403 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_51 500000) InVars {main_~x~0=v_main_~x~0_51} OutVars{main_~x~0=v_main_~x~0_51} AuxVars[] AssignedVars[] [2021-05-03 00:13:00,406 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:00,413 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:00,418 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:00,426 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:00,436 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:00,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:00,563 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:00,563 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1511663736] [2021-05-03 00:13:00,564 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1511663736] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:00,564 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:00,564 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-03 00:13:00,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285205384] [2021-05-03 00:13:00,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-03 00:13:00,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:00,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-03 00:13:00,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:13:00,565 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:00,829 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-05-03 00:13:00,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-03 00:13:00,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-03 00:13:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:00,831 INFO L225 Difference]: With dead ends: 34 [2021-05-03 00:13:00,831 INFO L226 Difference]: Without dead ends: 27 [2021-05-03 00:13:00,831 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 243.6ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:13:00,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-03 00:13:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-05-03 00:13:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-05-03 00:13:00,836 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2021-05-03 00:13:00,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:00,837 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-05-03 00:13:00,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:00,837 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2021-05-03 00:13:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-03 00:13:00,837 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:00,838 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:00,838 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-03 00:13:00,838 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:00,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1623861518, now seen corresponding path program 7 times [2021-05-03 00:13:00,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:00,839 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [260071601] [2021-05-03 00:13:00,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:00,843 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_60 999999) (< v_main_~x~0_60 500000)) InVars {main_~x~0=v_main_~x~0_60} OutVars{main_~x~0=v_main_~x~0_60} AuxVars[] AssignedVars[] [2021-05-03 00:13:00,846 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:00,852 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:00,857 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:00,864 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:00,874 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:00,877 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_62 500000) InVars {main_~x~0=v_main_~x~0_62} OutVars{main_~x~0=v_main_~x~0_62} AuxVars[] AssignedVars[] [2021-05-03 00:13:00,879 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:00,886 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:00,892 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:00,899 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:00,909 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:00,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:01,054 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:01,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [260071601] [2021-05-03 00:13:01,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [260071601] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:01,054 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:01,054 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-03 00:13:01,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482002364] [2021-05-03 00:13:01,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-03 00:13:01,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:01,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-03 00:13:01,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:13:01,056 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:01,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:01,380 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-05-03 00:13:01,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:13:01,381 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-05-03 00:13:01,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:01,381 INFO L225 Difference]: With dead ends: 36 [2021-05-03 00:13:01,381 INFO L226 Difference]: Without dead ends: 29 [2021-05-03 00:13:01,382 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 299.5ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:13:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-03 00:13:01,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-05-03 00:13:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-05-03 00:13:01,386 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2021-05-03 00:13:01,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:01,387 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-05-03 00:13:01,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-05-03 00:13:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-03 00:13:01,387 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:01,388 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:01,388 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-03 00:13:01,388 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:01,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:01,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1791397461, now seen corresponding path program 8 times [2021-05-03 00:13:01,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:01,388 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1088137130] [2021-05-03 00:13:01,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:01,393 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_72 500000) (< v_main_~x~0_72 999999)) InVars {main_~x~0=v_main_~x~0_72} OutVars{main_~x~0=v_main_~x~0_72} AuxVars[] AssignedVars[] [2021-05-03 00:13:01,395 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:01,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:01,408 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:01,417 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:01,427 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:01,429 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_74 500000) InVars {main_~x~0=v_main_~x~0_74} OutVars{main_~x~0=v_main_~x~0_74} AuxVars[] AssignedVars[] [2021-05-03 00:13:01,430 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:01,431 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:01,437 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:01,451 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:01,461 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:01,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:01,622 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:01,622 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1088137130] [2021-05-03 00:13:01,622 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1088137130] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:01,622 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:01,622 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-03 00:13:01,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066497986] [2021-05-03 00:13:01,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-03 00:13:01,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:01,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-03 00:13:01,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:13:01,624 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:02,005 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2021-05-03 00:13:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:13:02,006 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-05-03 00:13:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:02,006 INFO L225 Difference]: With dead ends: 38 [2021-05-03 00:13:02,006 INFO L226 Difference]: Without dead ends: 31 [2021-05-03 00:13:02,007 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 355.1ms TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:13:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-03 00:13:02,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-05-03 00:13:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-05-03 00:13:02,013 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2021-05-03 00:13:02,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:02,013 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-05-03 00:13:02,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-05-03 00:13:02,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-03 00:13:02,014 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:02,014 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:02,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-03 00:13:02,014 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:02,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:02,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1794705160, now seen corresponding path program 9 times [2021-05-03 00:13:02,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:02,015 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [664535600] [2021-05-03 00:13:02,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:02,023 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_85 999999) (< v_main_~x~0_85 500000)) InVars {main_~x~0=v_main_~x~0_85} OutVars{main_~x~0=v_main_~x~0_85} AuxVars[] AssignedVars[] [2021-05-03 00:13:02,025 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:02,032 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:02,037 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:02,044 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:02,054 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:02,057 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_87 500000) InVars {main_~x~0=v_main_~x~0_87} OutVars{main_~x~0=v_main_~x~0_87} AuxVars[] AssignedVars[] [2021-05-03 00:13:02,058 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:02,059 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:02,065 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:02,076 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:02,085 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:02,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:02,232 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:02,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [664535600] [2021-05-03 00:13:02,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [664535600] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:02,233 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:02,233 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-03 00:13:02,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739937373] [2021-05-03 00:13:02,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-03 00:13:02,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:02,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-03 00:13:02,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:13:02,234 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:02,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:02,653 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-05-03 00:13:02,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-03 00:13:02,654 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-05-03 00:13:02,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:02,655 INFO L225 Difference]: With dead ends: 40 [2021-05-03 00:13:02,655 INFO L226 Difference]: Without dead ends: 33 [2021-05-03 00:13:02,655 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 353.5ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:13:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-03 00:13:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-05-03 00:13:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-05-03 00:13:02,661 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2021-05-03 00:13:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:02,661 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-05-03 00:13:02,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-05-03 00:13:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-03 00:13:02,662 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:02,662 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:02,662 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-03 00:13:02,662 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:02,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:02,663 INFO L82 PathProgramCache]: Analyzing trace with hash -819414747, now seen corresponding path program 10 times [2021-05-03 00:13:02,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:02,663 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545957494] [2021-05-03 00:13:02,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:02,667 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_99 500000) (< v_main_~x~0_99 999999)) InVars {main_~x~0=v_main_~x~0_99} OutVars{main_~x~0=v_main_~x~0_99} AuxVars[] AssignedVars[] [2021-05-03 00:13:02,669 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:02,676 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:02,681 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:02,697 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:02,706 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:02,710 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_101 500000) InVars {main_~x~0=v_main_~x~0_101} OutVars{main_~x~0=v_main_~x~0_101} AuxVars[] AssignedVars[] [2021-05-03 00:13:02,711 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:02,712 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:02,722 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:02,734 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:02,744 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:02,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:02,930 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:02,930 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [545957494] [2021-05-03 00:13:02,930 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [545957494] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:02,930 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:02,930 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-03 00:13:02,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566647759] [2021-05-03 00:13:02,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-03 00:13:02,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:02,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-03 00:13:02,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:13:02,932 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:03,408 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2021-05-03 00:13:03,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:13:03,410 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-05-03 00:13:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:03,410 INFO L225 Difference]: With dead ends: 42 [2021-05-03 00:13:03,410 INFO L226 Difference]: Without dead ends: 35 [2021-05-03 00:13:03,412 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 419.4ms TimeCoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:13:03,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-03 00:13:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-05-03 00:13:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2021-05-03 00:13:03,418 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2021-05-03 00:13:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:03,418 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-05-03 00:13:03,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2021-05-03 00:13:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-03 00:13:03,419 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:03,419 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:03,419 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-03 00:13:03,420 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash -432777214, now seen corresponding path program 11 times [2021-05-03 00:13:03,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:03,420 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [592110547] [2021-05-03 00:13:03,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:03,428 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_114 500000) (< v_main_~x~0_114 999999)) InVars {main_~x~0=v_main_~x~0_114} OutVars{main_~x~0=v_main_~x~0_114} AuxVars[] AssignedVars[] [2021-05-03 00:13:03,431 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:03,438 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:03,442 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:03,451 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:03,461 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:03,463 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_116 500000) InVars {main_~x~0=v_main_~x~0_116} OutVars{main_~x~0=v_main_~x~0_116} AuxVars[] AssignedVars[] [2021-05-03 00:13:03,464 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:03,470 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:03,475 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:03,481 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:03,491 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:03,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:03,694 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:03,695 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [592110547] [2021-05-03 00:13:03,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [592110547] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:03,695 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:03,695 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:13:03,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749438966] [2021-05-03 00:13:03,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:13:03,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:03,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:13:03,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:13:03,697 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:04,234 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-05-03 00:13:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:13:04,234 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-05-03 00:13:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:04,235 INFO L225 Difference]: With dead ends: 44 [2021-05-03 00:13:04,235 INFO L226 Difference]: Without dead ends: 37 [2021-05-03 00:13:04,236 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 467.3ms TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:13:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-05-03 00:13:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-05-03 00:13:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-05-03 00:13:04,242 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2021-05-03 00:13:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:04,242 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-05-03 00:13:04,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-05-03 00:13:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-03 00:13:04,243 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:04,243 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:04,243 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-03 00:13:04,243 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:04,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1758704543, now seen corresponding path program 12 times [2021-05-03 00:13:04,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:04,244 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [299616159] [2021-05-03 00:13:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:04,250 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_130 999999) (< v_main_~x~0_130 500000)) InVars {main_~x~0=v_main_~x~0_130} OutVars{main_~x~0=v_main_~x~0_130} AuxVars[] AssignedVars[] [2021-05-03 00:13:04,252 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:04,260 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:04,265 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:04,272 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:04,283 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:04,284 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_132 500000) InVars {main_~x~0=v_main_~x~0_132} OutVars{main_~x~0=v_main_~x~0_132} AuxVars[] AssignedVars[] [2021-05-03 00:13:04,286 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:04,287 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:04,294 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:04,307 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:04,320 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:04,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:04,516 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:04,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [299616159] [2021-05-03 00:13:04,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [299616159] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:04,517 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:04,517 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:13:04,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647334511] [2021-05-03 00:13:04,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:13:04,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:04,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:13:04,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:13:04,518 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:05,063 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-05-03 00:13:05,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:13:05,063 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-05-03 00:13:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:05,064 INFO L225 Difference]: With dead ends: 46 [2021-05-03 00:13:05,064 INFO L226 Difference]: Without dead ends: 39 [2021-05-03 00:13:05,064 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 462.7ms TimeCoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:13:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-03 00:13:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-05-03 00:13:05,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2021-05-03 00:13:05,070 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 35 [2021-05-03 00:13:05,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:05,071 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-05-03 00:13:05,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:05,071 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2021-05-03 00:13:05,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-03 00:13:05,072 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:05,072 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:05,072 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-03 00:13:05,072 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:05,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:05,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1056269316, now seen corresponding path program 13 times [2021-05-03 00:13:05,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:05,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [690583841] [2021-05-03 00:13:05,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:05,078 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_147 500000) (< v_main_~x~0_147 999999)) InVars {main_~x~0=v_main_~x~0_147} OutVars{main_~x~0=v_main_~x~0_147} AuxVars[] AssignedVars[] [2021-05-03 00:13:05,079 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:05,089 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:05,095 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:05,101 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:05,109 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:05,111 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_149 500000) InVars {main_~x~0=v_main_~x~0_149} OutVars{main_~x~0=v_main_~x~0_149} AuxVars[] AssignedVars[] [2021-05-03 00:13:05,112 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:05,113 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:05,120 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:05,130 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:05,140 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:05,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:05,379 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:05,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [690583841] [2021-05-03 00:13:05,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [690583841] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:05,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:05,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:13:05,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008346967] [2021-05-03 00:13:05,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:13:05,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:05,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:13:05,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:13:05,381 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:06,000 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2021-05-03 00:13:06,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:13:06,000 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-05-03 00:13:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:06,001 INFO L225 Difference]: With dead ends: 48 [2021-05-03 00:13:06,001 INFO L226 Difference]: Without dead ends: 41 [2021-05-03 00:13:06,002 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 551.7ms TimeCoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:13:06,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-03 00:13:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-05-03 00:13:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-05-03 00:13:06,007 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 37 [2021-05-03 00:13:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:06,008 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-05-03 00:13:06,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-05-03 00:13:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-03 00:13:06,008 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:06,009 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:06,009 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-03 00:13:06,009 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:06,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:06,009 INFO L82 PathProgramCache]: Analyzing trace with hash -416751335, now seen corresponding path program 14 times [2021-05-03 00:13:06,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:06,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1548137109] [2021-05-03 00:13:06,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:06,014 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_165 500000) (< v_main_~x~0_165 999999)) InVars {main_~x~0=v_main_~x~0_165} OutVars{main_~x~0=v_main_~x~0_165} AuxVars[] AssignedVars[] [2021-05-03 00:13:06,016 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:06,016 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:06,021 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:06,032 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:06,042 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:06,043 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_167 500000) InVars {main_~x~0=v_main_~x~0_167} OutVars{main_~x~0=v_main_~x~0_167} AuxVars[] AssignedVars[] [2021-05-03 00:13:06,045 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:06,045 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:06,050 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:06,064 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:06,074 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:06,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:06,319 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:06,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1548137109] [2021-05-03 00:13:06,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1548137109] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:06,319 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:06,319 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:13:06,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020588832] [2021-05-03 00:13:06,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:13:06,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:06,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:13:06,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:13:06,321 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:06,979 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2021-05-03 00:13:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:13:06,980 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-05-03 00:13:06,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:06,980 INFO L225 Difference]: With dead ends: 50 [2021-05-03 00:13:06,980 INFO L226 Difference]: Without dead ends: 43 [2021-05-03 00:13:06,981 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 587.0ms TimeCoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:13:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-03 00:13:06,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-05-03 00:13:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-05-03 00:13:06,987 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 39 [2021-05-03 00:13:06,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:06,987 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-05-03 00:13:06,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-05-03 00:13:06,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-03 00:13:06,988 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:06,988 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:06,988 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-03 00:13:06,988 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:06,988 INFO L82 PathProgramCache]: Analyzing trace with hash -20294922, now seen corresponding path program 15 times [2021-05-03 00:13:06,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:06,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1898015315] [2021-05-03 00:13:06,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:06,993 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_184 999999) (< v_main_~x~0_184 500000)) InVars {main_~x~0=v_main_~x~0_184} OutVars{main_~x~0=v_main_~x~0_184} AuxVars[] AssignedVars[] [2021-05-03 00:13:06,994 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:07,000 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:07,005 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:07,012 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:07,022 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:07,024 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_186 500000) InVars {main_~x~0=v_main_~x~0_186} OutVars{main_~x~0=v_main_~x~0_186} AuxVars[] AssignedVars[] [2021-05-03 00:13:07,025 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:07,033 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:07,038 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:07,043 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:07,051 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:07,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:07,308 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:07,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1898015315] [2021-05-03 00:13:07,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1898015315] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:07,308 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:07,308 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:13:07,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063653822] [2021-05-03 00:13:07,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:13:07,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:07,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:13:07,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:13:07,309 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:07,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:07,995 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-05-03 00:13:07,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:13:07,996 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-05-03 00:13:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:07,996 INFO L225 Difference]: With dead ends: 52 [2021-05-03 00:13:07,996 INFO L226 Difference]: Without dead ends: 45 [2021-05-03 00:13:07,997 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 602.6ms TimeCoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:13:07,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-05-03 00:13:08,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-05-03 00:13:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-05-03 00:13:08,002 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 41 [2021-05-03 00:13:08,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:08,003 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-05-03 00:13:08,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:08,003 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-05-03 00:13:08,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-03 00:13:08,003 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:08,004 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:08,004 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-03 00:13:08,004 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:08,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:08,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1277771373, now seen corresponding path program 16 times [2021-05-03 00:13:08,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:08,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [394814561] [2021-05-03 00:13:08,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:08,009 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_204 500000) (< v_main_~x~0_204 999999)) InVars {main_~x~0=v_main_~x~0_204} OutVars{main_~x~0=v_main_~x~0_204} AuxVars[] AssignedVars[] [2021-05-03 00:13:08,010 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:08,011 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:08,016 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:08,027 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:08,037 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:08,046 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_206 500000) InVars {main_~x~0=v_main_~x~0_206} OutVars{main_~x~0=v_main_~x~0_206} AuxVars[] AssignedVars[] [2021-05-03 00:13:08,047 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:08,052 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:08,059 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:08,065 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:08,073 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:08,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:08,350 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:08,350 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [394814561] [2021-05-03 00:13:08,350 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [394814561] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:08,350 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:08,350 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:13:08,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876523257] [2021-05-03 00:13:08,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:13:08,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:08,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:13:08,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:13:08,352 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:09,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:09,060 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2021-05-03 00:13:09,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:13:09,060 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-05-03 00:13:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:09,061 INFO L225 Difference]: With dead ends: 54 [2021-05-03 00:13:09,061 INFO L226 Difference]: Without dead ends: 47 [2021-05-03 00:13:09,062 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 654.7ms TimeCoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:13:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-03 00:13:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-05-03 00:13:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2021-05-03 00:13:09,067 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 43 [2021-05-03 00:13:09,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:09,067 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2021-05-03 00:13:09,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2021-05-03 00:13:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-03 00:13:09,068 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:09,068 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:09,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-03 00:13:09,068 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:09,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:09,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1468136688, now seen corresponding path program 17 times [2021-05-03 00:13:09,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:09,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1439806575] [2021-05-03 00:13:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:09,077 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_225 999999) (< v_main_~x~0_225 500000)) InVars {main_~x~0=v_main_~x~0_225} OutVars{main_~x~0=v_main_~x~0_225} AuxVars[] AssignedVars[] [2021-05-03 00:13:09,078 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:09,084 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:09,088 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:09,095 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:09,104 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:09,106 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_227 500000) InVars {main_~x~0=v_main_~x~0_227} OutVars{main_~x~0=v_main_~x~0_227} AuxVars[] AssignedVars[] [2021-05-03 00:13:09,108 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:09,114 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:09,119 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:09,124 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:09,133 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:09,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:09,422 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:09,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1439806575] [2021-05-03 00:13:09,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1439806575] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:09,422 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:09,422 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:13:09,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293507716] [2021-05-03 00:13:09,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:13:09,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:09,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:13:09,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:13:09,423 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:10,270 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2021-05-03 00:13:10,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:13:10,271 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-05-03 00:13:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:10,271 INFO L225 Difference]: With dead ends: 56 [2021-05-03 00:13:10,271 INFO L226 Difference]: Without dead ends: 49 [2021-05-03 00:13:10,272 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 709.5ms TimeCoverageRelationStatistics Valid=153, Invalid=1487, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:13:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-05-03 00:13:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-05-03 00:13:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2021-05-03 00:13:10,278 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 45 [2021-05-03 00:13:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:10,279 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2021-05-03 00:13:10,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2021-05-03 00:13:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-03 00:13:10,279 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:10,279 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:10,279 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-03 00:13:10,280 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:10,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:10,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1119103731, now seen corresponding path program 18 times [2021-05-03 00:13:10,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:10,280 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1273063356] [2021-05-03 00:13:10,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:10,288 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_247 500000) (< v_main_~x~0_247 999999)) InVars {main_~x~0=v_main_~x~0_247} OutVars{main_~x~0=v_main_~x~0_247} AuxVars[] AssignedVars[] [2021-05-03 00:13:10,294 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:10,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:10,307 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:10,313 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:10,322 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:10,324 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_249 500000) InVars {main_~x~0=v_main_~x~0_249} OutVars{main_~x~0=v_main_~x~0_249} AuxVars[] AssignedVars[] [2021-05-03 00:13:10,326 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:10,332 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:10,337 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:10,343 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:10,352 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:10,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:10,618 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:10,618 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1273063356] [2021-05-03 00:13:10,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1273063356] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:10,619 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:10,619 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:13:10,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235453610] [2021-05-03 00:13:10,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:13:10,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:10,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:13:10,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:13:10,620 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:11,497 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-05-03 00:13:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:13:11,497 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2021-05-03 00:13:11,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:11,498 INFO L225 Difference]: With dead ends: 58 [2021-05-03 00:13:11,498 INFO L226 Difference]: Without dead ends: 51 [2021-05-03 00:13:11,499 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 720.5ms TimeCoverageRelationStatistics Valid=161, Invalid=1645, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:13:11,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-03 00:13:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-05-03 00:13:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2021-05-03 00:13:11,504 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 47 [2021-05-03 00:13:11,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:11,504 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2021-05-03 00:13:11,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:11,504 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2021-05-03 00:13:11,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:13:11,505 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:11,505 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:11,505 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-03 00:13:11,505 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:11,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:11,506 INFO L82 PathProgramCache]: Analyzing trace with hash -671082006, now seen corresponding path program 19 times [2021-05-03 00:13:11,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:11,506 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1414132529] [2021-05-03 00:13:11,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:11,510 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_270 999999) (< v_main_~x~0_270 500000)) InVars {main_~x~0=v_main_~x~0_270} OutVars{main_~x~0=v_main_~x~0_270} AuxVars[] AssignedVars[] [2021-05-03 00:13:11,511 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:11,512 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:11,517 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:11,528 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:11,537 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:11,539 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_272 500000) InVars {main_~x~0=v_main_~x~0_272} OutVars{main_~x~0=v_main_~x~0_272} AuxVars[] AssignedVars[] [2021-05-03 00:13:11,541 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:11,558 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:11,563 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:11,570 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:11,581 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:11,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:11,886 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:11,886 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1414132529] [2021-05-03 00:13:11,886 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1414132529] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:11,886 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:11,886 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:13:11,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192601288] [2021-05-03 00:13:11,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:13:11,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:11,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:13:11,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:13:11,887 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:12,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:12,769 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-05-03 00:13:12,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:13:12,769 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-05-03 00:13:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:12,770 INFO L225 Difference]: With dead ends: 60 [2021-05-03 00:13:12,770 INFO L226 Difference]: Without dead ends: 53 [2021-05-03 00:13:12,771 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 768.0ms TimeCoverageRelationStatistics Valid=169, Invalid=1811, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:13:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-03 00:13:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-05-03 00:13:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2021-05-03 00:13:12,775 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 49 [2021-05-03 00:13:12,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:12,776 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-05-03 00:13:12,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2021-05-03 00:13:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-05-03 00:13:12,776 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:12,776 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:12,776 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-03 00:13:12,777 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:12,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:12,777 INFO L82 PathProgramCache]: Analyzing trace with hash 381066119, now seen corresponding path program 20 times [2021-05-03 00:13:12,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:12,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2047751463] [2021-05-03 00:13:12,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:12,789 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_294 999999) (< v_main_~x~0_294 500000)) InVars {main_~x~0=v_main_~x~0_294} OutVars{main_~x~0=v_main_~x~0_294} AuxVars[] AssignedVars[] [2021-05-03 00:13:12,790 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:12,791 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:12,795 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:12,807 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:12,815 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:12,826 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_296 500000) InVars {main_~x~0=v_main_~x~0_296} OutVars{main_~x~0=v_main_~x~0_296} AuxVars[] AssignedVars[] [2021-05-03 00:13:12,828 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:12,833 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:12,837 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:12,843 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:12,851 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:12,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:13,185 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:13,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2047751463] [2021-05-03 00:13:13,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2047751463] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:13,185 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:13,185 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:13:13,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282989120] [2021-05-03 00:13:13,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:13:13,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:13,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:13:13,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:13:13,187 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:14,140 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2021-05-03 00:13:14,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:13:14,142 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2021-05-03 00:13:14,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:14,143 INFO L225 Difference]: With dead ends: 62 [2021-05-03 00:13:14,143 INFO L226 Difference]: Without dead ends: 55 [2021-05-03 00:13:14,143 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 837.7ms TimeCoverageRelationStatistics Valid=177, Invalid=1985, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:13:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-03 00:13:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-05-03 00:13:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-05-03 00:13:14,148 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 51 [2021-05-03 00:13:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:14,148 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-05-03 00:13:14,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-05-03 00:13:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-03 00:13:14,149 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:14,149 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:14,149 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-03 00:13:14,149 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:14,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:14,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2116867612, now seen corresponding path program 21 times [2021-05-03 00:13:14,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:14,150 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [426760692] [2021-05-03 00:13:14,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:14,154 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_319 500000) (< v_main_~x~0_319 999999)) InVars {main_~x~0=v_main_~x~0_319} OutVars{main_~x~0=v_main_~x~0_319} AuxVars[] AssignedVars[] [2021-05-03 00:13:14,161 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:14,162 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:14,166 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:14,177 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:14,185 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:14,188 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_321 500000) InVars {main_~x~0=v_main_~x~0_321} OutVars{main_~x~0=v_main_~x~0_321} AuxVars[] AssignedVars[] [2021-05-03 00:13:14,189 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:14,190 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:14,194 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:14,204 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:14,214 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:14,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:14,574 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:14,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [426760692] [2021-05-03 00:13:14,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [426760692] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:14,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:14,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:13:14,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104346557] [2021-05-03 00:13:14,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:13:14,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:14,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:13:14,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:13:14,576 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:15,607 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-05-03 00:13:15,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:13:15,608 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2021-05-03 00:13:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:15,608 INFO L225 Difference]: With dead ends: 64 [2021-05-03 00:13:15,608 INFO L226 Difference]: Without dead ends: 57 [2021-05-03 00:13:15,609 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 895.5ms TimeCoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:13:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-03 00:13:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-05-03 00:13:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2021-05-03 00:13:15,615 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 53 [2021-05-03 00:13:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:15,615 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2021-05-03 00:13:15,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2021-05-03 00:13:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-03 00:13:15,615 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:15,616 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:15,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-03 00:13:15,616 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:15,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:15,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1744464639, now seen corresponding path program 22 times [2021-05-03 00:13:15,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:15,616 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1014795352] [2021-05-03 00:13:15,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:15,625 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_345 999999) (< v_main_~x~0_345 500000)) InVars {main_~x~0=v_main_~x~0_345} OutVars{main_~x~0=v_main_~x~0_345} AuxVars[] AssignedVars[] [2021-05-03 00:13:15,627 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:15,633 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:15,638 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:15,646 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:15,655 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:15,657 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_347 500000) InVars {main_~x~0=v_main_~x~0_347} OutVars{main_~x~0=v_main_~x~0_347} AuxVars[] AssignedVars[] [2021-05-03 00:13:15,660 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:15,666 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:15,672 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:15,678 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:15,688 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:15,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:16,090 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:16,090 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1014795352] [2021-05-03 00:13:16,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1014795352] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:16,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:16,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:13:16,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941706706] [2021-05-03 00:13:16,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:13:16,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:16,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:13:16,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:13:16,092 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:17,225 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2021-05-03 00:13:17,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:13:17,226 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2021-05-03 00:13:17,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:17,227 INFO L225 Difference]: With dead ends: 66 [2021-05-03 00:13:17,227 INFO L226 Difference]: Without dead ends: 59 [2021-05-03 00:13:17,228 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 967.6ms TimeCoverageRelationStatistics Valid=193, Invalid=2357, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:13:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-03 00:13:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-03 00:13:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2021-05-03 00:13:17,234 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 55 [2021-05-03 00:13:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:17,234 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2021-05-03 00:13:17,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2021-05-03 00:13:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-03 00:13:17,235 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:17,235 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:17,235 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-03 00:13:17,235 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:17,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:17,236 INFO L82 PathProgramCache]: Analyzing trace with hash -347493154, now seen corresponding path program 23 times [2021-05-03 00:13:17,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:17,236 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [207694309] [2021-05-03 00:13:17,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:17,241 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_372 500000) (< v_main_~x~0_372 999999)) InVars {main_~x~0=v_main_~x~0_372} OutVars{main_~x~0=v_main_~x~0_372} AuxVars[] AssignedVars[] [2021-05-03 00:13:17,243 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:17,243 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:17,248 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:17,260 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:17,270 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:17,273 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_374 500000) InVars {main_~x~0=v_main_~x~0_374} OutVars{main_~x~0=v_main_~x~0_374} AuxVars[] AssignedVars[] [2021-05-03 00:13:17,274 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:17,281 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:17,286 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:17,291 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:17,301 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:17,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:17,707 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:17,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [207694309] [2021-05-03 00:13:17,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [207694309] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:17,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:17,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:13:17,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247447161] [2021-05-03 00:13:17,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:13:17,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:17,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:13:17,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:13:17,709 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:18,862 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2021-05-03 00:13:18,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:13:18,863 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2021-05-03 00:13:18,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:18,863 INFO L225 Difference]: With dead ends: 68 [2021-05-03 00:13:18,864 INFO L226 Difference]: Without dead ends: 61 [2021-05-03 00:13:18,864 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 982.1ms TimeCoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-05-03 00:13:18,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-03 00:13:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-03 00:13:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2021-05-03 00:13:18,869 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 57 [2021-05-03 00:13:18,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:18,869 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2021-05-03 00:13:18,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2021-05-03 00:13:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-03 00:13:18,870 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:18,870 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:18,870 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-03 00:13:18,870 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:18,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:18,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2112307579, now seen corresponding path program 24 times [2021-05-03 00:13:18,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:18,871 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [642420108] [2021-05-03 00:13:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:18,883 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_400 999999) (< v_main_~x~0_400 500000)) InVars {main_~x~0=v_main_~x~0_400} OutVars{main_~x~0=v_main_~x~0_400} AuxVars[] AssignedVars[] [2021-05-03 00:13:18,885 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:18,891 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:18,895 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:18,901 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:18,909 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:18,911 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_402 500000) InVars {main_~x~0=v_main_~x~0_402} OutVars{main_~x~0=v_main_~x~0_402} AuxVars[] AssignedVars[] [2021-05-03 00:13:18,914 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:18,919 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:18,924 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:18,930 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:18,939 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:18,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:19,387 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:19,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [642420108] [2021-05-03 00:13:19,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [642420108] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:19,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:19,388 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:13:19,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133982061] [2021-05-03 00:13:19,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:13:19,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:19,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:13:19,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:13:19,390 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:20,672 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-05-03 00:13:20,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:13:20,673 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2021-05-03 00:13:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:20,673 INFO L225 Difference]: With dead ends: 70 [2021-05-03 00:13:20,673 INFO L226 Difference]: Without dead ends: 63 [2021-05-03 00:13:20,674 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1114.2ms TimeCoverageRelationStatistics Valid=209, Invalid=2761, Unknown=0, NotChecked=0, Total=2970 [2021-05-03 00:13:20,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-03 00:13:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-05-03 00:13:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2021-05-03 00:13:20,678 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 59 [2021-05-03 00:13:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:20,678 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2021-05-03 00:13:20,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2021-05-03 00:13:20,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-03 00:13:20,678 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:20,679 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:20,679 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-03 00:13:20,679 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:20,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:20,679 INFO L82 PathProgramCache]: Analyzing trace with hash -546168104, now seen corresponding path program 25 times [2021-05-03 00:13:20,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:20,679 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1560817852] [2021-05-03 00:13:20,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:20,689 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_429 500000) (< v_main_~x~0_429 999999)) InVars {main_~x~0=v_main_~x~0_429} OutVars{main_~x~0=v_main_~x~0_429} AuxVars[] AssignedVars[] [2021-05-03 00:13:20,691 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:20,695 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:20,699 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:20,704 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:20,712 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:20,719 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_431 500000) InVars {main_~x~0=v_main_~x~0_431} OutVars{main_~x~0=v_main_~x~0_431} AuxVars[] AssignedVars[] [2021-05-03 00:13:20,720 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:20,725 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:20,729 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:20,734 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:20,742 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:20,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:21,180 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:21,180 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1560817852] [2021-05-03 00:13:21,180 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1560817852] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:21,180 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:21,180 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:13:21,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260331545] [2021-05-03 00:13:21,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:13:21,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:21,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:13:21,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:13:21,182 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:22,551 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2021-05-03 00:13:22,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:13:22,551 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2021-05-03 00:13:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:22,552 INFO L225 Difference]: With dead ends: 72 [2021-05-03 00:13:22,552 INFO L226 Difference]: Without dead ends: 65 [2021-05-03 00:13:22,553 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1120.3ms TimeCoverageRelationStatistics Valid=217, Invalid=2975, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:13:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-03 00:13:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-05-03 00:13:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2021-05-03 00:13:22,559 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 61 [2021-05-03 00:13:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:22,559 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2021-05-03 00:13:22,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2021-05-03 00:13:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-03 00:13:22,560 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:22,560 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:22,560 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-03 00:13:22,560 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:22,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:22,560 INFO L82 PathProgramCache]: Analyzing trace with hash 164241653, now seen corresponding path program 26 times [2021-05-03 00:13:22,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:22,561 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [188644667] [2021-05-03 00:13:22,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:22,565 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_459 999999) (< v_main_~x~0_459 500000)) InVars {main_~x~0=v_main_~x~0_459} OutVars{main_~x~0=v_main_~x~0_459} AuxVars[] AssignedVars[] [2021-05-03 00:13:22,566 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:22,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:22,576 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:22,582 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:22,590 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:22,592 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_461 500000) InVars {main_~x~0=v_main_~x~0_461} OutVars{main_~x~0=v_main_~x~0_461} AuxVars[] AssignedVars[] [2021-05-03 00:13:22,597 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:22,602 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:22,606 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:22,619 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:22,631 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:22,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:23,161 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:23,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [188644667] [2021-05-03 00:13:23,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [188644667] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:23,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:23,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:13:23,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034534169] [2021-05-03 00:13:23,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:13:23,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:23,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:13:23,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:13:23,162 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:24,544 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2021-05-03 00:13:24,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:13:24,544 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-05-03 00:13:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:24,545 INFO L225 Difference]: With dead ends: 74 [2021-05-03 00:13:24,545 INFO L226 Difference]: Without dead ends: 67 [2021-05-03 00:13:24,546 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1248.9ms TimeCoverageRelationStatistics Valid=225, Invalid=3197, Unknown=0, NotChecked=0, Total=3422 [2021-05-03 00:13:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-03 00:13:24,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-05-03 00:13:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2021-05-03 00:13:24,555 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 63 [2021-05-03 00:13:24,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:24,556 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2021-05-03 00:13:24,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2021-05-03 00:13:24,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-03 00:13:24,556 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:24,556 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:24,556 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-03 00:13:24,556 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:24,557 INFO L82 PathProgramCache]: Analyzing trace with hash -31781934, now seen corresponding path program 27 times [2021-05-03 00:13:24,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:24,557 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1483938390] [2021-05-03 00:13:24,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:24,563 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_490 999999) (< v_main_~x~0_490 500000)) InVars {main_~x~0=v_main_~x~0_490} OutVars{main_~x~0=v_main_~x~0_490} AuxVars[] AssignedVars[] [2021-05-03 00:13:24,564 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:24,578 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:24,583 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:24,590 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:24,599 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:24,601 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_492 500000) InVars {main_~x~0=v_main_~x~0_492} OutVars{main_~x~0=v_main_~x~0_492} AuxVars[] AssignedVars[] [2021-05-03 00:13:24,602 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:24,608 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:24,613 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:24,619 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:24,628 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:24,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:25,161 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:25,162 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1483938390] [2021-05-03 00:13:25,163 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1483938390] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:25,163 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:25,163 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:13:25,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379873658] [2021-05-03 00:13:25,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:13:25,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:25,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:13:25,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:13:25,164 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:26,777 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-05-03 00:13:26,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:13:26,777 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-05-03 00:13:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:26,778 INFO L225 Difference]: With dead ends: 76 [2021-05-03 00:13:26,778 INFO L226 Difference]: Without dead ends: 69 [2021-05-03 00:13:26,779 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1361.7ms TimeCoverageRelationStatistics Valid=233, Invalid=3427, Unknown=0, NotChecked=0, Total=3660 [2021-05-03 00:13:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-03 00:13:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-05-03 00:13:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2021-05-03 00:13:26,785 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 65 [2021-05-03 00:13:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:26,785 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2021-05-03 00:13:26,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2021-05-03 00:13:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:13:26,786 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:26,786 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:26,786 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-03 00:13:26,786 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:26,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash 568111983, now seen corresponding path program 28 times [2021-05-03 00:13:26,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:26,787 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [223622906] [2021-05-03 00:13:26,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:26,793 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_522 500000) (< v_main_~x~0_522 999999)) InVars {main_~x~0=v_main_~x~0_522} OutVars{main_~x~0=v_main_~x~0_522} AuxVars[] AssignedVars[] [2021-05-03 00:13:26,795 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:26,796 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:26,801 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:26,811 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:26,819 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:26,821 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_524 500000) InVars {main_~x~0=v_main_~x~0_524} OutVars{main_~x~0=v_main_~x~0_524} AuxVars[] AssignedVars[] [2021-05-03 00:13:26,822 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:26,827 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:26,831 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:26,838 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:26,846 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:26,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:27,368 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:27,368 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [223622906] [2021-05-03 00:13:27,369 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [223622906] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:27,369 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:27,369 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:13:27,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064360854] [2021-05-03 00:13:27,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:13:27,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:27,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:13:27,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:13:27,370 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:28,953 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2021-05-03 00:13:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:13:28,954 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2021-05-03 00:13:28,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:28,954 INFO L225 Difference]: With dead ends: 78 [2021-05-03 00:13:28,954 INFO L226 Difference]: Without dead ends: 71 [2021-05-03 00:13:28,955 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1342.5ms TimeCoverageRelationStatistics Valid=241, Invalid=3665, Unknown=0, NotChecked=0, Total=3906 [2021-05-03 00:13:28,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-03 00:13:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-05-03 00:13:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2021-05-03 00:13:28,960 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 67 [2021-05-03 00:13:28,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:28,960 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2021-05-03 00:13:28,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2021-05-03 00:13:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-05-03 00:13:28,960 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:28,960 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:28,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-03 00:13:28,961 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:28,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:28,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1540548556, now seen corresponding path program 29 times [2021-05-03 00:13:28,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:28,961 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [432785358] [2021-05-03 00:13:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:28,976 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_555 999999) (< v_main_~x~0_555 500000)) InVars {main_~x~0=v_main_~x~0_555} OutVars{main_~x~0=v_main_~x~0_555} AuxVars[] AssignedVars[] [2021-05-03 00:13:28,977 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:28,978 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:28,983 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:28,994 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:29,003 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:29,005 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_557 500000) InVars {main_~x~0=v_main_~x~0_557} OutVars{main_~x~0=v_main_~x~0_557} AuxVars[] AssignedVars[] [2021-05-03 00:13:29,007 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:29,012 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:29,016 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:29,022 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:29,030 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:29,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:29,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:29,550 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:29,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [432785358] [2021-05-03 00:13:29,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [432785358] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:29,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:29,550 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:13:29,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959809464] [2021-05-03 00:13:29,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:13:29,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:29,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:13:29,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:13:29,551 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:31,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:31,182 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-05-03 00:13:31,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:13:31,183 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2021-05-03 00:13:31,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:31,184 INFO L225 Difference]: With dead ends: 80 [2021-05-03 00:13:31,184 INFO L226 Difference]: Without dead ends: 73 [2021-05-03 00:13:31,185 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1364.6ms TimeCoverageRelationStatistics Valid=249, Invalid=3911, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:13:31,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-03 00:13:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-05-03 00:13:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2021-05-03 00:13:31,190 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 69 [2021-05-03 00:13:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:31,190 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2021-05-03 00:13:31,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2021-05-03 00:13:31,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-03 00:13:31,190 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:31,191 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:31,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-03 00:13:31,191 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:31,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:31,191 INFO L82 PathProgramCache]: Analyzing trace with hash -250775319, now seen corresponding path program 30 times [2021-05-03 00:13:31,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:31,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1101638973] [2021-05-03 00:13:31,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:31,196 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_589 999999) (< v_main_~x~0_589 500000)) InVars {main_~x~0=v_main_~x~0_589} OutVars{main_~x~0=v_main_~x~0_589} AuxVars[] AssignedVars[] [2021-05-03 00:13:31,197 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:31,198 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:31,202 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:31,211 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:31,223 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:31,225 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_591 500000) InVars {main_~x~0=v_main_~x~0_591} OutVars{main_~x~0=v_main_~x~0_591} AuxVars[] AssignedVars[] [2021-05-03 00:13:31,225 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:31,230 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:31,234 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:31,239 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:31,248 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:31,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:31,824 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:31,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1101638973] [2021-05-03 00:13:31,824 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1101638973] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:31,824 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:31,824 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:13:31,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724614261] [2021-05-03 00:13:31,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:13:31,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:31,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:13:31,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:13:31,826 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:33,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:33,572 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2021-05-03 00:13:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:13:33,573 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2021-05-03 00:13:33,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:33,573 INFO L225 Difference]: With dead ends: 82 [2021-05-03 00:13:33,573 INFO L226 Difference]: Without dead ends: 75 [2021-05-03 00:13:33,574 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1459.5ms TimeCoverageRelationStatistics Valid=257, Invalid=4165, Unknown=0, NotChecked=0, Total=4422 [2021-05-03 00:13:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-03 00:13:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-03 00:13:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2021-05-03 00:13:33,579 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 71 [2021-05-03 00:13:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:33,579 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2021-05-03 00:13:33,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2021-05-03 00:13:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-03 00:13:33,579 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:33,580 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:33,580 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-03 00:13:33,580 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:33,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:33,580 INFO L82 PathProgramCache]: Analyzing trace with hash 568866502, now seen corresponding path program 31 times [2021-05-03 00:13:33,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:33,580 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [865904511] [2021-05-03 00:13:33,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:33,584 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_624 500000) (< v_main_~x~0_624 999999)) InVars {main_~x~0=v_main_~x~0_624} OutVars{main_~x~0=v_main_~x~0_624} AuxVars[] AssignedVars[] [2021-05-03 00:13:33,586 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:33,591 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:33,596 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:33,606 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:33,625 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:33,628 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_626 500000) InVars {main_~x~0=v_main_~x~0_626} OutVars{main_~x~0=v_main_~x~0_626} AuxVars[] AssignedVars[] [2021-05-03 00:13:33,630 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:33,635 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:33,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:33,645 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:33,653 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:33,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:33,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:34,271 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:34,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [865904511] [2021-05-03 00:13:34,271 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [865904511] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:34,271 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:34,271 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:13:34,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564801833] [2021-05-03 00:13:34,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:13:34,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:34,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:13:34,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:13:34,272 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:36,117 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2021-05-03 00:13:36,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:13:36,118 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2021-05-03 00:13:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:36,118 INFO L225 Difference]: With dead ends: 84 [2021-05-03 00:13:36,119 INFO L226 Difference]: Without dead ends: 77 [2021-05-03 00:13:36,119 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1560.2ms TimeCoverageRelationStatistics Valid=265, Invalid=4427, Unknown=0, NotChecked=0, Total=4692 [2021-05-03 00:13:36,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-03 00:13:36,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-05-03 00:13:36,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2021-05-03 00:13:36,124 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 73 [2021-05-03 00:13:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:36,124 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2021-05-03 00:13:36,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2021-05-03 00:13:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-05-03 00:13:36,124 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:36,125 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:36,125 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-03 00:13:36,125 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:36,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:36,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2029325981, now seen corresponding path program 32 times [2021-05-03 00:13:36,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:36,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1652368729] [2021-05-03 00:13:36,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:36,131 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_660 999999) (< v_main_~x~0_660 500000)) InVars {main_~x~0=v_main_~x~0_660} OutVars{main_~x~0=v_main_~x~0_660} AuxVars[] AssignedVars[] [2021-05-03 00:13:36,137 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:36,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:36,147 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:36,153 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:36,161 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:36,169 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_662 500000) InVars {main_~x~0=v_main_~x~0_662} OutVars{main_~x~0=v_main_~x~0_662} AuxVars[] AssignedVars[] [2021-05-03 00:13:36,171 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:36,176 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:36,181 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:36,186 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:36,195 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:36,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:36,895 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:36,896 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1652368729] [2021-05-03 00:13:36,896 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1652368729] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:36,896 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:36,896 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:13:36,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241780271] [2021-05-03 00:13:36,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:13:36,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:36,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:13:36,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:13:36,902 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:38,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:38,841 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2021-05-03 00:13:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:13:38,841 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2021-05-03 00:13:38,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:38,842 INFO L225 Difference]: With dead ends: 86 [2021-05-03 00:13:38,842 INFO L226 Difference]: Without dead ends: 79 [2021-05-03 00:13:38,843 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1665.2ms TimeCoverageRelationStatistics Valid=273, Invalid=4697, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:13:38,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-05-03 00:13:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-05-03 00:13:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2021-05-03 00:13:38,848 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 75 [2021-05-03 00:13:38,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:38,848 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2021-05-03 00:13:38,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2021-05-03 00:13:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-03 00:13:38,849 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:38,849 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:38,849 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-03 00:13:38,849 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:38,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:38,849 INFO L82 PathProgramCache]: Analyzing trace with hash 778664128, now seen corresponding path program 33 times [2021-05-03 00:13:38,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:38,849 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584437906] [2021-05-03 00:13:38,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:38,854 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_697 999999) (< v_main_~x~0_697 500000)) InVars {main_~x~0=v_main_~x~0_697} OutVars{main_~x~0=v_main_~x~0_697} AuxVars[] AssignedVars[] [2021-05-03 00:13:38,857 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:38,862 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:38,880 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:38,888 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:38,899 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:38,900 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_699 500000) InVars {main_~x~0=v_main_~x~0_699} OutVars{main_~x~0=v_main_~x~0_699} AuxVars[] AssignedVars[] [2021-05-03 00:13:38,901 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:38,906 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:38,911 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:38,917 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:38,925 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:38,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:39,635 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:39,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584437906] [2021-05-03 00:13:39,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [584437906] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:39,635 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:39,636 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:13:39,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997380948] [2021-05-03 00:13:39,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:13:39,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:39,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:13:39,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:13:39,637 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:41,655 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2021-05-03 00:13:41,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:13:41,655 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2021-05-03 00:13:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:41,656 INFO L225 Difference]: With dead ends: 88 [2021-05-03 00:13:41,656 INFO L226 Difference]: Without dead ends: 81 [2021-05-03 00:13:41,656 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 1701.7ms TimeCoverageRelationStatistics Valid=281, Invalid=4975, Unknown=0, NotChecked=0, Total=5256 [2021-05-03 00:13:41,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-05-03 00:13:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-05-03 00:13:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2021-05-03 00:13:41,663 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 77 [2021-05-03 00:13:41,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:41,663 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2021-05-03 00:13:41,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2021-05-03 00:13:41,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:13:41,664 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:41,664 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:41,664 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-03 00:13:41,664 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:41,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2017696989, now seen corresponding path program 34 times [2021-05-03 00:13:41,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:41,664 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1719744855] [2021-05-03 00:13:41,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:41,669 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_735 999999) (< v_main_~x~0_735 500000)) InVars {main_~x~0=v_main_~x~0_735} OutVars{main_~x~0=v_main_~x~0_735} AuxVars[] AssignedVars[] [2021-05-03 00:13:41,670 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:41,676 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:41,680 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:41,685 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:41,693 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:41,695 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_737 500000) InVars {main_~x~0=v_main_~x~0_737} OutVars{main_~x~0=v_main_~x~0_737} AuxVars[] AssignedVars[] [2021-05-03 00:13:41,696 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:41,696 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:41,700 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:41,710 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:41,718 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:41,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:42,486 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:42,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1719744855] [2021-05-03 00:13:42,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1719744855] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:42,487 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:42,487 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:13:42,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230530658] [2021-05-03 00:13:42,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:13:42,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:42,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:13:42,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:13:42,488 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:44,653 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2021-05-03 00:13:44,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:13:44,653 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-03 00:13:44,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:44,654 INFO L225 Difference]: With dead ends: 90 [2021-05-03 00:13:44,654 INFO L226 Difference]: Without dead ends: 83 [2021-05-03 00:13:44,655 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1840.4ms TimeCoverageRelationStatistics Valid=289, Invalid=5261, Unknown=0, NotChecked=0, Total=5550 [2021-05-03 00:13:44,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-03 00:13:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-05-03 00:13:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2021-05-03 00:13:44,659 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 79 [2021-05-03 00:13:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:44,660 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2021-05-03 00:13:44,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2021-05-03 00:13:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-03 00:13:44,660 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:44,660 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:44,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-03 00:13:44,660 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:44,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:44,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1272631878, now seen corresponding path program 35 times [2021-05-03 00:13:44,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:44,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2143236353] [2021-05-03 00:13:44,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:44,673 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_774 500000) (< v_main_~x~0_774 999999)) InVars {main_~x~0=v_main_~x~0_774} OutVars{main_~x~0=v_main_~x~0_774} AuxVars[] AssignedVars[] [2021-05-03 00:13:44,674 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:44,680 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:44,684 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:44,690 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:44,699 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:44,701 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_776 500000) InVars {main_~x~0=v_main_~x~0_776} OutVars{main_~x~0=v_main_~x~0_776} AuxVars[] AssignedVars[] [2021-05-03 00:13:44,702 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:44,708 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:44,712 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:44,718 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:44,726 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:44,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:45,479 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:45,479 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2143236353] [2021-05-03 00:13:45,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2143236353] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:45,479 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:45,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:13:45,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437852156] [2021-05-03 00:13:45,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:13:45,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:45,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:13:45,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:13:45,481 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:47,714 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2021-05-03 00:13:47,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-03 00:13:47,714 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-03 00:13:47,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:47,715 INFO L225 Difference]: With dead ends: 92 [2021-05-03 00:13:47,715 INFO L226 Difference]: Without dead ends: 85 [2021-05-03 00:13:47,716 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1884.7ms TimeCoverageRelationStatistics Valid=297, Invalid=5555, Unknown=0, NotChecked=0, Total=5852 [2021-05-03 00:13:47,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-03 00:13:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-05-03 00:13:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2021-05-03 00:13:47,722 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 81 [2021-05-03 00:13:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:47,723 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2021-05-03 00:13:47,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2021-05-03 00:13:47,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-03 00:13:47,723 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:47,723 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:47,723 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-03 00:13:47,724 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:47,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:47,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2112224087, now seen corresponding path program 36 times [2021-05-03 00:13:47,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:47,724 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1392575806] [2021-05-03 00:13:47,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:47,729 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_814 999999) (< v_main_~x~0_814 500000)) InVars {main_~x~0=v_main_~x~0_814} OutVars{main_~x~0=v_main_~x~0_814} AuxVars[] AssignedVars[] [2021-05-03 00:13:47,735 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:47,735 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:47,740 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:47,750 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:47,758 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:47,760 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_816 500000) InVars {main_~x~0=v_main_~x~0_816} OutVars{main_~x~0=v_main_~x~0_816} AuxVars[] AssignedVars[] [2021-05-03 00:13:47,761 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:47,761 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:47,765 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:47,775 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:47,783 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:47,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:47,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:48,648 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:48,648 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1392575806] [2021-05-03 00:13:48,648 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1392575806] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:48,648 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:48,648 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:13:48,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534647802] [2021-05-03 00:13:48,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:13:48,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:48,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:13:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:13:48,650 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:51,033 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-05-03 00:13:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-03 00:13:51,034 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2021-05-03 00:13:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:51,034 INFO L225 Difference]: With dead ends: 94 [2021-05-03 00:13:51,035 INFO L226 Difference]: Without dead ends: 87 [2021-05-03 00:13:51,035 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 2051.0ms TimeCoverageRelationStatistics Valid=305, Invalid=5857, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:13:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-05-03 00:13:51,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-05-03 00:13:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2021-05-03 00:13:51,042 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 83 [2021-05-03 00:13:51,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:51,042 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2021-05-03 00:13:51,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2021-05-03 00:13:51,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-05-03 00:13:51,043 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:51,043 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:51,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-05-03 00:13:51,043 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:51,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:51,044 INFO L82 PathProgramCache]: Analyzing trace with hash -626403916, now seen corresponding path program 37 times [2021-05-03 00:13:51,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:51,044 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1721060100] [2021-05-03 00:13:51,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:51,049 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_855 500000) (< v_main_~x~0_855 999999)) InVars {main_~x~0=v_main_~x~0_855} OutVars{main_~x~0=v_main_~x~0_855} AuxVars[] AssignedVars[] [2021-05-03 00:13:51,050 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:51,055 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:51,066 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:51,072 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:51,082 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:51,083 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_857 500000) InVars {main_~x~0=v_main_~x~0_857} OutVars{main_~x~0=v_main_~x~0_857} AuxVars[] AssignedVars[] [2021-05-03 00:13:51,085 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:51,090 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:51,099 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:51,105 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:51,115 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:51,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:51,972 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:51,973 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1721060100] [2021-05-03 00:13:51,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1721060100] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:51,973 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:51,973 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-03 00:13:51,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95681889] [2021-05-03 00:13:51,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-03 00:13:51,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:51,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-03 00:13:51,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:13:51,975 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:54,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:54,415 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-05-03 00:13:54,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-03 00:13:54,415 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2021-05-03 00:13:54,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:54,416 INFO L225 Difference]: With dead ends: 96 [2021-05-03 00:13:54,416 INFO L226 Difference]: Without dead ends: 89 [2021-05-03 00:13:54,417 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 2059.9ms TimeCoverageRelationStatistics Valid=313, Invalid=6167, Unknown=0, NotChecked=0, Total=6480 [2021-05-03 00:13:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-03 00:13:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-05-03 00:13:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2021-05-03 00:13:54,423 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 85 [2021-05-03 00:13:54,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:54,423 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2021-05-03 00:13:54,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:54,423 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2021-05-03 00:13:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-03 00:13:54,424 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:54,424 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:54,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-03 00:13:54,424 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:54,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:54,425 INFO L82 PathProgramCache]: Analyzing trace with hash 367037649, now seen corresponding path program 38 times [2021-05-03 00:13:54,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:54,425 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [922785695] [2021-05-03 00:13:54,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:54,428 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_897 500000) (< v_main_~x~0_897 999999)) InVars {main_~x~0=v_main_~x~0_897} OutVars{main_~x~0=v_main_~x~0_897} AuxVars[] AssignedVars[] [2021-05-03 00:13:54,430 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:54,430 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:54,434 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:54,446 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:54,454 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:54,456 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_899 500000) InVars {main_~x~0=v_main_~x~0_899} OutVars{main_~x~0=v_main_~x~0_899} AuxVars[] AssignedVars[] [2021-05-03 00:13:54,457 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:54,461 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:54,465 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:54,473 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:54,482 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:54,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:55,405 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:55,405 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [922785695] [2021-05-03 00:13:55,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [922785695] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:55,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:55,406 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-03 00:13:55,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016509836] [2021-05-03 00:13:55,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-03 00:13:55,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:55,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-03 00:13:55,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:13:55,407 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:58,017 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2021-05-03 00:13:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-03 00:13:58,018 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2021-05-03 00:13:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:58,018 INFO L225 Difference]: With dead ends: 98 [2021-05-03 00:13:58,018 INFO L226 Difference]: Without dead ends: 91 [2021-05-03 00:13:58,019 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 2238.7ms TimeCoverageRelationStatistics Valid=321, Invalid=6485, Unknown=0, NotChecked=0, Total=6806 [2021-05-03 00:13:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-05-03 00:13:58,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-05-03 00:13:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2021-05-03 00:13:58,026 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 87 [2021-05-03 00:13:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:58,027 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2021-05-03 00:13:58,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2021-05-03 00:13:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-03 00:13:58,027 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:58,028 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:58,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-05-03 00:13:58,028 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:58,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1581641902, now seen corresponding path program 39 times [2021-05-03 00:13:58,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:58,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1565753761] [2021-05-03 00:13:58,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:58,033 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_940 999999) (< v_main_~x~0_940 500000)) InVars {main_~x~0=v_main_~x~0_940} OutVars{main_~x~0=v_main_~x~0_940} AuxVars[] AssignedVars[] [2021-05-03 00:13:58,035 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:13:58,041 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:58,046 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:58,052 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:13:58,061 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:58,062 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_942 500000) InVars {main_~x~0=v_main_~x~0_942} OutVars{main_~x~0=v_main_~x~0_942} AuxVars[] AssignedVars[] [2021-05-03 00:13:58,063 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:13:58,069 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:58,075 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:58,081 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:13:58,091 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:58,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:58,978 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:58,979 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1565753761] [2021-05-03 00:13:58,979 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1565753761] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:58,979 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:58,979 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-03 00:13:58,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821810681] [2021-05-03 00:13:58,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-03 00:13:58,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:58,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-03 00:13:58,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:13:58,980 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:01,645 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2021-05-03 00:14:01,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-03 00:14:01,645 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2021-05-03 00:14:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:01,646 INFO L225 Difference]: With dead ends: 100 [2021-05-03 00:14:01,646 INFO L226 Difference]: Without dead ends: 93 [2021-05-03 00:14:01,647 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 2224.8ms TimeCoverageRelationStatistics Valid=329, Invalid=6811, Unknown=0, NotChecked=0, Total=7140 [2021-05-03 00:14:01,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-03 00:14:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-05-03 00:14:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2021-05-03 00:14:01,653 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 89 [2021-05-03 00:14:01,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:01,654 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2021-05-03 00:14:01,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2021-05-03 00:14:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-03 00:14:01,654 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:01,654 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:01,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-03 00:14:01,655 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:01,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:01,655 INFO L82 PathProgramCache]: Analyzing trace with hash 585224523, now seen corresponding path program 40 times [2021-05-03 00:14:01,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:01,655 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [734759556] [2021-05-03 00:14:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:01,659 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_984 999999) (< v_main_~x~0_984 500000)) InVars {main_~x~0=v_main_~x~0_984} OutVars{main_~x~0=v_main_~x~0_984} AuxVars[] AssignedVars[] [2021-05-03 00:14:01,661 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:14:01,667 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:01,671 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:01,676 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:14:01,685 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:01,686 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_986 500000) InVars {main_~x~0=v_main_~x~0_986} OutVars{main_~x~0=v_main_~x~0_986} AuxVars[] AssignedVars[] [2021-05-03 00:14:01,687 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:14:01,691 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:01,695 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:01,700 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:14:01,709 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:01,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:02,700 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:02,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [734759556] [2021-05-03 00:14:02,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [734759556] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:02,701 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:02,701 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-03 00:14:02,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731208271] [2021-05-03 00:14:02,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-03 00:14:02,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:02,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-03 00:14:02,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:14:02,703 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:05,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:05,492 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2021-05-03 00:14:05,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-03 00:14:05,492 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2021-05-03 00:14:05,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:05,493 INFO L225 Difference]: With dead ends: 102 [2021-05-03 00:14:05,493 INFO L226 Difference]: Without dead ends: 95 [2021-05-03 00:14:05,493 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 2331.6ms TimeCoverageRelationStatistics Valid=337, Invalid=7145, Unknown=0, NotChecked=0, Total=7482 [2021-05-03 00:14:05,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-03 00:14:05,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-05-03 00:14:05,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2021-05-03 00:14:05,500 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 91 [2021-05-03 00:14:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:05,501 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2021-05-03 00:14:05,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2021-05-03 00:14:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-03 00:14:05,501 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:05,502 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:05,502 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-03 00:14:05,502 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:05,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:05,502 INFO L82 PathProgramCache]: Analyzing trace with hash 805830312, now seen corresponding path program 41 times [2021-05-03 00:14:05,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:05,502 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [977414665] [2021-05-03 00:14:05,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:05,508 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1029 999999) (< v_main_~x~0_1029 500000)) InVars {main_~x~0=v_main_~x~0_1029} OutVars{main_~x~0=v_main_~x~0_1029} AuxVars[] AssignedVars[] [2021-05-03 00:14:05,509 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:14:05,510 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:05,514 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:05,524 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:14:05,533 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:05,535 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1031 500000) InVars {main_~x~0=v_main_~x~0_1031} OutVars{main_~x~0=v_main_~x~0_1031} AuxVars[] AssignedVars[] [2021-05-03 00:14:05,536 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:14:05,537 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:05,541 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:05,550 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:14:05,560 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:05,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:05,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:06,580 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:06,580 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [977414665] [2021-05-03 00:14:06,580 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [977414665] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:06,580 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:06,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-03 00:14:06,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883631558] [2021-05-03 00:14:06,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-03 00:14:06,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:06,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-03 00:14:06,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:14:06,581 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:09,499 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2021-05-03 00:14:09,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-03 00:14:09,500 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2021-05-03 00:14:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:09,501 INFO L225 Difference]: With dead ends: 104 [2021-05-03 00:14:09,501 INFO L226 Difference]: Without dead ends: 97 [2021-05-03 00:14:09,501 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 2435.4ms TimeCoverageRelationStatistics Valid=345, Invalid=7487, Unknown=0, NotChecked=0, Total=7832 [2021-05-03 00:14:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-03 00:14:09,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-05-03 00:14:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2021-05-03 00:14:09,508 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 93 [2021-05-03 00:14:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:09,508 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2021-05-03 00:14:09,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2021-05-03 00:14:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-03 00:14:09,509 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:09,509 INFO L523 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:09,509 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-03 00:14:09,510 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:09,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1940371259, now seen corresponding path program 42 times [2021-05-03 00:14:09,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:09,510 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1187602398] [2021-05-03 00:14:09,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:09,515 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1075 500000) (< v_main_~x~0_1075 999999)) InVars {main_~x~0=v_main_~x~0_1075} OutVars{main_~x~0=v_main_~x~0_1075} AuxVars[] AssignedVars[] [2021-05-03 00:14:09,516 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:14:09,522 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:09,527 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:09,533 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:14:09,542 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:09,545 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1077 500000) InVars {main_~x~0=v_main_~x~0_1077} OutVars{main_~x~0=v_main_~x~0_1077} AuxVars[] AssignedVars[] [2021-05-03 00:14:09,546 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:14:09,553 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:09,558 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:09,565 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:14:09,575 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:09,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:10,654 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:10,654 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1187602398] [2021-05-03 00:14:10,654 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1187602398] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:10,654 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:10,654 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-03 00:14:10,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769925217] [2021-05-03 00:14:10,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-03 00:14:10,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:10,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-03 00:14:10,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2021-05-03 00:14:10,655 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:13,683 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-05-03 00:14:13,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-03 00:14:13,683 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2021-05-03 00:14:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:13,684 INFO L225 Difference]: With dead ends: 106 [2021-05-03 00:14:13,684 INFO L226 Difference]: Without dead ends: 99 [2021-05-03 00:14:13,685 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 2571.1ms TimeCoverageRelationStatistics Valid=353, Invalid=7837, Unknown=0, NotChecked=0, Total=8190 [2021-05-03 00:14:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-03 00:14:13,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-05-03 00:14:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:13,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2021-05-03 00:14:13,693 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 95 [2021-05-03 00:14:13,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:13,694 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2021-05-03 00:14:13,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2021-05-03 00:14:13,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-05-03 00:14:13,695 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:13,695 INFO L523 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:13,695 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-05-03 00:14:13,695 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:13,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:13,695 INFO L82 PathProgramCache]: Analyzing trace with hash 364806050, now seen corresponding path program 43 times [2021-05-03 00:14:13,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:13,695 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1816463430] [2021-05-03 00:14:13,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:13,700 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1122 999999) (< v_main_~x~0_1122 500000)) InVars {main_~x~0=v_main_~x~0_1122} OutVars{main_~x~0=v_main_~x~0_1122} AuxVars[] AssignedVars[] [2021-05-03 00:14:13,702 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:14:13,707 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:13,712 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:13,718 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:14:13,728 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:13,729 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1124 500000) InVars {main_~x~0=v_main_~x~0_1124} OutVars{main_~x~0=v_main_~x~0_1124} AuxVars[] AssignedVars[] [2021-05-03 00:14:13,731 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:14:13,736 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:13,741 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:13,747 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:14:13,761 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:13,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:14,871 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:14,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1816463430] [2021-05-03 00:14:14,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1816463430] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:14,871 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:14,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-03 00:14:14,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624172329] [2021-05-03 00:14:14,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-03 00:14:14,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:14,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-03 00:14:14,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:14:14,872 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:18,022 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2021-05-03 00:14:18,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-03 00:14:18,022 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2021-05-03 00:14:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:18,023 INFO L225 Difference]: With dead ends: 108 [2021-05-03 00:14:18,023 INFO L226 Difference]: Without dead ends: 101 [2021-05-03 00:14:18,024 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 2648.6ms TimeCoverageRelationStatistics Valid=361, Invalid=8195, Unknown=0, NotChecked=0, Total=8556 [2021-05-03 00:14:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-03 00:14:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-05-03 00:14:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2021-05-03 00:14:18,031 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 97 [2021-05-03 00:14:18,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:18,032 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2021-05-03 00:14:18,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2021-05-03 00:14:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-05-03 00:14:18,033 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:18,033 INFO L523 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:18,033 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-03 00:14:18,033 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:18,033 INFO L82 PathProgramCache]: Analyzing trace with hash -562924737, now seen corresponding path program 44 times [2021-05-03 00:14:18,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:18,033 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1920109721] [2021-05-03 00:14:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:18,040 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1170 999999) (< v_main_~x~0_1170 500000)) InVars {main_~x~0=v_main_~x~0_1170} OutVars{main_~x~0=v_main_~x~0_1170} AuxVars[] AssignedVars[] [2021-05-03 00:14:18,042 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:14:18,043 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:18,053 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:18,064 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:14:18,074 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:18,075 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1172 500000) InVars {main_~x~0=v_main_~x~0_1172} OutVars{main_~x~0=v_main_~x~0_1172} AuxVars[] AssignedVars[] [2021-05-03 00:14:18,077 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:14:18,078 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:18,082 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:18,092 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:14:18,100 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:18,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:19,256 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:19,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1920109721] [2021-05-03 00:14:19,257 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1920109721] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:19,257 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:19,257 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-03 00:14:19,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504990608] [2021-05-03 00:14:19,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-03 00:14:19,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:19,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-03 00:14:19,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2021-05-03 00:14:19,258 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:22,573 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2021-05-03 00:14:22,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-03 00:14:22,574 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2021-05-03 00:14:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:22,574 INFO L225 Difference]: With dead ends: 110 [2021-05-03 00:14:22,574 INFO L226 Difference]: Without dead ends: 103 [2021-05-03 00:14:22,575 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 2756.4ms TimeCoverageRelationStatistics Valid=369, Invalid=8561, Unknown=0, NotChecked=0, Total=8930 [2021-05-03 00:14:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-05-03 00:14:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-05-03 00:14:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2021-05-03 00:14:22,582 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 99 [2021-05-03 00:14:22,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:22,583 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2021-05-03 00:14:22,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2021-05-03 00:14:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-05-03 00:14:22,583 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:22,584 INFO L523 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:22,584 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-05-03 00:14:22,584 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1240986524, now seen corresponding path program 45 times [2021-05-03 00:14:22,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:22,584 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1930366838] [2021-05-03 00:14:22,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:22,589 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1219 999999) (< v_main_~x~0_1219 500000)) InVars {main_~x~0=v_main_~x~0_1219} OutVars{main_~x~0=v_main_~x~0_1219} AuxVars[] AssignedVars[] [2021-05-03 00:14:22,590 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:14:22,596 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:22,601 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:22,607 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:14:22,617 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:22,619 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1221 500000) InVars {main_~x~0=v_main_~x~0_1221} OutVars{main_~x~0=v_main_~x~0_1221} AuxVars[] AssignedVars[] [2021-05-03 00:14:22,620 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:14:22,621 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:22,626 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:22,637 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:14:22,646 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:22,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:23,941 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:23,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1930366838] [2021-05-03 00:14:23,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1930366838] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:23,941 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:23,941 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-03 00:14:23,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421814702] [2021-05-03 00:14:23,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-03 00:14:23,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:23,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-03 00:14:23,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:14:23,942 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:27,358 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2021-05-03 00:14:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-03 00:14:27,358 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2021-05-03 00:14:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:27,359 INFO L225 Difference]: With dead ends: 112 [2021-05-03 00:14:27,359 INFO L226 Difference]: Without dead ends: 105 [2021-05-03 00:14:27,359 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 43 SyntacticMatches, 10 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 2958.6ms TimeCoverageRelationStatistics Valid=377, Invalid=8935, Unknown=0, NotChecked=0, Total=9312 [2021-05-03 00:14:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-05-03 00:14:27,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-05-03 00:14:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2021-05-03 00:14:27,368 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 101 [2021-05-03 00:14:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:27,368 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2021-05-03 00:14:27,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2021-05-03 00:14:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-05-03 00:14:27,369 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:27,369 INFO L523 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:27,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-03 00:14:27,369 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:27,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:27,369 INFO L82 PathProgramCache]: Analyzing trace with hash -367079239, now seen corresponding path program 46 times [2021-05-03 00:14:27,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:27,370 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2053115105] [2021-05-03 00:14:27,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:27,378 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1269 500000) (< v_main_~x~0_1269 999999)) InVars {main_~x~0=v_main_~x~0_1269} OutVars{main_~x~0=v_main_~x~0_1269} AuxVars[] AssignedVars[] [2021-05-03 00:14:27,380 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:14:27,380 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:27,385 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:27,397 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:14:27,407 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:27,409 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1271 500000) InVars {main_~x~0=v_main_~x~0_1271} OutVars{main_~x~0=v_main_~x~0_1271} AuxVars[] AssignedVars[] [2021-05-03 00:14:27,410 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:14:27,414 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:27,418 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:27,423 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:14:27,432 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:27,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:28,764 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:28,764 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2053115105] [2021-05-03 00:14:28,764 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2053115105] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:28,764 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:28,764 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-03 00:14:28,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962380394] [2021-05-03 00:14:28,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-03 00:14:28,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:28,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-03 00:14:28,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2021-05-03 00:14:28,766 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:32,302 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2021-05-03 00:14:32,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-03 00:14:32,303 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2021-05-03 00:14:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:32,303 INFO L225 Difference]: With dead ends: 114 [2021-05-03 00:14:32,304 INFO L226 Difference]: Without dead ends: 107 [2021-05-03 00:14:32,304 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 3036.3ms TimeCoverageRelationStatistics Valid=385, Invalid=9317, Unknown=0, NotChecked=0, Total=9702 [2021-05-03 00:14:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-03 00:14:32,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-05-03 00:14:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2021-05-03 00:14:32,311 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 103 [2021-05-03 00:14:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:32,311 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2021-05-03 00:14:32,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2021-05-03 00:14:32,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-03 00:14:32,312 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:32,312 INFO L523 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:32,312 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-05-03 00:14:32,312 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:32,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:32,313 INFO L82 PathProgramCache]: Analyzing trace with hash 469949078, now seen corresponding path program 47 times [2021-05-03 00:14:32,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:32,313 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [393379223] [2021-05-03 00:14:32,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:32,320 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1320 500000) (< v_main_~x~0_1320 999999)) InVars {main_~x~0=v_main_~x~0_1320} OutVars{main_~x~0=v_main_~x~0_1320} AuxVars[] AssignedVars[] [2021-05-03 00:14:32,321 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:14:32,326 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:32,330 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:32,343 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:14:32,351 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:32,353 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1322 500000) InVars {main_~x~0=v_main_~x~0_1322} OutVars{main_~x~0=v_main_~x~0_1322} AuxVars[] AssignedVars[] [2021-05-03 00:14:32,353 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:14:32,354 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:32,358 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:32,367 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:14:32,376 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:32,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:33,615 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:33,616 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [393379223] [2021-05-03 00:14:33,616 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [393379223] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:33,616 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:33,616 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-05-03 00:14:33,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646139268] [2021-05-03 00:14:33,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-05-03 00:14:33,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:33,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-05-03 00:14:33,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2021-05-03 00:14:33,617 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:37,317 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2021-05-03 00:14:37,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-03 00:14:37,318 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2021-05-03 00:14:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:37,319 INFO L225 Difference]: With dead ends: 116 [2021-05-03 00:14:37,319 INFO L226 Difference]: Without dead ends: 109 [2021-05-03 00:14:37,320 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 3032.9ms TimeCoverageRelationStatistics Valid=393, Invalid=9707, Unknown=0, NotChecked=0, Total=10100 [2021-05-03 00:14:37,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-03 00:14:37,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-05-03 00:14:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2021-05-03 00:14:37,329 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 105 [2021-05-03 00:14:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:37,329 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2021-05-03 00:14:37,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2021-05-03 00:14:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-03 00:14:37,330 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:37,330 INFO L523 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:37,330 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-03 00:14:37,330 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:37,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:37,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1695277363, now seen corresponding path program 48 times [2021-05-03 00:14:37,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:37,331 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [891964234] [2021-05-03 00:14:37,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:37,335 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1372 999999) (< v_main_~x~0_1372 500000)) InVars {main_~x~0=v_main_~x~0_1372} OutVars{main_~x~0=v_main_~x~0_1372} AuxVars[] AssignedVars[] [2021-05-03 00:14:37,337 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:14:37,337 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:37,342 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:37,353 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:14:37,363 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:37,365 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1374 500000) InVars {main_~x~0=v_main_~x~0_1374} OutVars{main_~x~0=v_main_~x~0_1374} AuxVars[] AssignedVars[] [2021-05-03 00:14:37,366 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:14:37,367 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:37,371 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:37,383 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:14:37,393 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:37,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:38,734 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:38,735 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [891964234] [2021-05-03 00:14:38,735 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [891964234] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:38,735 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:38,735 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-03 00:14:38,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729843087] [2021-05-03 00:14:38,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-03 00:14:38,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:38,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-03 00:14:38,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2021-05-03 00:14:38,736 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:42,572 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2021-05-03 00:14:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-03 00:14:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2021-05-03 00:14:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:42,574 INFO L225 Difference]: With dead ends: 118 [2021-05-03 00:14:42,574 INFO L226 Difference]: Without dead ends: 111 [2021-05-03 00:14:42,575 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 3196.8ms TimeCoverageRelationStatistics Valid=401, Invalid=10105, Unknown=0, NotChecked=0, Total=10506 [2021-05-03 00:14:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-05-03 00:14:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-05-03 00:14:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2021-05-03 00:14:42,584 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 107 [2021-05-03 00:14:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:42,584 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2021-05-03 00:14:42,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2021-05-03 00:14:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-05-03 00:14:42,585 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:42,585 INFO L523 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:42,585 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-05-03 00:14:42,585 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:42,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:42,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1880247152, now seen corresponding path program 49 times [2021-05-03 00:14:42,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:42,586 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [233428467] [2021-05-03 00:14:42,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:42,590 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1425 500000) (< v_main_~x~0_1425 999999)) InVars {main_~x~0=v_main_~x~0_1425} OutVars{main_~x~0=v_main_~x~0_1425} AuxVars[] AssignedVars[] [2021-05-03 00:14:42,592 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:14:42,592 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:42,597 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:42,608 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:14:42,617 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:42,618 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1427 500000) InVars {main_~x~0=v_main_~x~0_1427} OutVars{main_~x~0=v_main_~x~0_1427} AuxVars[] AssignedVars[] [2021-05-03 00:14:42,619 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:14:42,620 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:42,624 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:42,634 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:14:42,643 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:42,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:43,989 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:43,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [233428467] [2021-05-03 00:14:43,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [233428467] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:43,990 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:43,990 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-05-03 00:14:43,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756495974] [2021-05-03 00:14:43,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-05-03 00:14:43,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:43,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-05-03 00:14:43,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2021-05-03 00:14:43,991 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:48,144 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2021-05-03 00:14:48,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-03 00:14:48,144 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2021-05-03 00:14:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:48,145 INFO L225 Difference]: With dead ends: 120 [2021-05-03 00:14:48,146 INFO L226 Difference]: Without dead ends: 113 [2021-05-03 00:14:48,146 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 3340.6ms TimeCoverageRelationStatistics Valid=409, Invalid=10511, Unknown=0, NotChecked=0, Total=10920 [2021-05-03 00:14:48,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-03 00:14:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-05-03 00:14:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2021-05-03 00:14:48,153 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 109 [2021-05-03 00:14:48,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:48,153 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2021-05-03 00:14:48,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:48,154 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2021-05-03 00:14:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-03 00:14:48,154 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:48,154 INFO L523 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:48,154 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-03 00:14:48,154 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:48,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:48,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1985469267, now seen corresponding path program 50 times [2021-05-03 00:14:48,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:48,155 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1078877551] [2021-05-03 00:14:48,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:48,159 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1479 999999) (< v_main_~x~0_1479 500000)) InVars {main_~x~0=v_main_~x~0_1479} OutVars{main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[] [2021-05-03 00:14:48,161 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:14:48,167 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:48,172 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:48,184 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:14:48,194 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:48,196 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1481 500000) InVars {main_~x~0=v_main_~x~0_1481} OutVars{main_~x~0=v_main_~x~0_1481} AuxVars[] AssignedVars[] [2021-05-03 00:14:48,197 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:14:48,198 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:48,203 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:48,214 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:14:48,224 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:48,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:48,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:49,679 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:49,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1078877551] [2021-05-03 00:14:49,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1078877551] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:49,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:49,680 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-03 00:14:49,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794806150] [2021-05-03 00:14:49,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-03 00:14:49,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:49,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-03 00:14:49,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2021-05-03 00:14:49,681 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:53,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:53,840 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2021-05-03 00:14:53,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-03 00:14:53,840 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2021-05-03 00:14:53,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:53,841 INFO L225 Difference]: With dead ends: 122 [2021-05-03 00:14:53,841 INFO L226 Difference]: Without dead ends: 115 [2021-05-03 00:14:53,842 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1392 ImplicationChecksByTransitivity, 3457.4ms TimeCoverageRelationStatistics Valid=417, Invalid=10925, Unknown=0, NotChecked=0, Total=11342 [2021-05-03 00:14:53,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-05-03 00:14:53,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-05-03 00:14:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2021-05-03 00:14:53,852 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 111 [2021-05-03 00:14:53,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:53,852 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2021-05-03 00:14:53,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:53,852 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2021-05-03 00:14:53,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-03 00:14:53,853 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:53,853 INFO L523 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:53,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-05-03 00:14:53,853 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:53,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:53,854 INFO L82 PathProgramCache]: Analyzing trace with hash -24706678, now seen corresponding path program 51 times [2021-05-03 00:14:53,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:53,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [730722075] [2021-05-03 00:14:53,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:53,859 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1534 500000) (< v_main_~x~0_1534 999999)) InVars {main_~x~0=v_main_~x~0_1534} OutVars{main_~x~0=v_main_~x~0_1534} AuxVars[] AssignedVars[] [2021-05-03 00:14:53,861 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:14:53,862 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:53,867 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:53,880 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:14:53,891 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:53,893 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1536 500000) InVars {main_~x~0=v_main_~x~0_1536} OutVars{main_~x~0=v_main_~x~0_1536} AuxVars[] AssignedVars[] [2021-05-03 00:14:53,894 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:14:53,900 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:53,905 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:53,912 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:14:53,923 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:53,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:55,538 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:55,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [730722075] [2021-05-03 00:14:55,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [730722075] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:55,539 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:55,539 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-03 00:14:55,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536682680] [2021-05-03 00:14:55,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-03 00:14:55,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:55,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-03 00:14:55,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:14:55,540 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:59,859 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2021-05-03 00:14:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-03 00:14:59,859 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2021-05-03 00:14:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:59,860 INFO L225 Difference]: With dead ends: 124 [2021-05-03 00:14:59,860 INFO L226 Difference]: Without dead ends: 117 [2021-05-03 00:14:59,861 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 3689.2ms TimeCoverageRelationStatistics Valid=425, Invalid=11347, Unknown=0, NotChecked=0, Total=11772 [2021-05-03 00:14:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-05-03 00:14:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-05-03 00:14:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2021-05-03 00:14:59,872 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 113 [2021-05-03 00:14:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:59,872 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2021-05-03 00:14:59,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:14:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2021-05-03 00:14:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-05-03 00:14:59,873 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:59,873 INFO L523 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:59,873 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-05-03 00:14:59,873 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:59,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:59,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1222501593, now seen corresponding path program 52 times [2021-05-03 00:14:59,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:59,874 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99843581] [2021-05-03 00:14:59,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:59,884 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1590 999999) (< v_main_~x~0_1590 500000)) InVars {main_~x~0=v_main_~x~0_1590} OutVars{main_~x~0=v_main_~x~0_1590} AuxVars[] AssignedVars[] [2021-05-03 00:14:59,885 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:14:59,891 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:59,896 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:59,902 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:14:59,912 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:59,915 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1592 500000) InVars {main_~x~0=v_main_~x~0_1592} OutVars{main_~x~0=v_main_~x~0_1592} AuxVars[] AssignedVars[] [2021-05-03 00:14:59,918 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:14:59,923 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:59,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:59,938 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:14:59,948 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:59,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:01,573 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:01,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99843581] [2021-05-03 00:15:01,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [99843581] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:01,573 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:01,573 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2021-05-03 00:15:01,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429909257] [2021-05-03 00:15:01,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-05-03 00:15:01,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:01,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-05-03 00:15:01,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2021-05-03 00:15:01,574 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:06,171 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2021-05-03 00:15:06,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-05-03 00:15:06,172 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2021-05-03 00:15:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:06,172 INFO L225 Difference]: With dead ends: 126 [2021-05-03 00:15:06,173 INFO L226 Difference]: Without dead ends: 119 [2021-05-03 00:15:06,173 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 3801.3ms TimeCoverageRelationStatistics Valid=433, Invalid=11777, Unknown=0, NotChecked=0, Total=12210 [2021-05-03 00:15:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-03 00:15:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-05-03 00:15:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2021-05-03 00:15:06,181 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 115 [2021-05-03 00:15:06,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:06,181 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2021-05-03 00:15:06,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:06,181 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2021-05-03 00:15:06,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-05-03 00:15:06,182 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:06,182 INFO L523 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:06,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-05-03 00:15:06,182 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:06,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:06,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1252179580, now seen corresponding path program 53 times [2021-05-03 00:15:06,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:06,183 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1721632078] [2021-05-03 00:15:06,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:06,187 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1647 500000) (< v_main_~x~0_1647 999999)) InVars {main_~x~0=v_main_~x~0_1647} OutVars{main_~x~0=v_main_~x~0_1647} AuxVars[] AssignedVars[] [2021-05-03 00:15:06,189 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:15:06,195 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:06,200 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:06,207 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:15:06,218 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:06,219 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1649 500000) InVars {main_~x~0=v_main_~x~0_1649} OutVars{main_~x~0=v_main_~x~0_1649} AuxVars[] AssignedVars[] [2021-05-03 00:15:06,221 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:15:06,222 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:06,227 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:06,238 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:15:06,248 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:06,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:07,872 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:07,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1721632078] [2021-05-03 00:15:07,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1721632078] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:07,872 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:07,873 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2021-05-03 00:15:07,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63501268] [2021-05-03 00:15:07,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2021-05-03 00:15:07,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:07,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-05-03 00:15:07,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2021-05-03 00:15:07,874 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:12,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:12,606 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2021-05-03 00:15:12,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-03 00:15:12,610 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2021-05-03 00:15:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:12,610 INFO L225 Difference]: With dead ends: 128 [2021-05-03 00:15:12,610 INFO L226 Difference]: Without dead ends: 121 [2021-05-03 00:15:12,611 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 3889.2ms TimeCoverageRelationStatistics Valid=441, Invalid=12215, Unknown=0, NotChecked=0, Total=12656 [2021-05-03 00:15:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-05-03 00:15:12,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-05-03 00:15:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2021-05-03 00:15:12,621 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 117 [2021-05-03 00:15:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:12,621 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2021-05-03 00:15:12,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2021-05-03 00:15:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-05-03 00:15:12,622 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:12,622 INFO L523 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:12,622 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-05-03 00:15:12,622 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:12,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:12,623 INFO L82 PathProgramCache]: Analyzing trace with hash 292045985, now seen corresponding path program 54 times [2021-05-03 00:15:12,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:12,623 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [855971748] [2021-05-03 00:15:12,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:12,628 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1705 999999) (< v_main_~x~0_1705 500000)) InVars {main_~x~0=v_main_~x~0_1705} OutVars{main_~x~0=v_main_~x~0_1705} AuxVars[] AssignedVars[] [2021-05-03 00:15:12,629 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:15:12,635 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:12,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:12,647 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:15:12,657 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:12,659 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1707 500000) InVars {main_~x~0=v_main_~x~0_1707} OutVars{main_~x~0=v_main_~x~0_1707} AuxVars[] AssignedVars[] [2021-05-03 00:15:12,660 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:15:12,661 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:12,666 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:12,678 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:15:12,688 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:12,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:14,615 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:14,615 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [855971748] [2021-05-03 00:15:14,615 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [855971748] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:14,615 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:14,616 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-03 00:15:14,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028630551] [2021-05-03 00:15:14,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-03 00:15:14,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:14,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-03 00:15:14,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2021-05-03 00:15:14,617 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:19,665 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2021-05-03 00:15:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-03 00:15:19,666 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2021-05-03 00:15:19,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:19,669 INFO L225 Difference]: With dead ends: 130 [2021-05-03 00:15:19,669 INFO L226 Difference]: Without dead ends: 123 [2021-05-03 00:15:19,670 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 4290.9ms TimeCoverageRelationStatistics Valid=449, Invalid=12661, Unknown=0, NotChecked=0, Total=13110 [2021-05-03 00:15:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-05-03 00:15:19,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-05-03 00:15:19,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:19,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2021-05-03 00:15:19,679 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 119 [2021-05-03 00:15:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:19,679 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2021-05-03 00:15:19,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2021-05-03 00:15:19,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-03 00:15:19,680 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:19,680 INFO L523 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:19,680 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-05-03 00:15:19,680 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:19,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:19,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1765870466, now seen corresponding path program 55 times [2021-05-03 00:15:19,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:19,681 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [114251038] [2021-05-03 00:15:19,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:19,696 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1764 500000) (< v_main_~x~0_1764 999999)) InVars {main_~x~0=v_main_~x~0_1764} OutVars{main_~x~0=v_main_~x~0_1764} AuxVars[] AssignedVars[] [2021-05-03 00:15:19,698 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:15:19,698 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:19,703 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:19,713 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:15:19,723 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:19,724 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1766 500000) InVars {main_~x~0=v_main_~x~0_1766} OutVars{main_~x~0=v_main_~x~0_1766} AuxVars[] AssignedVars[] [2021-05-03 00:15:19,725 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:15:19,726 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:19,730 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:19,740 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:15:19,749 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:19,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:21,538 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:21,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [114251038] [2021-05-03 00:15:21,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [114251038] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:21,539 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:21,539 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2021-05-03 00:15:21,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218612862] [2021-05-03 00:15:21,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-05-03 00:15:21,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:21,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-05-03 00:15:21,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2021-05-03 00:15:21,540 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:26,674 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2021-05-03 00:15:26,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-03 00:15:26,674 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-05-03 00:15:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:26,675 INFO L225 Difference]: With dead ends: 132 [2021-05-03 00:15:26,675 INFO L226 Difference]: Without dead ends: 125 [2021-05-03 00:15:26,677 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 51 SyntacticMatches, 11 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 4244.0ms TimeCoverageRelationStatistics Valid=457, Invalid=13115, Unknown=0, NotChecked=0, Total=13572 [2021-05-03 00:15:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-05-03 00:15:26,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-05-03 00:15:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2021-05-03 00:15:26,686 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 121 [2021-05-03 00:15:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:26,686 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2021-05-03 00:15:26,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2021-05-03 00:15:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-03 00:15:26,687 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:26,687 INFO L523 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:26,687 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-05-03 00:15:26,687 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:26,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:26,687 INFO L82 PathProgramCache]: Analyzing trace with hash 556343579, now seen corresponding path program 56 times [2021-05-03 00:15:26,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:26,688 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1746124744] [2021-05-03 00:15:26,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:26,692 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1824 500000) (< v_main_~x~0_1824 999999)) InVars {main_~x~0=v_main_~x~0_1824} OutVars{main_~x~0=v_main_~x~0_1824} AuxVars[] AssignedVars[] [2021-05-03 00:15:26,694 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:15:26,700 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:26,705 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:26,711 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:15:26,722 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:26,724 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1826 500000) InVars {main_~x~0=v_main_~x~0_1826} OutVars{main_~x~0=v_main_~x~0_1826} AuxVars[] AssignedVars[] [2021-05-03 00:15:26,725 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:15:26,730 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:26,735 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:26,740 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:15:26,756 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:26,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:28,804 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:28,804 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1746124744] [2021-05-03 00:15:28,804 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1746124744] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:28,804 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:28,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2021-05-03 00:15:28,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381699894] [2021-05-03 00:15:28,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2021-05-03 00:15:28,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:28,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-05-03 00:15:28,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2021-05-03 00:15:28,806 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:34,082 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2021-05-03 00:15:34,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-05-03 00:15:34,083 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2021-05-03 00:15:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:34,084 INFO L225 Difference]: With dead ends: 134 [2021-05-03 00:15:34,084 INFO L226 Difference]: Without dead ends: 127 [2021-05-03 00:15:34,085 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 51 SyntacticMatches, 12 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1731 ImplicationChecksByTransitivity, 4543.5ms TimeCoverageRelationStatistics Valid=465, Invalid=13577, Unknown=0, NotChecked=0, Total=14042 [2021-05-03 00:15:34,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-05-03 00:15:34,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-05-03 00:15:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2021-05-03 00:15:34,093 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 123 [2021-05-03 00:15:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:34,093 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2021-05-03 00:15:34,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2021-05-03 00:15:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-03 00:15:34,094 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:34,094 INFO L523 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:34,094 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-05-03 00:15:34,094 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:34,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:34,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1178953096, now seen corresponding path program 57 times [2021-05-03 00:15:34,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:34,094 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [95938492] [2021-05-03 00:15:34,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:34,099 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1885 500000) (< v_main_~x~0_1885 999999)) InVars {main_~x~0=v_main_~x~0_1885} OutVars{main_~x~0=v_main_~x~0_1885} AuxVars[] AssignedVars[] [2021-05-03 00:15:34,100 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:15:34,100 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:34,105 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:34,116 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:15:34,125 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:34,133 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1887 500000) InVars {main_~x~0=v_main_~x~0_1887} OutVars{main_~x~0=v_main_~x~0_1887} AuxVars[] AssignedVars[] [2021-05-03 00:15:34,135 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:15:34,136 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:34,154 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:34,165 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:15:34,175 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:34,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:36,325 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:36,325 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [95938492] [2021-05-03 00:15:36,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [95938492] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:36,326 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:36,326 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2021-05-03 00:15:36,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730777414] [2021-05-03 00:15:36,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-03 00:15:36,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:36,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-03 00:15:36,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2021-05-03 00:15:36,327 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:41,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:41,916 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-05-03 00:15:41,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-05-03 00:15:41,917 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2021-05-03 00:15:41,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:41,918 INFO L225 Difference]: With dead ends: 136 [2021-05-03 00:15:41,918 INFO L226 Difference]: Without dead ends: 129 [2021-05-03 00:15:41,919 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 55 SyntacticMatches, 10 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 4737.0ms TimeCoverageRelationStatistics Valid=473, Invalid=14047, Unknown=0, NotChecked=0, Total=14520 [2021-05-03 00:15:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-05-03 00:15:41,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-05-03 00:15:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2021-05-03 00:15:41,926 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 125 [2021-05-03 00:15:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:41,926 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2021-05-03 00:15:41,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2021-05-03 00:15:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-05-03 00:15:41,927 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:41,927 INFO L523 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:41,927 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-05-03 00:15:41,927 INFO L428 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:41,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:41,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1943220373, now seen corresponding path program 58 times [2021-05-03 00:15:41,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:41,928 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [72078451] [2021-05-03 00:15:41,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:41,934 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1947 999999) (< v_main_~x~0_1947 500000)) InVars {main_~x~0=v_main_~x~0_1947} OutVars{main_~x~0=v_main_~x~0_1947} AuxVars[] AssignedVars[] [2021-05-03 00:15:41,936 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:15:41,942 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:41,947 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:41,954 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:15:41,965 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:41,967 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1949 500000) InVars {main_~x~0=v_main_~x~0_1949} OutVars{main_~x~0=v_main_~x~0_1949} AuxVars[] AssignedVars[] [2021-05-03 00:15:41,969 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:15:41,975 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:41,980 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:41,987 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:15:41,998 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:42,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:43,961 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:43,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [72078451] [2021-05-03 00:15:43,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [72078451] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:43,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:43,962 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2021-05-03 00:15:43,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111381927] [2021-05-03 00:15:43,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2021-05-03 00:15:43,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:43,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-05-03 00:15:43,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2021-05-03 00:15:43,963 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:49,793 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2021-05-03 00:15:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-05-03 00:15:49,794 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2021-05-03 00:15:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:49,795 INFO L225 Difference]: With dead ends: 138 [2021-05-03 00:15:49,795 INFO L226 Difference]: Without dead ends: 131 [2021-05-03 00:15:49,796 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1840 ImplicationChecksByTransitivity, 4710.7ms TimeCoverageRelationStatistics Valid=481, Invalid=14525, Unknown=0, NotChecked=0, Total=15006 [2021-05-03 00:15:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-03 00:15:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-05-03 00:15:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2021-05-03 00:15:49,805 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 127 [2021-05-03 00:15:49,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:49,805 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2021-05-03 00:15:49,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2021-05-03 00:15:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-05-03 00:15:49,806 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:49,806 INFO L523 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:49,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-05-03 00:15:49,807 INFO L428 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:49,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:49,807 INFO L82 PathProgramCache]: Analyzing trace with hash 169784178, now seen corresponding path program 59 times [2021-05-03 00:15:49,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:49,807 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [353108657] [2021-05-03 00:15:49,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:49,813 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2010 999999) (< v_main_~x~0_2010 500000)) InVars {main_~x~0=v_main_~x~0_2010} OutVars{main_~x~0=v_main_~x~0_2010} AuxVars[] AssignedVars[] [2021-05-03 00:15:49,814 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:15:49,819 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:49,824 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:49,830 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:15:49,840 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:49,841 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2012 500000) InVars {main_~x~0=v_main_~x~0_2012} OutVars{main_~x~0=v_main_~x~0_2012} AuxVars[] AssignedVars[] [2021-05-03 00:15:49,842 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:15:49,848 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:49,853 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:49,859 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:15:49,869 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:49,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:52,023 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:52,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [353108657] [2021-05-03 00:15:52,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [353108657] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:52,024 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:52,024 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2021-05-03 00:15:52,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633001292] [2021-05-03 00:15:52,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2021-05-03 00:15:52,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:52,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-05-03 00:15:52,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:15:52,025 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:58,202 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2021-05-03 00:15:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-05-03 00:15:58,203 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2021-05-03 00:15:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:58,204 INFO L225 Difference]: With dead ends: 140 [2021-05-03 00:15:58,204 INFO L226 Difference]: Without dead ends: 133 [2021-05-03 00:15:58,205 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 56 SyntacticMatches, 11 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1909 ImplicationChecksByTransitivity, 5082.6ms TimeCoverageRelationStatistics Valid=489, Invalid=15011, Unknown=0, NotChecked=0, Total=15500 [2021-05-03 00:15:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-05-03 00:15:58,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-05-03 00:15:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2021-05-03 00:15:58,214 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 129 [2021-05-03 00:15:58,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:58,214 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2021-05-03 00:15:58,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:15:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2021-05-03 00:15:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-05-03 00:15:58,215 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:58,215 INFO L523 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:58,215 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-03 00:15:58,215 INFO L428 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:58,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:58,215 INFO L82 PathProgramCache]: Analyzing trace with hash 999617295, now seen corresponding path program 60 times [2021-05-03 00:15:58,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:58,215 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1754150149] [2021-05-03 00:15:58,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:58,219 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2074 500000) (< v_main_~x~0_2074 999999)) InVars {main_~x~0=v_main_~x~0_2074} OutVars{main_~x~0=v_main_~x~0_2074} AuxVars[] AssignedVars[] [2021-05-03 00:15:58,220 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:15:58,221 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:58,226 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:58,237 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:15:58,248 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:58,249 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2076 500000) InVars {main_~x~0=v_main_~x~0_2076} OutVars{main_~x~0=v_main_~x~0_2076} AuxVars[] AssignedVars[] [2021-05-03 00:15:58,250 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:15:58,256 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:58,260 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:58,267 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:15:58,276 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:58,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:00,518 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:00,518 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1754150149] [2021-05-03 00:16:00,518 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1754150149] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:00,518 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:00,518 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2021-05-03 00:16:00,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271140823] [2021-05-03 00:16:00,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-03 00:16:00,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:00,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-03 00:16:00,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2021-05-03 00:16:00,520 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:06,965 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2021-05-03 00:16:06,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-05-03 00:16:06,966 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2021-05-03 00:16:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:06,967 INFO L225 Difference]: With dead ends: 142 [2021-05-03 00:16:06,967 INFO L226 Difference]: Without dead ends: 135 [2021-05-03 00:16:06,968 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 5245.4ms TimeCoverageRelationStatistics Valid=497, Invalid=15505, Unknown=0, NotChecked=0, Total=16002 [2021-05-03 00:16:06,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-05-03 00:16:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-05-03 00:16:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2021-05-03 00:16:06,976 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 131 [2021-05-03 00:16:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:06,976 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2021-05-03 00:16:06,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2021-05-03 00:16:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-05-03 00:16:06,977 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:06,977 INFO L523 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:06,977 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-05-03 00:16:06,977 INFO L428 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:06,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:06,978 INFO L82 PathProgramCache]: Analyzing trace with hash -394674324, now seen corresponding path program 61 times [2021-05-03 00:16:06,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:06,978 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1501272222] [2021-05-03 00:16:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:06,983 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2139 500000) (< v_main_~x~0_2139 999999)) InVars {main_~x~0=v_main_~x~0_2139} OutVars{main_~x~0=v_main_~x~0_2139} AuxVars[] AssignedVars[] [2021-05-03 00:16:06,984 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:16:06,990 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:06,995 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:07,001 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:16:07,011 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:07,013 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2141 500000) InVars {main_~x~0=v_main_~x~0_2141} OutVars{main_~x~0=v_main_~x~0_2141} AuxVars[] AssignedVars[] [2021-05-03 00:16:07,016 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:16:07,021 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:07,026 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:07,033 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:16:07,042 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:07,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:07,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:09,310 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:09,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1501272222] [2021-05-03 00:16:09,310 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1501272222] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:09,310 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:09,310 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2021-05-03 00:16:09,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212050859] [2021-05-03 00:16:09,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-05-03 00:16:09,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:09,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-05-03 00:16:09,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2021-05-03 00:16:09,311 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:15,691 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2021-05-03 00:16:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-05-03 00:16:15,691 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2021-05-03 00:16:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:15,692 INFO L225 Difference]: With dead ends: 144 [2021-05-03 00:16:15,692 INFO L226 Difference]: Without dead ends: 137 [2021-05-03 00:16:15,693 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 59 SyntacticMatches, 10 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2032 ImplicationChecksByTransitivity, 5214.3ms TimeCoverageRelationStatistics Valid=505, Invalid=16007, Unknown=0, NotChecked=0, Total=16512 [2021-05-03 00:16:15,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-03 00:16:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-05-03 00:16:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2021-05-03 00:16:15,700 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 133 [2021-05-03 00:16:15,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:15,700 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2021-05-03 00:16:15,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2021-05-03 00:16:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-05-03 00:16:15,701 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:15,701 INFO L523 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:15,701 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-05-03 00:16:15,701 INFO L428 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:15,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:15,701 INFO L82 PathProgramCache]: Analyzing trace with hash -279123831, now seen corresponding path program 62 times [2021-05-03 00:16:15,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:15,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2039997872] [2021-05-03 00:16:15,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:15,706 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2205 500000) (< v_main_~x~0_2205 999999)) InVars {main_~x~0=v_main_~x~0_2205} OutVars{main_~x~0=v_main_~x~0_2205} AuxVars[] AssignedVars[] [2021-05-03 00:16:15,708 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:16:15,713 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:15,718 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:15,724 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:16:15,734 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:15,736 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2207 500000) InVars {main_~x~0=v_main_~x~0_2207} OutVars{main_~x~0=v_main_~x~0_2207} AuxVars[] AssignedVars[] [2021-05-03 00:16:15,737 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:16:15,738 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:15,742 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:15,754 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:16:15,763 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:15,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:18,244 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:18,244 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2039997872] [2021-05-03 00:16:18,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2039997872] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:18,244 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:18,244 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2021-05-03 00:16:18,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916296790] [2021-05-03 00:16:18,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2021-05-03 00:16:18,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:18,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-05-03 00:16:18,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2021-05-03 00:16:18,246 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:24,814 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2021-05-03 00:16:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-05-03 00:16:24,815 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2021-05-03 00:16:24,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:24,816 INFO L225 Difference]: With dead ends: 146 [2021-05-03 00:16:24,816 INFO L226 Difference]: Without dead ends: 139 [2021-05-03 00:16:24,817 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 57 SyntacticMatches, 12 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2100 ImplicationChecksByTransitivity, 5497.1ms TimeCoverageRelationStatistics Valid=513, Invalid=16517, Unknown=0, NotChecked=0, Total=17030 [2021-05-03 00:16:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-03 00:16:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-05-03 00:16:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2021-05-03 00:16:24,824 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 135 [2021-05-03 00:16:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:24,824 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2021-05-03 00:16:24,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2021-05-03 00:16:24,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-05-03 00:16:24,825 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:24,825 INFO L523 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:24,825 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-05-03 00:16:24,826 INFO L428 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:24,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:24,826 INFO L82 PathProgramCache]: Analyzing trace with hash -904249754, now seen corresponding path program 63 times [2021-05-03 00:16:24,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:24,826 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [706767096] [2021-05-03 00:16:24,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:24,836 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2272 500000) (< v_main_~x~0_2272 999999)) InVars {main_~x~0=v_main_~x~0_2272} OutVars{main_~x~0=v_main_~x~0_2272} AuxVars[] AssignedVars[] [2021-05-03 00:16:24,838 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:16:24,839 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:24,844 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:24,855 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:16:24,865 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:24,867 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2274 500000) InVars {main_~x~0=v_main_~x~0_2274} OutVars{main_~x~0=v_main_~x~0_2274} AuxVars[] AssignedVars[] [2021-05-03 00:16:24,868 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:16:24,869 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:24,875 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:24,887 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:16:24,897 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:24,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:27,237 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:27,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [706767096] [2021-05-03 00:16:27,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [706767096] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:27,238 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:27,238 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2021-05-03 00:16:27,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911195935] [2021-05-03 00:16:27,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2021-05-03 00:16:27,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:27,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-05-03 00:16:27,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2021-05-03 00:16:27,239 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:34,037 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2021-05-03 00:16:34,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-05-03 00:16:34,038 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2021-05-03 00:16:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:34,039 INFO L225 Difference]: With dead ends: 148 [2021-05-03 00:16:34,039 INFO L226 Difference]: Without dead ends: 141 [2021-05-03 00:16:34,040 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 5474.7ms TimeCoverageRelationStatistics Valid=521, Invalid=17035, Unknown=0, NotChecked=0, Total=17556 [2021-05-03 00:16:34,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-05-03 00:16:34,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-05-03 00:16:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2021-05-03 00:16:34,046 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 137 [2021-05-03 00:16:34,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:34,047 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2021-05-03 00:16:34,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:34,047 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2021-05-03 00:16:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-05-03 00:16:34,047 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:34,048 INFO L523 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:34,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-05-03 00:16:34,048 INFO L428 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:34,048 INFO L82 PathProgramCache]: Analyzing trace with hash -354840317, now seen corresponding path program 64 times [2021-05-03 00:16:34,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:34,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1761687593] [2021-05-03 00:16:34,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:34,055 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2340 500000) (< v_main_~x~0_2340 999999)) InVars {main_~x~0=v_main_~x~0_2340} OutVars{main_~x~0=v_main_~x~0_2340} AuxVars[] AssignedVars[] [2021-05-03 00:16:34,056 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:16:34,062 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,066 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:34,074 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:16:34,083 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:34,085 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2342 500000) InVars {main_~x~0=v_main_~x~0_2342} OutVars{main_~x~0=v_main_~x~0_2342} AuxVars[] AssignedVars[] [2021-05-03 00:16:34,086 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:16:34,091 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,096 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:34,102 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:16:34,112 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:34,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:36,680 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:36,680 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1761687593] [2021-05-03 00:16:36,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1761687593] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:36,681 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:36,681 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2021-05-03 00:16:36,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326362843] [2021-05-03 00:16:36,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2021-05-03 00:16:36,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-05-03 00:16:36,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2021-05-03 00:16:36,682 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:43,985 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2021-05-03 00:16:43,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-05-03 00:16:43,986 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2021-05-03 00:16:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:43,986 INFO L225 Difference]: With dead ends: 150 [2021-05-03 00:16:43,986 INFO L226 Difference]: Without dead ends: 143 [2021-05-03 00:16:43,987 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 59 SyntacticMatches, 12 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2231 ImplicationChecksByTransitivity, 5937.6ms TimeCoverageRelationStatistics Valid=529, Invalid=17561, Unknown=0, NotChecked=0, Total=18090 [2021-05-03 00:16:43,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-03 00:16:43,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-05-03 00:16:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:43,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2021-05-03 00:16:43,994 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 139 [2021-05-03 00:16:43,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:43,994 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2021-05-03 00:16:43,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:43,994 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2021-05-03 00:16:43,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-05-03 00:16:43,995 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:43,995 INFO L523 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:43,995 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-05-03 00:16:43,995 INFO L428 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:43,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:43,995 INFO L82 PathProgramCache]: Analyzing trace with hash -653348768, now seen corresponding path program 65 times [2021-05-03 00:16:43,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:43,996 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [840139837] [2021-05-03 00:16:43,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:44,008 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2409 999999) (< v_main_~x~0_2409 500000)) InVars {main_~x~0=v_main_~x~0_2409} OutVars{main_~x~0=v_main_~x~0_2409} AuxVars[] AssignedVars[] [2021-05-03 00:16:44,016 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:16:44,017 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,023 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:44,035 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:16:44,046 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:44,048 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2411 500000) InVars {main_~x~0=v_main_~x~0_2411} OutVars{main_~x~0=v_main_~x~0_2411} AuxVars[] AssignedVars[] [2021-05-03 00:16:44,049 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:16:44,050 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:44,056 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:44,067 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:16:44,078 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:44,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:46,588 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:46,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [840139837] [2021-05-03 00:16:46,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [840139837] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:46,588 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:46,588 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2021-05-03 00:16:46,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93192090] [2021-05-03 00:16:46,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2021-05-03 00:16:46,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:46,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-05-03 00:16:46,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:16:46,589 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:54,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:54,017 INFO L93 Difference]: Finished difference Result 152 states and 156 transitions. [2021-05-03 00:16:54,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-05-03 00:16:54,018 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2021-05-03 00:16:54,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:54,018 INFO L225 Difference]: With dead ends: 152 [2021-05-03 00:16:54,018 INFO L226 Difference]: Without dead ends: 145 [2021-05-03 00:16:54,019 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 65 SyntacticMatches, 7 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2288 ImplicationChecksByTransitivity, 5952.7ms TimeCoverageRelationStatistics Valid=537, Invalid=18095, Unknown=0, NotChecked=0, Total=18632 [2021-05-03 00:16:54,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-05-03 00:16:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-05-03 00:16:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2021-05-03 00:16:54,028 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 141 [2021-05-03 00:16:54,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:54,028 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2021-05-03 00:16:54,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2021-05-03 00:16:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-03 00:16:54,029 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:54,029 INFO L523 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:54,029 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-03 00:16:54,029 INFO L428 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:54,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:54,030 INFO L82 PathProgramCache]: Analyzing trace with hash 242838653, now seen corresponding path program 66 times [2021-05-03 00:16:54,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:54,030 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696687877] [2021-05-03 00:16:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:54,037 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2479 500000) (< v_main_~x~0_2479 999999)) InVars {main_~x~0=v_main_~x~0_2479} OutVars{main_~x~0=v_main_~x~0_2479} AuxVars[] AssignedVars[] [2021-05-03 00:16:54,039 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:16:54,045 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:54,050 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:54,058 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:16:54,068 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:54,070 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2481 500000) InVars {main_~x~0=v_main_~x~0_2481} OutVars{main_~x~0=v_main_~x~0_2481} AuxVars[] AssignedVars[] [2021-05-03 00:16:54,071 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:16:54,077 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:54,084 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:54,098 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:16:54,108 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:54,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:54,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:56,767 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:56,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [696687877] [2021-05-03 00:16:56,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [696687877] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:56,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:56,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2021-05-03 00:16:56,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44124113] [2021-05-03 00:16:56,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2021-05-03 00:16:56,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:56,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-05-03 00:16:56,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2021-05-03 00:16:56,768 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:04,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:04,641 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2021-05-03 00:17:04,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-05-03 00:17:04,642 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2021-05-03 00:17:04,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:04,643 INFO L225 Difference]: With dead ends: 154 [2021-05-03 00:17:04,643 INFO L226 Difference]: Without dead ends: 147 [2021-05-03 00:17:04,644 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 65 SyntacticMatches, 9 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2360 ImplicationChecksByTransitivity, 6304.9ms TimeCoverageRelationStatistics Valid=545, Invalid=18637, Unknown=0, NotChecked=0, Total=19182 [2021-05-03 00:17:04,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-05-03 00:17:04,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-05-03 00:17:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:04,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2021-05-03 00:17:04,653 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 143 [2021-05-03 00:17:04,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:04,653 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2021-05-03 00:17:04,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2021-05-03 00:17:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-05-03 00:17:04,654 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:04,655 INFO L523 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:04,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-05-03 00:17:04,655 INFO L428 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:04,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:04,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1809476262, now seen corresponding path program 67 times [2021-05-03 00:17:04,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:04,655 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910708258] [2021-05-03 00:17:04,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:04,660 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2550 500000) (< v_main_~x~0_2550 999999)) InVars {main_~x~0=v_main_~x~0_2550} OutVars{main_~x~0=v_main_~x~0_2550} AuxVars[] AssignedVars[] [2021-05-03 00:17:04,663 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:17:04,669 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:04,673 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:04,680 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:17:04,691 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:04,693 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2552 500000) InVars {main_~x~0=v_main_~x~0_2552} OutVars{main_~x~0=v_main_~x~0_2552} AuxVars[] AssignedVars[] [2021-05-03 00:17:04,694 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:17:04,700 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:04,705 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:04,712 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:17:04,723 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:04,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:07,742 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:07,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910708258] [2021-05-03 00:17:07,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [910708258] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:07,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:07,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2021-05-03 00:17:07,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718296374] [2021-05-03 00:17:07,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2021-05-03 00:17:07,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:07,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-05-03 00:17:07,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2021-05-03 00:17:07,743 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:15,901 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2021-05-03 00:17:15,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-05-03 00:17:15,902 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2021-05-03 00:17:15,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:15,902 INFO L225 Difference]: With dead ends: 156 [2021-05-03 00:17:15,903 INFO L226 Difference]: Without dead ends: 149 [2021-05-03 00:17:15,903 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 61 SyntacticMatches, 14 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2439 ImplicationChecksByTransitivity, 6794.9ms TimeCoverageRelationStatistics Valid=553, Invalid=19187, Unknown=0, NotChecked=0, Total=19740 [2021-05-03 00:17:15,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-05-03 00:17:15,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-05-03 00:17:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2021-05-03 00:17:15,914 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 145 [2021-05-03 00:17:15,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:15,914 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2021-05-03 00:17:15,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:15,914 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2021-05-03 00:17:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-05-03 00:17:15,915 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:15,915 INFO L523 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:15,915 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-05-03 00:17:15,915 INFO L428 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:15,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:15,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1600846583, now seen corresponding path program 68 times [2021-05-03 00:17:15,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:15,916 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [292358122] [2021-05-03 00:17:15,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:15,921 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2622 500000) (< v_main_~x~0_2622 999999)) InVars {main_~x~0=v_main_~x~0_2622} OutVars{main_~x~0=v_main_~x~0_2622} AuxVars[] AssignedVars[] [2021-05-03 00:17:15,923 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:17:15,924 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:15,930 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:15,943 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:17:15,954 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:15,955 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2624 500000) InVars {main_~x~0=v_main_~x~0_2624} OutVars{main_~x~0=v_main_~x~0_2624} AuxVars[] AssignedVars[] [2021-05-03 00:17:15,956 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:17:15,957 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:15,962 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:15,974 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:17:15,985 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:16,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:19,048 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:19,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [292358122] [2021-05-03 00:17:19,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [292358122] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:19,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:19,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2021-05-03 00:17:19,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372121771] [2021-05-03 00:17:19,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2021-05-03 00:17:19,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:19,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-05-03 00:17:19,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=5186, Unknown=0, NotChecked=0, Total=5402 [2021-05-03 00:17:19,050 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:27,620 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2021-05-03 00:17:27,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-05-03 00:17:27,622 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2021-05-03 00:17:27,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:27,623 INFO L225 Difference]: With dead ends: 158 [2021-05-03 00:17:27,623 INFO L226 Difference]: Without dead ends: 151 [2021-05-03 00:17:27,624 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 60 SyntacticMatches, 15 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2511 ImplicationChecksByTransitivity, 7018.3ms TimeCoverageRelationStatistics Valid=561, Invalid=19745, Unknown=0, NotChecked=0, Total=20306 [2021-05-03 00:17:27,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-05-03 00:17:27,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-05-03 00:17:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2021-05-03 00:17:27,635 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 147 [2021-05-03 00:17:27,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:27,635 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2021-05-03 00:17:27,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2021-05-03 00:17:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-05-03 00:17:27,636 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:27,636 INFO L523 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:27,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-05-03 00:17:27,636 INFO L428 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:27,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:27,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1861053780, now seen corresponding path program 69 times [2021-05-03 00:17:27,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:27,637 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [144759872] [2021-05-03 00:17:27,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:27,642 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2695 999999) (< v_main_~x~0_2695 500000)) InVars {main_~x~0=v_main_~x~0_2695} OutVars{main_~x~0=v_main_~x~0_2695} AuxVars[] AssignedVars[] [2021-05-03 00:17:27,644 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:17:27,645 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:27,650 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:27,665 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:17:27,678 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:27,688 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2697 500000) InVars {main_~x~0=v_main_~x~0_2697} OutVars{main_~x~0=v_main_~x~0_2697} AuxVars[] AssignedVars[] [2021-05-03 00:17:27,689 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:17:27,690 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:27,695 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:27,707 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:17:27,718 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:27,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:30,852 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:30,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [144759872] [2021-05-03 00:17:30,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [144759872] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:30,853 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:30,853 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2021-05-03 00:17:30,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082082301] [2021-05-03 00:17:30,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2021-05-03 00:17:30,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:30,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-05-03 00:17:30,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2021-05-03 00:17:30,858 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:40,000 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2021-05-03 00:17:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-05-03 00:17:40,001 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2021-05-03 00:17:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:40,002 INFO L225 Difference]: With dead ends: 160 [2021-05-03 00:17:40,002 INFO L226 Difference]: Without dead ends: 153 [2021-05-03 00:17:40,004 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 64 SyntacticMatches, 12 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2576 ImplicationChecksByTransitivity, 7340.6ms TimeCoverageRelationStatistics Valid=569, Invalid=20311, Unknown=0, NotChecked=0, Total=20880 [2021-05-03 00:17:40,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-05-03 00:17:40,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-05-03 00:17:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2021-05-03 00:17:40,013 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 149 [2021-05-03 00:17:40,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:40,013 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2021-05-03 00:17:40,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2021-05-03 00:17:40,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-05-03 00:17:40,014 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:40,014 INFO L523 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:40,015 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-05-03 00:17:40,015 INFO L428 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:40,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:40,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1482900367, now seen corresponding path program 70 times [2021-05-03 00:17:40,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:40,015 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [351156348] [2021-05-03 00:17:40,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:40,021 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2769 500000) (< v_main_~x~0_2769 999999)) InVars {main_~x~0=v_main_~x~0_2769} OutVars{main_~x~0=v_main_~x~0_2769} AuxVars[] AssignedVars[] [2021-05-03 00:17:40,023 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:17:40,030 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,035 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:40,043 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:17:40,053 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:40,056 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2771 500000) InVars {main_~x~0=v_main_~x~0_2771} OutVars{main_~x~0=v_main_~x~0_2771} AuxVars[] AssignedVars[] [2021-05-03 00:17:40,058 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:17:40,059 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:40,066 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:40,085 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:17:40,098 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:40,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:43,179 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:43,179 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [351156348] [2021-05-03 00:17:43,179 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [351156348] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:43,179 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:43,179 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2021-05-03 00:17:43,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503735438] [2021-05-03 00:17:43,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2021-05-03 00:17:43,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:43,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-05-03 00:17:43,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=5478, Unknown=0, NotChecked=0, Total=5700 [2021-05-03 00:17:43,181 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand has 74 states, 74 states have (on average 1.9864864864864864) internal successors, (147), 73 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:52,666 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2021-05-03 00:17:52,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-05-03 00:17:52,667 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.9864864864864864) internal successors, (147), 73 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2021-05-03 00:17:52,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:52,668 INFO L225 Difference]: With dead ends: 162 [2021-05-03 00:17:52,668 INFO L226 Difference]: Without dead ends: 155 [2021-05-03 00:17:52,670 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 71 SyntacticMatches, 7 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2638 ImplicationChecksByTransitivity, 7516.1ms TimeCoverageRelationStatistics Valid=577, Invalid=20885, Unknown=0, NotChecked=0, Total=21462 [2021-05-03 00:17:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-05-03 00:17:52,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-05-03 00:17:52,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2021-05-03 00:17:52,681 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 151 [2021-05-03 00:17:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:52,681 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2021-05-03 00:17:52,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 74 states, 74 states have (on average 1.9864864864864864) internal successors, (147), 73 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:17:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2021-05-03 00:17:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-05-03 00:17:52,683 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:52,683 INFO L523 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:52,683 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-05-03 00:17:52,683 INFO L428 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:52,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:52,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1907669070, now seen corresponding path program 71 times [2021-05-03 00:17:52,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:52,684 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [281465810] [2021-05-03 00:17:52,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:52,691 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2844 999999) (< v_main_~x~0_2844 500000)) InVars {main_~x~0=v_main_~x~0_2844} OutVars{main_~x~0=v_main_~x~0_2844} AuxVars[] AssignedVars[] [2021-05-03 00:17:52,693 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:17:52,694 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:52,700 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:52,715 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:17:52,728 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:52,731 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2846 500000) InVars {main_~x~0=v_main_~x~0_2846} OutVars{main_~x~0=v_main_~x~0_2846} AuxVars[] AssignedVars[] [2021-05-03 00:17:52,732 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:17:52,740 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:52,745 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:52,753 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:17:52,764 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:52,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:56,452 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:56,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [281465810] [2021-05-03 00:17:56,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [281465810] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:56,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:56,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2021-05-03 00:17:56,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183316886] [2021-05-03 00:17:56,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2021-05-03 00:17:56,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-05-03 00:17:56,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=5627, Unknown=0, NotChecked=0, Total=5852 [2021-05-03 00:17:56,454 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand has 75 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 74 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:06,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:06,718 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2021-05-03 00:18:06,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-05-03 00:18:06,719 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 74 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2021-05-03 00:18:06,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:06,720 INFO L225 Difference]: With dead ends: 164 [2021-05-03 00:18:06,720 INFO L226 Difference]: Without dead ends: 157 [2021-05-03 00:18:06,721 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 68 SyntacticMatches, 11 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2719 ImplicationChecksByTransitivity, 8310.7ms TimeCoverageRelationStatistics Valid=585, Invalid=21467, Unknown=0, NotChecked=0, Total=22052 [2021-05-03 00:18:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-05-03 00:18:06,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-05-03 00:18:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2021-05-03 00:18:06,729 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 153 [2021-05-03 00:18:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:06,729 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2021-05-03 00:18:06,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 75 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 74 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2021-05-03 00:18:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-05-03 00:18:06,730 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:06,730 INFO L523 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:06,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-05-03 00:18:06,730 INFO L428 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:06,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash 364720363, now seen corresponding path program 72 times [2021-05-03 00:18:06,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:06,731 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [506296410] [2021-05-03 00:18:06,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:06,742 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2920 500000) (< v_main_~x~0_2920 999999)) InVars {main_~x~0=v_main_~x~0_2920} OutVars{main_~x~0=v_main_~x~0_2920} AuxVars[] AssignedVars[] [2021-05-03 00:18:06,743 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:18:06,744 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,750 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:06,764 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:18:06,776 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:06,778 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2922 500000) InVars {main_~x~0=v_main_~x~0_2922} OutVars{main_~x~0=v_main_~x~0_2922} AuxVars[] AssignedVars[] [2021-05-03 00:18:06,779 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:18:06,788 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:06,795 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:06,805 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:18:06,821 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:06,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:10,443 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:10,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [506296410] [2021-05-03 00:18:10,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [506296410] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:10,444 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:10,444 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2021-05-03 00:18:10,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930356051] [2021-05-03 00:18:10,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2021-05-03 00:18:10,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:10,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-05-03 00:18:10,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=5778, Unknown=0, NotChecked=0, Total=6006 [2021-05-03 00:18:10,445 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand has 76 states, 76 states have (on average 1.986842105263158) internal successors, (151), 75 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:20,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:20,630 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2021-05-03 00:18:20,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-05-03 00:18:20,631 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.986842105263158) internal successors, (151), 75 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2021-05-03 00:18:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:20,632 INFO L225 Difference]: With dead ends: 166 [2021-05-03 00:18:20,632 INFO L226 Difference]: Without dead ends: 159 [2021-05-03 00:18:20,634 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 70 SyntacticMatches, 10 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2791 ImplicationChecksByTransitivity, 8304.5ms TimeCoverageRelationStatistics Valid=593, Invalid=22057, Unknown=0, NotChecked=0, Total=22650 [2021-05-03 00:18:20,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-05-03 00:18:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-05-03 00:18:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2021-05-03 00:18:20,646 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 155 [2021-05-03 00:18:20,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:20,646 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2021-05-03 00:18:20,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 76 states, 76 states have (on average 1.986842105263158) internal successors, (151), 75 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2021-05-03 00:18:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-05-03 00:18:20,647 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:20,647 INFO L523 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:20,647 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-05-03 00:18:20,648 INFO L428 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:20,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash -645269944, now seen corresponding path program 73 times [2021-05-03 00:18:20,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:20,648 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1814861704] [2021-05-03 00:18:20,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:20,655 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2997 999999) (< v_main_~x~0_2997 500000)) InVars {main_~x~0=v_main_~x~0_2997} OutVars{main_~x~0=v_main_~x~0_2997} AuxVars[] AssignedVars[] [2021-05-03 00:18:20,657 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:18:20,667 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,674 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:20,685 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:18:20,700 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:20,703 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2999 500000) InVars {main_~x~0=v_main_~x~0_2999} OutVars{main_~x~0=v_main_~x~0_2999} AuxVars[] AssignedVars[] [2021-05-03 00:18:20,705 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:18:20,714 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,721 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:20,729 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:18:20,742 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:20,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:24,915 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:24,916 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1814861704] [2021-05-03 00:18:24,916 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1814861704] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:24,916 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:24,916 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2021-05-03 00:18:24,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438420820] [2021-05-03 00:18:24,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2021-05-03 00:18:24,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:24,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-05-03 00:18:24,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:18:24,917 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand has 77 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 76 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:36,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:36,157 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2021-05-03 00:18:36,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2021-05-03 00:18:36,158 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 76 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2021-05-03 00:18:36,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:36,158 INFO L225 Difference]: With dead ends: 168 [2021-05-03 00:18:36,158 INFO L226 Difference]: Without dead ends: 161 [2021-05-03 00:18:36,160 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 66 SyntacticMatches, 14 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2874 ImplicationChecksByTransitivity, 9271.2ms TimeCoverageRelationStatistics Valid=601, Invalid=22655, Unknown=0, NotChecked=0, Total=23256 [2021-05-03 00:18:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-05-03 00:18:36,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-05-03 00:18:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 156 states have (on average 1.0128205128205128) internal successors, (158), 156 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2021-05-03 00:18:36,168 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 157 [2021-05-03 00:18:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:36,169 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2021-05-03 00:18:36,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 77 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 76 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2021-05-03 00:18:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-05-03 00:18:36,170 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:36,170 INFO L523 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:36,170 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-05-03 00:18:36,170 INFO L428 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:36,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:36,170 INFO L82 PathProgramCache]: Analyzing trace with hash -583346075, now seen corresponding path program 74 times [2021-05-03 00:18:36,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:36,171 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2050119533] [2021-05-03 00:18:36,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:36,176 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3075 999999) (< v_main_~x~0_3075 500000)) InVars {main_~x~0=v_main_~x~0_3075} OutVars{main_~x~0=v_main_~x~0_3075} AuxVars[] AssignedVars[] [2021-05-03 00:18:36,178 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:18:36,188 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:36,195 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:36,205 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:18:36,219 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:36,221 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3077 500000) InVars {main_~x~0=v_main_~x~0_3077} OutVars{main_~x~0=v_main_~x~0_3077} AuxVars[] AssignedVars[] [2021-05-03 00:18:36,222 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:18:36,223 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:36,231 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:36,247 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:18:36,260 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:36,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:40,471 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:40,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2050119533] [2021-05-03 00:18:40,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2050119533] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:40,471 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:40,472 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2021-05-03 00:18:40,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055301006] [2021-05-03 00:18:40,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-03 00:18:40,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:40,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-03 00:18:40,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=6086, Unknown=0, NotChecked=0, Total=6320 [2021-05-03 00:18:40,473 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand has 78 states, 78 states have (on average 1.9871794871794872) internal successors, (155), 77 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:51,993 INFO L93 Difference]: Finished difference Result 170 states and 174 transitions. [2021-05-03 00:18:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-05-03 00:18:51,994 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.9871794871794872) internal successors, (155), 77 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 159 [2021-05-03 00:18:51,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:51,995 INFO L225 Difference]: With dead ends: 170 [2021-05-03 00:18:51,995 INFO L226 Difference]: Without dead ends: 163 [2021-05-03 00:18:51,996 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 68 SyntacticMatches, 13 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2948 ImplicationChecksByTransitivity, 9447.6ms TimeCoverageRelationStatistics Valid=609, Invalid=23261, Unknown=0, NotChecked=0, Total=23870 [2021-05-03 00:18:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-05-03 00:18:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-05-03 00:18:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 158 states have (on average 1.0126582278481013) internal successors, (160), 158 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2021-05-03 00:18:52,008 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 159 [2021-05-03 00:18:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:52,008 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2021-05-03 00:18:52,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 78 states, 78 states have (on average 1.9871794871794872) internal successors, (155), 77 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:18:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2021-05-03 00:18:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-05-03 00:18:52,010 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:52,010 INFO L523 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:52,010 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-05-03 00:18:52,010 INFO L428 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:52,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1204050110, now seen corresponding path program 75 times [2021-05-03 00:18:52,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:52,011 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1719989633] [2021-05-03 00:18:52,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:52,017 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3154 999999) (< v_main_~x~0_3154 500000)) InVars {main_~x~0=v_main_~x~0_3154} OutVars{main_~x~0=v_main_~x~0_3154} AuxVars[] AssignedVars[] [2021-05-03 00:18:52,019 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:18:52,028 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:52,035 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:52,044 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:18:52,059 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:52,061 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3156 500000) InVars {main_~x~0=v_main_~x~0_3156} OutVars{main_~x~0=v_main_~x~0_3156} AuxVars[] AssignedVars[] [2021-05-03 00:18:52,063 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:18:52,064 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:52,070 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:52,085 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:18:52,098 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:18:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:52,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:18:56,047 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:56,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1719989633] [2021-05-03 00:18:56,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1719989633] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:56,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:56,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [79] imperfect sequences [] total 79 [2021-05-03 00:18:56,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497080866] [2021-05-03 00:18:56,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2021-05-03 00:18:56,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:56,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2021-05-03 00:18:56,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2021-05-03 00:18:56,049 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:19:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:08,146 INFO L93 Difference]: Finished difference Result 172 states and 176 transitions. [2021-05-03 00:19:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-05-03 00:19:08,147 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2021-05-03 00:19:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:08,147 INFO L225 Difference]: With dead ends: 172 [2021-05-03 00:19:08,147 INFO L226 Difference]: Without dead ends: 165 [2021-05-03 00:19:08,149 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 67 SyntacticMatches, 15 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3029 ImplicationChecksByTransitivity, 9527.0ms TimeCoverageRelationStatistics Valid=617, Invalid=23875, Unknown=0, NotChecked=0, Total=24492 [2021-05-03 00:19:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-05-03 00:19:08,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-05-03 00:19:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.0125) internal successors, (162), 160 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:19:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2021-05-03 00:19:08,157 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 161 [2021-05-03 00:19:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:08,157 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2021-05-03 00:19:08,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:19:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2021-05-03 00:19:08,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-05-03 00:19:08,158 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:08,159 INFO L523 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:08,159 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-05-03 00:19:08,159 INFO L428 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:08,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:08,159 INFO L82 PathProgramCache]: Analyzing trace with hash -700173601, now seen corresponding path program 76 times [2021-05-03 00:19:08,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:08,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1361382022] [2021-05-03 00:19:08,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:08,172 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3234 999999) (< v_main_~x~0_3234 500000)) InVars {main_~x~0=v_main_~x~0_3234} OutVars{main_~x~0=v_main_~x~0_3234} AuxVars[] AssignedVars[] [2021-05-03 00:19:08,174 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:19:08,182 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:08,188 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:19:08,197 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:19:08,211 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:08,213 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3236 500000) InVars {main_~x~0=v_main_~x~0_3236} OutVars{main_~x~0=v_main_~x~0_3236} AuxVars[] AssignedVars[] [2021-05-03 00:19:08,215 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:19:08,223 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:08,229 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:19:08,238 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:19:08,253 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:08,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:12,783 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:12,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1361382022] [2021-05-03 00:19:12,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1361382022] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:12,783 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:12,783 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2021-05-03 00:19:12,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364649992] [2021-05-03 00:19:12,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2021-05-03 00:19:12,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:12,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-05-03 00:19:12,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=6402, Unknown=0, NotChecked=0, Total=6642 [2021-05-03 00:19:12,785 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:19:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:25,871 INFO L93 Difference]: Finished difference Result 174 states and 178 transitions. [2021-05-03 00:19:25,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-05-03 00:19:25,872 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 163 [2021-05-03 00:19:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:25,873 INFO L225 Difference]: With dead ends: 174 [2021-05-03 00:19:25,873 INFO L226 Difference]: Without dead ends: 167 [2021-05-03 00:19:25,874 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 72 SyntacticMatches, 11 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3099 ImplicationChecksByTransitivity, 10451.4ms TimeCoverageRelationStatistics Valid=625, Invalid=24497, Unknown=0, NotChecked=0, Total=25122 [2021-05-03 00:19:25,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-05-03 00:19:25,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-05-03 00:19:25,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.0123456790123457) internal successors, (164), 162 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:19:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2021-05-03 00:19:25,882 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 163 [2021-05-03 00:19:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:25,882 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2021-05-03 00:19:25,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:19:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2021-05-03 00:19:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-05-03 00:19:25,883 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:25,883 INFO L523 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:25,883 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-05-03 00:19:25,883 INFO L428 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:25,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:25,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1806152900, now seen corresponding path program 77 times [2021-05-03 00:19:25,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:25,883 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1732313208] [2021-05-03 00:19:25,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:25,898 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3315 999999) (< v_main_~x~0_3315 500000)) InVars {main_~x~0=v_main_~x~0_3315} OutVars{main_~x~0=v_main_~x~0_3315} AuxVars[] AssignedVars[] [2021-05-03 00:19:25,900 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:19:25,901 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:25,908 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:19:25,924 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:19:25,939 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:25,941 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3317 500000) InVars {main_~x~0=v_main_~x~0_3317} OutVars{main_~x~0=v_main_~x~0_3317} AuxVars[] AssignedVars[] [2021-05-03 00:19:25,943 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:19:25,944 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:25,950 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:19:25,965 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:19:25,979 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:26,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:30,357 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:30,358 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1732313208] [2021-05-03 00:19:30,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1732313208] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:30,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:30,358 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2021-05-03 00:19:30,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133361534] [2021-05-03 00:19:30,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2021-05-03 00:19:30,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:30,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2021-05-03 00:19:30,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2021-05-03 00:19:30,360 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:19:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:43,189 INFO L93 Difference]: Finished difference Result 176 states and 180 transitions. [2021-05-03 00:19:43,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-05-03 00:19:43,190 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2021-05-03 00:19:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:43,191 INFO L225 Difference]: With dead ends: 176 [2021-05-03 00:19:43,191 INFO L226 Difference]: Without dead ends: 169 [2021-05-03 00:19:43,192 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 75 SyntacticMatches, 10 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3176 ImplicationChecksByTransitivity, 10198.8ms TimeCoverageRelationStatistics Valid=633, Invalid=25127, Unknown=0, NotChecked=0, Total=25760 [2021-05-03 00:19:43,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-05-03 00:19:43,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-05-03 00:19:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.0121951219512195) internal successors, (166), 164 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:19:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2021-05-03 00:19:43,200 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 165 [2021-05-03 00:19:43,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:43,200 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2021-05-03 00:19:43,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:19:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2021-05-03 00:19:43,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-05-03 00:19:43,201 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:43,201 INFO L523 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:43,201 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-05-03 00:19:43,201 INFO L428 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:43,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:43,202 INFO L82 PathProgramCache]: Analyzing trace with hash 499630169, now seen corresponding path program 78 times [2021-05-03 00:19:43,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:43,202 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [31617549] [2021-05-03 00:19:43,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:43,207 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3397 500000) (< v_main_~x~0_3397 999999)) InVars {main_~x~0=v_main_~x~0_3397} OutVars{main_~x~0=v_main_~x~0_3397} AuxVars[] AssignedVars[] [2021-05-03 00:19:43,208 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:19:43,210 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:43,217 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:19:43,234 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:19:43,248 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:43,250 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3399 500000) InVars {main_~x~0=v_main_~x~0_3399} OutVars{main_~x~0=v_main_~x~0_3399} AuxVars[] AssignedVars[] [2021-05-03 00:19:43,252 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:19:43,253 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:43,259 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:19:43,277 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:19:43,296 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:19:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:43,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:19:48,766 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:48,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [31617549] [2021-05-03 00:19:48,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [31617549] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:48,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:48,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2021-05-03 00:19:48,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127727827] [2021-05-03 00:19:48,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2021-05-03 00:19:48,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:48,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2021-05-03 00:19:48,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=6726, Unknown=0, NotChecked=0, Total=6972 [2021-05-03 00:19:48,769 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:04,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:04,647 INFO L93 Difference]: Finished difference Result 178 states and 182 transitions. [2021-05-03 00:20:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-05-03 00:20:04,648 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 167 [2021-05-03 00:20:04,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:04,649 INFO L225 Difference]: With dead ends: 178 [2021-05-03 00:20:04,649 INFO L226 Difference]: Without dead ends: 171 [2021-05-03 00:20:04,650 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 69 SyntacticMatches, 17 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3270 ImplicationChecksByTransitivity, 12506.9ms TimeCoverageRelationStatistics Valid=641, Invalid=25765, Unknown=0, NotChecked=0, Total=26406 [2021-05-03 00:20:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-05-03 00:20:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-05-03 00:20:04,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.0120481927710843) internal successors, (168), 166 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2021-05-03 00:20:04,659 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 167 [2021-05-03 00:20:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:04,659 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2021-05-03 00:20:04,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2021-05-03 00:20:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-05-03 00:20:04,661 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:04,661 INFO L523 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:04,661 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-05-03 00:20:04,661 INFO L428 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:04,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:04,661 INFO L82 PathProgramCache]: Analyzing trace with hash 154034742, now seen corresponding path program 79 times [2021-05-03 00:20:04,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:04,662 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2017993693] [2021-05-03 00:20:04,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:04,670 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3480 500000) (< v_main_~x~0_3480 999999)) InVars {main_~x~0=v_main_~x~0_3480} OutVars{main_~x~0=v_main_~x~0_3480} AuxVars[] AssignedVars[] [2021-05-03 00:20:04,672 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:20:04,674 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:04,683 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:20:04,707 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:20:04,727 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:04,729 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3482 500000) InVars {main_~x~0=v_main_~x~0_3482} OutVars{main_~x~0=v_main_~x~0_3482} AuxVars[] AssignedVars[] [2021-05-03 00:20:04,731 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:20:04,740 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:04,747 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:20:04,758 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:20:04,775 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:04,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:10,535 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:10,535 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2017993693] [2021-05-03 00:20:10,535 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2017993693] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:10,535 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:10,535 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2021-05-03 00:20:10,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130722799] [2021-05-03 00:20:10,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2021-05-03 00:20:10,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:10,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2021-05-03 00:20:10,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=6891, Unknown=0, NotChecked=0, Total=7140 [2021-05-03 00:20:10,537 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand has 83 states, 83 states have (on average 1.9879518072289157) internal successors, (165), 82 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:26,343 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2021-05-03 00:20:26,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-05-03 00:20:26,344 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.9879518072289157) internal successors, (165), 82 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 169 [2021-05-03 00:20:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:26,345 INFO L225 Difference]: With dead ends: 180 [2021-05-03 00:20:26,345 INFO L226 Difference]: Without dead ends: 173 [2021-05-03 00:20:26,346 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 74 SyntacticMatches, 13 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3343 ImplicationChecksByTransitivity, 12780.7ms TimeCoverageRelationStatistics Valid=649, Invalid=26411, Unknown=0, NotChecked=0, Total=27060 [2021-05-03 00:20:26,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-05-03 00:20:26,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2021-05-03 00:20:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.0119047619047619) internal successors, (170), 168 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2021-05-03 00:20:26,354 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 169 [2021-05-03 00:20:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:26,354 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2021-05-03 00:20:26,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 83 states, 83 states have (on average 1.9879518072289157) internal successors, (165), 82 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2021-05-03 00:20:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-05-03 00:20:26,356 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:26,356 INFO L523 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:26,356 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-03 00:20:26,356 INFO L428 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:26,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:26,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1250688813, now seen corresponding path program 80 times [2021-05-03 00:20:26,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:26,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1476801623] [2021-05-03 00:20:26,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:26,363 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3564 500000) (< v_main_~x~0_3564 999999)) InVars {main_~x~0=v_main_~x~0_3564} OutVars{main_~x~0=v_main_~x~0_3564} AuxVars[] AssignedVars[] [2021-05-03 00:20:26,365 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:20:26,374 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:26,381 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:20:26,390 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:20:26,405 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:26,408 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3566 500000) InVars {main_~x~0=v_main_~x~0_3566} OutVars{main_~x~0=v_main_~x~0_3566} AuxVars[] AssignedVars[] [2021-05-03 00:20:26,409 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:20:26,418 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:26,425 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:20:26,434 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:20:26,452 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:26,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:31,388 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:31,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1476801623] [2021-05-03 00:20:31,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1476801623] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:31,389 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:31,389 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2021-05-03 00:20:31,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789551844] [2021-05-03 00:20:31,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2021-05-03 00:20:31,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:31,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-05-03 00:20:31,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=7058, Unknown=0, NotChecked=0, Total=7310 [2021-05-03 00:20:31,390 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand has 84 states, 84 states have (on average 1.9880952380952381) internal successors, (167), 83 states have internal predecessors, (167), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:47,043 INFO L93 Difference]: Finished difference Result 182 states and 186 transitions. [2021-05-03 00:20:47,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-05-03 00:20:47,044 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 1.9880952380952381) internal successors, (167), 83 states have internal predecessors, (167), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 171 [2021-05-03 00:20:47,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:47,045 INFO L225 Difference]: With dead ends: 182 [2021-05-03 00:20:47,045 INFO L226 Difference]: Without dead ends: 175 [2021-05-03 00:20:47,046 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 79 SyntacticMatches, 9 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3417 ImplicationChecksByTransitivity, 11933.9ms TimeCoverageRelationStatistics Valid=657, Invalid=27065, Unknown=0, NotChecked=0, Total=27722 [2021-05-03 00:20:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-05-03 00:20:47,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-05-03 00:20:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.011764705882353) internal successors, (172), 170 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2021-05-03 00:20:47,058 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 171 [2021-05-03 00:20:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:47,059 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2021-05-03 00:20:47,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 84 states, 84 states have (on average 1.9880952380952381) internal successors, (167), 83 states have internal predecessors, (167), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:20:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2021-05-03 00:20:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-05-03 00:20:47,060 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:47,060 INFO L523 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:47,060 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-05-03 00:20:47,060 INFO L428 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:47,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:47,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1724673072, now seen corresponding path program 81 times [2021-05-03 00:20:47,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:47,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [454261977] [2021-05-03 00:20:47,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:47,067 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3649 999999) (< v_main_~x~0_3649 500000)) InVars {main_~x~0=v_main_~x~0_3649} OutVars{main_~x~0=v_main_~x~0_3649} AuxVars[] AssignedVars[] [2021-05-03 00:20:47,070 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:20:47,071 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:47,080 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:20:47,102 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:20:47,124 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:47,127 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3651 500000) InVars {main_~x~0=v_main_~x~0_3651} OutVars{main_~x~0=v_main_~x~0_3651} AuxVars[] AssignedVars[] [2021-05-03 00:20:47,129 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:20:47,131 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:47,140 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:20:47,165 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:20:47,187 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:20:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:47,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:20:53,825 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:53,825 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [454261977] [2021-05-03 00:20:53,825 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [454261977] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:53,825 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:53,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [85] imperfect sequences [] total 85 [2021-05-03 00:20:53,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591314340] [2021-05-03 00:20:53,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2021-05-03 00:20:53,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:53,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2021-05-03 00:20:53,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2021-05-03 00:20:53,827 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand has 85 states, 85 states have (on average 1.988235294117647) internal successors, (169), 84 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:21:11,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:11,472 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2021-05-03 00:21:11,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-05-03 00:21:11,473 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 1.988235294117647) internal successors, (169), 84 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2021-05-03 00:21:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:11,474 INFO L225 Difference]: With dead ends: 184 [2021-05-03 00:21:11,474 INFO L226 Difference]: Without dead ends: 177 [2021-05-03 00:21:11,475 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 68 SyntacticMatches, 20 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3522 ImplicationChecksByTransitivity, 14323.7ms TimeCoverageRelationStatistics Valid=665, Invalid=27727, Unknown=0, NotChecked=0, Total=28392 [2021-05-03 00:21:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-05-03 00:21:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-05-03 00:21:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.0116279069767442) internal successors, (174), 172 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:21:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2021-05-03 00:21:11,483 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 173 [2021-05-03 00:21:11,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:11,483 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2021-05-03 00:21:11,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 85 states, 85 states have (on average 1.988235294117647) internal successors, (169), 84 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:21:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2021-05-03 00:21:11,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-05-03 00:21:11,484 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:11,485 INFO L523 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:11,485 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-05-03 00:21:11,485 INFO L428 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:11,485 INFO L82 PathProgramCache]: Analyzing trace with hash 599225421, now seen corresponding path program 82 times [2021-05-03 00:21:11,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:11,485 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [163976438] [2021-05-03 00:21:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:11,498 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3735 999999) (< v_main_~x~0_3735 500000)) InVars {main_~x~0=v_main_~x~0_3735} OutVars{main_~x~0=v_main_~x~0_3735} AuxVars[] AssignedVars[] [2021-05-03 00:21:11,500 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:21:11,501 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:11,510 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:21:11,533 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:21:11,553 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:21:11,556 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3737 500000) InVars {main_~x~0=v_main_~x~0_3737} OutVars{main_~x~0=v_main_~x~0_3737} AuxVars[] AssignedVars[] [2021-05-03 00:21:11,557 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:21:11,568 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:11,578 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:21:11,590 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:21:11,613 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:21:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:11,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:17,965 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:17,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [163976438] [2021-05-03 00:21:17,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [163976438] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:17,966 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:17,966 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [86] imperfect sequences [] total 86 [2021-05-03 00:21:17,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609704246] [2021-05-03 00:21:17,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2021-05-03 00:21:17,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:17,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-05-03 00:21:17,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=7398, Unknown=0, NotChecked=0, Total=7656 [2021-05-03 00:21:17,967 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand has 86 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 85 states have internal predecessors, (171), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:21:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:35,150 INFO L93 Difference]: Finished difference Result 186 states and 190 transitions. [2021-05-03 00:21:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-05-03 00:21:35,151 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 85 states have internal predecessors, (171), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 175 [2021-05-03 00:21:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:35,152 INFO L225 Difference]: With dead ends: 186 [2021-05-03 00:21:35,152 INFO L226 Difference]: Without dead ends: 179 [2021-05-03 00:21:35,153 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 76 SyntacticMatches, 14 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3594 ImplicationChecksByTransitivity, 13914.0ms TimeCoverageRelationStatistics Valid=673, Invalid=28397, Unknown=0, NotChecked=0, Total=29070 [2021-05-03 00:21:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-05-03 00:21:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2021-05-03 00:21:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.0114942528735633) internal successors, (176), 174 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:21:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2021-05-03 00:21:35,162 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 175 [2021-05-03 00:21:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:35,162 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2021-05-03 00:21:35,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 86 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 85 states have internal predecessors, (171), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:21:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2021-05-03 00:21:35,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-05-03 00:21:35,163 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:35,163 INFO L523 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:35,163 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-05-03 00:21:35,163 INFO L428 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:35,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:35,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1375791402, now seen corresponding path program 83 times [2021-05-03 00:21:35,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:35,164 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [190026099] [2021-05-03 00:21:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:35,170 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3822 500000) (< v_main_~x~0_3822 999999)) InVars {main_~x~0=v_main_~x~0_3822} OutVars{main_~x~0=v_main_~x~0_3822} AuxVars[] AssignedVars[] [2021-05-03 00:21:35,186 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:21:35,188 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:35,197 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:21:35,218 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:21:35,235 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:21:35,237 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3824 500000) InVars {main_~x~0=v_main_~x~0_3824} OutVars{main_~x~0=v_main_~x~0_3824} AuxVars[] AssignedVars[] [2021-05-03 00:21:35,239 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:21:35,248 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:35,256 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:21:35,268 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:21:35,284 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:21:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:35,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:21:42,318 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:42,318 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [190026099] [2021-05-03 00:21:42,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [190026099] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:42,319 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:42,319 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [87] imperfect sequences [] total 87 [2021-05-03 00:21:42,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118723290] [2021-05-03 00:21:42,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2021-05-03 00:21:42,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:42,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2021-05-03 00:21:42,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=7571, Unknown=0, NotChecked=0, Total=7832 [2021-05-03 00:21:42,320 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand has 87 states, 87 states have (on average 1.9885057471264367) internal successors, (173), 86 states have internal predecessors, (173), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:22:02,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:02,814 INFO L93 Difference]: Finished difference Result 188 states and 192 transitions. [2021-05-03 00:22:02,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-05-03 00:22:02,816 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 1.9885057471264367) internal successors, (173), 86 states have internal predecessors, (173), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 177 [2021-05-03 00:22:02,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:02,817 INFO L225 Difference]: With dead ends: 188 [2021-05-03 00:22:02,817 INFO L226 Difference]: Without dead ends: 181 [2021-05-03 00:22:02,818 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 77 SyntacticMatches, 14 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3679 ImplicationChecksByTransitivity, 15710.0ms TimeCoverageRelationStatistics Valid=681, Invalid=29075, Unknown=0, NotChecked=0, Total=29756 [2021-05-03 00:22:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-05-03 00:22:02,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-05-03 00:22:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.0113636363636365) internal successors, (178), 176 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:22:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2021-05-03 00:22:02,827 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 177 [2021-05-03 00:22:02,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:02,827 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2021-05-03 00:22:02,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 87 states, 87 states have (on average 1.9885057471264367) internal successors, (173), 86 states have internal predecessors, (173), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:22:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2021-05-03 00:22:02,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-05-03 00:22:02,828 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:02,828 INFO L523 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:02,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-05-03 00:22:02,829 INFO L428 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:02,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:02,829 INFO L82 PathProgramCache]: Analyzing trace with hash 331389639, now seen corresponding path program 84 times [2021-05-03 00:22:02,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:02,829 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1477288699] [2021-05-03 00:22:02,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:02,843 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3910 999999) (< v_main_~x~0_3910 500000)) InVars {main_~x~0=v_main_~x~0_3910} OutVars{main_~x~0=v_main_~x~0_3910} AuxVars[] AssignedVars[] [2021-05-03 00:22:02,846 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:22:02,847 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:02,856 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:22:02,880 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:22:02,902 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:02,905 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3912 500000) InVars {main_~x~0=v_main_~x~0_3912} OutVars{main_~x~0=v_main_~x~0_3912} AuxVars[] AssignedVars[] [2021-05-03 00:22:02,907 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:22:02,918 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:02,927 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:22:02,938 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:22:02,958 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:03,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:10,075 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:10,075 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1477288699] [2021-05-03 00:22:10,075 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1477288699] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:10,075 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:10,075 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [88] imperfect sequences [] total 88 [2021-05-03 00:22:10,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862568751] [2021-05-03 00:22:10,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2021-05-03 00:22:10,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:10,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2021-05-03 00:22:10,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=7746, Unknown=0, NotChecked=0, Total=8010 [2021-05-03 00:22:10,077 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand has 88 states, 88 states have (on average 1.9886363636363635) internal successors, (175), 87 states have internal predecessors, (175), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:22:30,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:30,362 INFO L93 Difference]: Finished difference Result 190 states and 194 transitions. [2021-05-03 00:22:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-05-03 00:22:30,364 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.9886363636363635) internal successors, (175), 87 states have internal predecessors, (175), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 179 [2021-05-03 00:22:30,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:30,365 INFO L225 Difference]: With dead ends: 190 [2021-05-03 00:22:30,365 INFO L226 Difference]: Without dead ends: 183 [2021-05-03 00:22:30,367 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 76 SyntacticMatches, 15 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3767 ImplicationChecksByTransitivity, 15680.8ms TimeCoverageRelationStatistics Valid=689, Invalid=29761, Unknown=0, NotChecked=0, Total=30450 [2021-05-03 00:22:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-05-03 00:22:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-05-03 00:22:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 178 states have (on average 1.0112359550561798) internal successors, (180), 178 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:22:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2021-05-03 00:22:30,376 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 179 [2021-05-03 00:22:30,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:30,376 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2021-05-03 00:22:30,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 88 states, 88 states have (on average 1.9886363636363635) internal successors, (175), 87 states have internal predecessors, (175), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:22:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2021-05-03 00:22:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-05-03 00:22:30,377 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:30,377 INFO L523 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:30,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-05-03 00:22:30,377 INFO L428 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:30,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:30,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1683642660, now seen corresponding path program 85 times [2021-05-03 00:22:30,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:30,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1868214828] [2021-05-03 00:22:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:30,384 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3999 999999) (< v_main_~x~0_3999 500000)) InVars {main_~x~0=v_main_~x~0_3999} OutVars{main_~x~0=v_main_~x~0_3999} AuxVars[] AssignedVars[] [2021-05-03 00:22:30,386 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:22:30,396 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:30,403 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:22:30,413 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:22:30,431 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:30,433 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4001 500000) InVars {main_~x~0=v_main_~x~0_4001} OutVars{main_~x~0=v_main_~x~0_4001} AuxVars[] AssignedVars[] [2021-05-03 00:22:30,435 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:22:30,436 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:30,443 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:22:30,460 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:22:30,476 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:30,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:22:36,585 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:36,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1868214828] [2021-05-03 00:22:36,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1868214828] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:36,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:36,585 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [89] imperfect sequences [] total 89 [2021-05-03 00:22:36,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060526240] [2021-05-03 00:22:36,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2021-05-03 00:22:36,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:36,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2021-05-03 00:22:36,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2021-05-03 00:22:36,587 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand has 89 states, 89 states have (on average 1.9887640449438202) internal successors, (177), 88 states have internal predecessors, (177), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:22:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:58,316 INFO L93 Difference]: Finished difference Result 192 states and 196 transitions. [2021-05-03 00:22:58,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-05-03 00:22:58,318 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.9887640449438202) internal successors, (177), 88 states have internal predecessors, (177), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 181 [2021-05-03 00:22:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:58,319 INFO L225 Difference]: With dead ends: 192 [2021-05-03 00:22:58,319 INFO L226 Difference]: Without dead ends: 185 [2021-05-03 00:22:58,321 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 81 SyntacticMatches, 12 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3848 ImplicationChecksByTransitivity, 15284.7ms TimeCoverageRelationStatistics Valid=697, Invalid=30455, Unknown=0, NotChecked=0, Total=31152 [2021-05-03 00:22:58,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-05-03 00:22:58,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-05-03 00:22:58,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 180 states have (on average 1.011111111111111) internal successors, (182), 180 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:22:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2021-05-03 00:22:58,335 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 181 [2021-05-03 00:22:58,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:58,335 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2021-05-03 00:22:58,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 89 states, 89 states have (on average 1.9887640449438202) internal successors, (177), 88 states have internal predecessors, (177), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:22:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2021-05-03 00:22:58,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-05-03 00:22:58,336 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:58,336 INFO L523 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:58,336 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-03 00:22:58,336 INFO L428 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:58,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:58,337 INFO L82 PathProgramCache]: Analyzing trace with hash -176294847, now seen corresponding path program 86 times [2021-05-03 00:22:58,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:58,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [712913986] [2021-05-03 00:22:58,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:58,345 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4089 999999) (< v_main_~x~0_4089 500000)) InVars {main_~x~0=v_main_~x~0_4089} OutVars{main_~x~0=v_main_~x~0_4089} AuxVars[] AssignedVars[] [2021-05-03 00:22:58,347 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:22:58,348 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:58,360 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:22:58,391 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:22:58,421 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:58,425 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4091 500000) InVars {main_~x~0=v_main_~x~0_4091} OutVars{main_~x~0=v_main_~x~0_4091} AuxVars[] AssignedVars[] [2021-05-03 00:22:58,427 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:22:58,429 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:58,439 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:22:58,471 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:22:58,500 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:22:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:58,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:06,796 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:06,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [712913986] [2021-05-03 00:23:06,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [712913986] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:06,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:06,797 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [90] imperfect sequences [] total 90 [2021-05-03 00:23:06,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104127507] [2021-05-03 00:23:06,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2021-05-03 00:23:06,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:06,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2021-05-03 00:23:06,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=8102, Unknown=0, NotChecked=0, Total=8372 [2021-05-03 00:23:06,799 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand has 90 states, 90 states have (on average 1.988888888888889) internal successors, (179), 89 states have internal predecessors, (179), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:23:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:31,499 INFO L93 Difference]: Finished difference Result 194 states and 198 transitions. [2021-05-03 00:23:31,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-05-03 00:23:31,501 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 1.988888888888889) internal successors, (179), 89 states have internal predecessors, (179), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 183 [2021-05-03 00:23:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:31,502 INFO L225 Difference]: With dead ends: 194 [2021-05-03 00:23:31,502 INFO L226 Difference]: Without dead ends: 187 [2021-05-03 00:23:31,503 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 82 SyntacticMatches, 11 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3934 ImplicationChecksByTransitivity, 18464.9ms TimeCoverageRelationStatistics Valid=705, Invalid=31157, Unknown=0, NotChecked=0, Total=31862 [2021-05-03 00:23:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-05-03 00:23:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2021-05-03 00:23:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.010989010989011) internal successors, (184), 182 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:23:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2021-05-03 00:23:31,516 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 183 [2021-05-03 00:23:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:31,516 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2021-05-03 00:23:31,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 90 states, 90 states have (on average 1.988888888888889) internal successors, (179), 89 states have internal predecessors, (179), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:23:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2021-05-03 00:23:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-05-03 00:23:31,517 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:31,517 INFO L523 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:31,518 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-05-03 00:23:31,518 INFO L428 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:31,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:31,518 INFO L82 PathProgramCache]: Analyzing trace with hash -869843938, now seen corresponding path program 87 times [2021-05-03 00:23:31,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:31,518 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1132708555] [2021-05-03 00:23:31,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:31,527 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4180 999999) (< v_main_~x~0_4180 500000)) InVars {main_~x~0=v_main_~x~0_4180} OutVars{main_~x~0=v_main_~x~0_4180} AuxVars[] AssignedVars[] [2021-05-03 00:23:31,529 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:23:31,542 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:31,554 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:23:31,569 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:23:31,618 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:23:31,621 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4182 500000) InVars {main_~x~0=v_main_~x~0_4182} OutVars{main_~x~0=v_main_~x~0_4182} AuxVars[] AssignedVars[] [2021-05-03 00:23:31,623 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:23:31,625 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:31,636 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:23:31,662 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:23:31,687 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:23:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:31,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:23:40,064 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:23:40,064 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1132708555] [2021-05-03 00:23:40,064 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1132708555] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:23:40,064 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:23:40,064 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [91] imperfect sequences [] total 91 [2021-05-03 00:23:40,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810329328] [2021-05-03 00:23:40,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2021-05-03 00:23:40,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:23:40,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2021-05-03 00:23:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=8283, Unknown=0, NotChecked=0, Total=8556 [2021-05-03 00:23:40,066 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand has 91 states, 91 states have (on average 1.989010989010989) internal successors, (181), 90 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:24:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:05,311 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2021-05-03 00:24:05,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-05-03 00:24:05,313 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 1.989010989010989) internal successors, (181), 90 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 185 [2021-05-03 00:24:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:05,314 INFO L225 Difference]: With dead ends: 196 [2021-05-03 00:24:05,314 INFO L226 Difference]: Without dead ends: 189 [2021-05-03 00:24:05,315 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 75 SyntacticMatches, 19 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4039 ImplicationChecksByTransitivity, 19047.2ms TimeCoverageRelationStatistics Valid=713, Invalid=31867, Unknown=0, NotChecked=0, Total=32580 [2021-05-03 00:24:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-05-03 00:24:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-05-03 00:24:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 184 states have (on average 1.0108695652173914) internal successors, (186), 184 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:24:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2021-05-03 00:24:05,326 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 185 [2021-05-03 00:24:05,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:05,326 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2021-05-03 00:24:05,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 91 states, 91 states have (on average 1.989010989010989) internal successors, (181), 90 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:24:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2021-05-03 00:24:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-05-03 00:24:05,327 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:05,327 INFO L523 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:05,328 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-05-03 00:24:05,328 INFO L428 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:05,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:05,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1650589509, now seen corresponding path program 88 times [2021-05-03 00:24:05,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:05,328 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [835205695] [2021-05-03 00:24:05,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:05,338 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4272 500000) (< v_main_~x~0_4272 999999)) InVars {main_~x~0=v_main_~x~0_4272} OutVars{main_~x~0=v_main_~x~0_4272} AuxVars[] AssignedVars[] [2021-05-03 00:24:05,340 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:24:05,356 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:05,370 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:24:05,391 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:24:05,426 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:24:05,431 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4274 500000) InVars {main_~x~0=v_main_~x~0_4274} OutVars{main_~x~0=v_main_~x~0_4274} AuxVars[] AssignedVars[] [2021-05-03 00:24:05,434 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:24:05,454 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:05,466 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:24:05,482 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:24:05,508 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:24:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:05,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:15,561 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:15,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [835205695] [2021-05-03 00:24:15,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [835205695] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:15,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:15,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [92] imperfect sequences [] total 92 [2021-05-03 00:24:15,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032461492] [2021-05-03 00:24:15,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2021-05-03 00:24:15,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:15,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2021-05-03 00:24:15,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=8466, Unknown=0, NotChecked=0, Total=8742 [2021-05-03 00:24:15,562 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand has 92 states, 92 states have (on average 1.9891304347826086) internal successors, (183), 91 states have internal predecessors, (183), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:24:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:24:43,976 INFO L93 Difference]: Finished difference Result 198 states and 202 transitions. [2021-05-03 00:24:43,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-05-03 00:24:43,978 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 1.9891304347826086) internal successors, (183), 91 states have internal predecessors, (183), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 187 [2021-05-03 00:24:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:24:43,979 INFO L225 Difference]: With dead ends: 198 [2021-05-03 00:24:43,979 INFO L226 Difference]: Without dead ends: 191 [2021-05-03 00:24:43,980 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 75 SyntacticMatches, 20 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4131 ImplicationChecksByTransitivity, 21497.6ms TimeCoverageRelationStatistics Valid=721, Invalid=32585, Unknown=0, NotChecked=0, Total=33306 [2021-05-03 00:24:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-05-03 00:24:43,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2021-05-03 00:24:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.010752688172043) internal successors, (188), 186 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:24:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2021-05-03 00:24:43,989 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 187 [2021-05-03 00:24:43,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:24:43,989 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2021-05-03 00:24:43,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 92 states, 92 states have (on average 1.9891304347826086) internal successors, (183), 91 states have internal predecessors, (183), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:24:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2021-05-03 00:24:43,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-05-03 00:24:43,990 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:24:43,990 INFO L523 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:24:43,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-05-03 00:24:43,990 INFO L428 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:24:43,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:24:43,990 INFO L82 PathProgramCache]: Analyzing trace with hash -327806440, now seen corresponding path program 89 times [2021-05-03 00:24:43,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:24:43,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1512155668] [2021-05-03 00:24:43,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:24:43,998 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4365 999999) (< v_main_~x~0_4365 500000)) InVars {main_~x~0=v_main_~x~0_4365} OutVars{main_~x~0=v_main_~x~0_4365} AuxVars[] AssignedVars[] [2021-05-03 00:24:44,000 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:24:44,012 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:44,021 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:24:44,034 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:24:44,053 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:24:44,056 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4367 500000) InVars {main_~x~0=v_main_~x~0_4367} OutVars{main_~x~0=v_main_~x~0_4367} AuxVars[] AssignedVars[] [2021-05-03 00:24:44,058 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:24:44,060 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:24:44,069 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:24:44,094 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:24:44,116 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:24:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:44,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:24:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:24:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:24:54,365 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:54,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1512155668] [2021-05-03 00:24:54,366 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1512155668] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:54,366 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:54,366 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [93] imperfect sequences [] total 93 [2021-05-03 00:24:54,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602967409] [2021-05-03 00:24:54,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2021-05-03 00:24:54,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:54,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2021-05-03 00:24:54,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2021-05-03 00:24:54,368 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand has 93 states, 93 states have (on average 1.989247311827957) internal successors, (185), 92 states have internal predecessors, (185), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)