/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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:12:00,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:12:00,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:12:00,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:12:00,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:12:00,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:12:00,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:12:00,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:12:00,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:12:00,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:12:00,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:12:00,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:12:00,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:12:00,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:12:00,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:12:00,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:12:00,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:12:00,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:12:00,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:12:00,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:12:00,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:12:00,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:12:00,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:12:00,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:12:00,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:12:00,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:12:00,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:12:00,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:12:00,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:12:00,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:12:00,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:12:00,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:12:00,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:12:00,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:12:00,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:12:00,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:12:00,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:12:00,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:12:00,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:12:00,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:12:00,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:12:00,381 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:00,387 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:12:00,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:12:00,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:12:00,389 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:12:00,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:12:00,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:12:00,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:12:00,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:12:00,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:12:00,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:12:00,390 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:12:00,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:12:00,390 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:12:00,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:12:00,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:12:00,390 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:12:00,391 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:12:00,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:12:00,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:12:00,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:12:00,391 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:12:00,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:12:00,392 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:12:00,392 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:00,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:12:00,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:12:00,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:12:00,690 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:12:00,691 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:12:00,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_7.c [2021-05-03 00:12:00,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1c82376d/50e31adcf5d54d639432765c0ba074c8/FLAGcdbeaac22 [2021-05-03 00:12:01,055 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:12:01,055 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_7.c [2021-05-03 00:12:01,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1c82376d/50e31adcf5d54d639432765c0ba074c8/FLAGcdbeaac22 [2021-05-03 00:12:01,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1c82376d/50e31adcf5d54d639432765c0ba074c8 [2021-05-03 00:12:01,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:12:01,506 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:12:01,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:12:01,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:12:01,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:12:01,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:12:01" (1/1) ... [2021-05-03 00:12:01,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25fa66ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:01, skipping insertion in model container [2021-05-03 00:12:01,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:12:01" (1/1) ... [2021-05-03 00:12:01,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:12:01,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:12:01,616 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_7.c[318,331] [2021-05-03 00:12:01,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:12:01,628 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:12:01,635 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_7.c[318,331] [2021-05-03 00:12:01,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:12:01,646 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:12:01,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:01 WrapperNode [2021-05-03 00:12:01,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:12:01,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:12:01,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:12:01,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:12:01,688 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:01" (1/1) ... [2021-05-03 00:12:01,688 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:01" (1/1) ... [2021-05-03 00:12:01,694 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:01" (1/1) ... [2021-05-03 00:12:01,694 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:01" (1/1) ... [2021-05-03 00:12:01,704 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:01" (1/1) ... [2021-05-03 00:12:01,710 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:01" (1/1) ... [2021-05-03 00:12:01,711 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:01" (1/1) ... [2021-05-03 00:12:01,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:12:01,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:12:01,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:12:01,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:12:01,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:01" (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:01,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:12:01,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:12:01,768 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:12:01,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-03 00:12:01,768 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:12:01,768 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-03 00:12:01,768 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:12:01,769 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:12:01,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:12:01,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-03 00:12:01,769 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:12:01,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:12:01,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:12:01,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:12:01,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:12:01,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:12:01,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:12:02,008 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:12:02,009 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-03 00:12:02,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:12:02 BoogieIcfgContainer [2021-05-03 00:12:02,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:12:02,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:12:02,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:12:02,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:12:02,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:12:01" (1/3) ... [2021-05-03 00:12:02,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4f1df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:12:02, skipping insertion in model container [2021-05-03 00:12:02,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:12:01" (2/3) ... [2021-05-03 00:12:02,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4f1df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:12:02, skipping insertion in model container [2021-05-03 00:12:02,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:12:02" (3/3) ... [2021-05-03 00:12:02,015 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_7.c [2021-05-03 00:12:02,019 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:12:02,021 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:12:02,032 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:12:02,046 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:12:02,046 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:12:02,046 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:12:02,046 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:12:02,046 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:12:02,046 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:12:02,046 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:12:02,046 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:12:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 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:02,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-03 00:12:02,077 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:02,077 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:02,077 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:02,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:02,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 1 times [2021-05-03 00:12:02,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:02,090 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1160964847] [2021-05-03 00:12:02,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:02,136 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:12:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:02,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:02,316 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:02,317 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:02,318 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1160964847] [2021-05-03 00:12:02,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1160964847] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:02,320 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:02,321 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-03 00:12:02,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849491780] [2021-05-03 00:12:02,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-03 00:12:02,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:02,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-03 00:12:02,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:12:02,335 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 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.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call 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:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:02,401 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2021-05-03 00:12:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-03 00:12:02,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 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 12 [2021-05-03 00:12:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:02,409 INFO L225 Difference]: With dead ends: 34 [2021-05-03 00:12:02,409 INFO L226 Difference]: Without dead ends: 14 [2021-05-03 00:12:02,412 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:12:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-05-03 00:12:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-05-03 00:12:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-05-03 00:12:02,447 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2021-05-03 00:12:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:02,448 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-05-03 00:12:02,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call 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:02,449 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-05-03 00:12:02,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-03 00:12:02,449 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:02,449 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:02,449 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:12:02,449 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:02,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:02,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 1 times [2021-05-03 00:12:02,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:02,451 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2059847816] [2021-05-03 00:12:02,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:02,460 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:12:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:02,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:02,566 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:02,567 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:02,567 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2059847816] [2021-05-03 00:12:02,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2059847816] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:02,568 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:02,568 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-03 00:12:02,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848352753] [2021-05-03 00:12:02,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-03 00:12:02,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:02,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-03 00:12:02,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-03 00:12:02,571 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call 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:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:02,671 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2021-05-03 00:12:02,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-03 00:12:02,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 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 12 [2021-05-03 00:12:02,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:02,681 INFO L225 Difference]: With dead ends: 24 [2021-05-03 00:12:02,681 INFO L226 Difference]: Without dead ends: 16 [2021-05-03 00:12:02,682 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 71.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:12:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-05-03 00:12:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-05-03 00:12:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2021-05-03 00:12:02,687 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2021-05-03 00:12:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:02,687 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-05-03 00:12:02,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call 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:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2021-05-03 00:12:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-03 00:12:02,688 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:02,688 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:02,688 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:12:02,688 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:02,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:02,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1316432198, now seen corresponding path program 1 times [2021-05-03 00:12:02,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:02,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [353032390] [2021-05-03 00:12:02,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:02,735 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_14 50000) InVars {main_~x~0=v_main_~x~0_14} OutVars{main_~x~0=v_main_~x~0_14} AuxVars[] AssignedVars[] [2021-05-03 00:12:02,753 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:02,762 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:02,775 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:02,792 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:02,805 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:02,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:02,855 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:02,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:02,898 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:02,899 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [353032390] [2021-05-03 00:12:02,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [353032390] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:02,899 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:02,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-03 00:12:02,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91546735] [2021-05-03 00:12:02,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-03 00:12:02,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:02,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-03 00:12:02,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-03 00:12:02,900 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call 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:03,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:03,036 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2021-05-03 00:12:03,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-03 00:12:03,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 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 14 [2021-05-03 00:12:03,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:03,037 INFO L225 Difference]: With dead ends: 26 [2021-05-03 00:12:03,037 INFO L226 Difference]: Without dead ends: 20 [2021-05-03 00:12:03,038 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 118.0ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:12:03,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-05-03 00:12:03,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-05-03 00:12:03,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-05-03 00:12:03,052 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2021-05-03 00:12:03,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:03,053 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-05-03 00:12:03,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call 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:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-05-03 00:12:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-03 00:12:03,054 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:03,054 INFO L523 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:03,055 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-03 00:12:03,055 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:03,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1342594849, now seen corresponding path program 1 times [2021-05-03 00:12:03,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:03,056 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763213298] [2021-05-03 00:12:03,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:03,074 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_18) (< v_main_~x~0_18 999999)) InVars {main_~x~0=v_main_~x~0_18} OutVars{main_~x~0=v_main_~x~0_18} AuxVars[] AssignedVars[] [2021-05-03 00:12:03,088 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:03,116 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:03,125 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:03,150 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:03,153 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:03,170 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:03,194 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_20 999999) (< v_main_~x~0_20 50000)) InVars {main_~x~0=v_main_~x~0_20} OutVars{main_~x~0=v_main_~x~0_20} AuxVars[] AssignedVars[] [2021-05-03 00:12:03,201 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:03,208 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:03,213 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:03,220 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:03,229 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:03,231 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_22 50000) 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:03,233 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:03,234 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:03,239 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:03,259 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:03,273 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_24) (< v_main_~x~0_24 1000000)) 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:03,282 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:03,286 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:03,290 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:03,309 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:03,312 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:03,342 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:03,378 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:03,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:03,432 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:03,434 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:03,437 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:03,495 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:03,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1763213298] [2021-05-03 00:12:03,496 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1763213298] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:03,496 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:03,496 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:12:03,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893799141] [2021-05-03 00:12:03,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:12:03,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:03,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:12:03,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-03 00:12:03,497 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:03,671 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2021-05-03 00:12:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-03 00:12:03,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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:03,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:03,672 INFO L225 Difference]: With dead ends: 37 [2021-05-03 00:12:03,672 INFO L226 Difference]: Without dead ends: 25 [2021-05-03 00:12:03,672 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 183.3ms TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:12:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-03 00:12:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-05-03 00:12:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 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:12:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-05-03 00:12:03,676 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 19 [2021-05-03 00:12:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:03,677 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-05-03 00:12:03,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-05-03 00:12:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-03 00:12:03,677 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:03,677 INFO L523 BasicCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:03,677 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-03 00:12:03,677 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:03,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:03,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1246825262, now seen corresponding path program 2 times [2021-05-03 00:12:03,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:03,678 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1872742094] [2021-05-03 00:12:03,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:03,685 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_31) (< v_main_~x~0_31 999999)) InVars {main_~x~0=v_main_~x~0_31} OutVars{main_~x~0=v_main_~x~0_31} AuxVars[] AssignedVars[] [2021-05-03 00:12:03,694 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:03,724 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:03,728 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:03,740 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:03,743 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:03,767 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:03,792 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_33 50000) (< v_main_~x~0_33 999999)) InVars {main_~x~0=v_main_~x~0_33} OutVars{main_~x~0=v_main_~x~0_33} AuxVars[] AssignedVars[] [2021-05-03 00:12:03,796 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:03,798 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:03,803 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:03,822 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:03,834 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:03,836 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_35 50000) InVars {main_~x~0=v_main_~x~0_35} OutVars{main_~x~0=v_main_~x~0_35} AuxVars[] AssignedVars[] [2021-05-03 00:12:03,842 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:03,844 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:03,849 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:03,864 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:03,883 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_37 1000000) (<= 50000 v_main_~x~0_37)) InVars {main_~x~0=v_main_~x~0_37} OutVars{main_~x~0=v_main_~x~0_37} AuxVars[] AssignedVars[] [2021-05-03 00:12:03,886 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:03,889 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:03,897 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:03,909 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:03,911 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:03,945 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:03,967 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:04,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:04,055 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:04,057 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:04,063 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:04,145 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:04,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1872742094] [2021-05-03 00:12:04,145 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1872742094] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:04,145 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:04,145 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-03 00:12:04,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919047927] [2021-05-03 00:12:04,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-03 00:12:04,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:04,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-03 00:12:04,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:12:04,146 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call 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:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:04,474 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2021-05-03 00:12:04,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:12:04,475 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 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 24 [2021-05-03 00:12:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:04,475 INFO L225 Difference]: With dead ends: 47 [2021-05-03 00:12:04,475 INFO L226 Difference]: Without dead ends: 30 [2021-05-03 00:12:04,476 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 313.9ms TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:12:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-05-03 00:12:04,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-05-03 00:12:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2021-05-03 00:12:04,480 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 24 [2021-05-03 00:12:04,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:04,481 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-05-03 00:12:04,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call 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:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2021-05-03 00:12:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-03 00:12:04,481 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:04,481 INFO L523 BasicCegarLoop]: trace histogram [7, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:04,481 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-03 00:12:04,482 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:04,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:04,482 INFO L82 PathProgramCache]: Analyzing trace with hash -319242389, now seen corresponding path program 3 times [2021-05-03 00:12:04,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:04,482 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [5197941] [2021-05-03 00:12:04,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:04,491 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_46) (< v_main_~x~0_46 999999)) InVars {main_~x~0=v_main_~x~0_46} OutVars{main_~x~0=v_main_~x~0_46} AuxVars[] AssignedVars[] [2021-05-03 00:12:04,494 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:04,514 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:04,520 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:04,538 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:04,541 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:04,558 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:04,582 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_48 50000) (< v_main_~x~0_48 999999)) InVars {main_~x~0=v_main_~x~0_48} OutVars{main_~x~0=v_main_~x~0_48} AuxVars[] AssignedVars[] [2021-05-03 00:12:04,593 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:04,596 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:04,604 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:04,622 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:04,639 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:04,644 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_50 50000) InVars {main_~x~0=v_main_~x~0_50} OutVars{main_~x~0=v_main_~x~0_50} AuxVars[] AssignedVars[] [2021-05-03 00:12:04,647 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:04,648 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:04,653 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:04,671 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:04,686 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_52 1000000) (<= 50000 v_main_~x~0_52)) InVars {main_~x~0=v_main_~x~0_52} OutVars{main_~x~0=v_main_~x~0_52} AuxVars[] AssignedVars[] [2021-05-03 00:12:04,688 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:04,705 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:04,709 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:04,721 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:04,723 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:04,739 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:04,756 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:04,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:04,838 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:04,839 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:04,846 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:04,953 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:04,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [5197941] [2021-05-03 00:12:04,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [5197941] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:04,953 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:04,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:12:04,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444198115] [2021-05-03 00:12:04,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:12:04,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:04,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:12:04,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:12:04,954 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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:12:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:05,351 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2021-05-03 00:12:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:12:05,352 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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:12:05,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:05,353 INFO L225 Difference]: With dead ends: 57 [2021-05-03 00:12:05,353 INFO L226 Difference]: Without dead ends: 35 [2021-05-03 00:12:05,353 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 357.8ms TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:12:05,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-03 00:12:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-05-03 00:12:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 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:12:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2021-05-03 00:12:05,358 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2021-05-03 00:12:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:05,358 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2021-05-03 00:12:05,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 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:12:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2021-05-03 00:12:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-03 00:12:05,359 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:05,359 INFO L523 BasicCegarLoop]: trace histogram [9, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:05,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-03 00:12:05,359 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:05,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:05,360 INFO L82 PathProgramCache]: Analyzing trace with hash 951830946, now seen corresponding path program 4 times [2021-05-03 00:12:05,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:05,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1328009249] [2021-05-03 00:12:05,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:05,366 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_63 999999) (<= 50000 v_main_~x~0_63)) InVars {main_~x~0=v_main_~x~0_63} OutVars{main_~x~0=v_main_~x~0_63} AuxVars[] AssignedVars[] [2021-05-03 00:12:05,369 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:05,370 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:05,373 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:05,382 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:05,384 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:05,425 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:05,445 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_65 999999) (< v_main_~x~0_65 50000)) InVars {main_~x~0=v_main_~x~0_65} OutVars{main_~x~0=v_main_~x~0_65} AuxVars[] AssignedVars[] [2021-05-03 00:12:05,449 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:05,457 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:05,461 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:05,466 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:05,478 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:05,480 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_67 50000) InVars {main_~x~0=v_main_~x~0_67} OutVars{main_~x~0=v_main_~x~0_67} AuxVars[] AssignedVars[] [2021-05-03 00:12:05,481 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:05,489 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:05,493 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:05,499 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:05,513 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_69) (< v_main_~x~0_69 1000000)) InVars {main_~x~0=v_main_~x~0_69} OutVars{main_~x~0=v_main_~x~0_69} AuxVars[] AssignedVars[] [2021-05-03 00:12:05,517 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:05,518 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:05,521 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:05,531 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:05,533 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:05,561 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:05,579 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:05,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:05,662 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:05,664 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:05,667 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:05,798 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:05,798 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1328009249] [2021-05-03 00:12:05,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1328009249] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:05,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:05,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:12:05,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490491874] [2021-05-03 00:12:05,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:12:05,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:05,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:12:05,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:12:05,801 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call 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:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:06,383 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2021-05-03 00:12:06,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:12:06,384 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 2 states have call successors, (3), 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 34 [2021-05-03 00:12:06,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:06,386 INFO L225 Difference]: With dead ends: 67 [2021-05-03 00:12:06,386 INFO L226 Difference]: Without dead ends: 40 [2021-05-03 00:12:06,389 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 542.7ms TimeCoverageRelationStatistics Valid=300, Invalid=756, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:12:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-03 00:12:06,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-05-03 00:12:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 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:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2021-05-03 00:12:06,401 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 34 [2021-05-03 00:12:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:06,402 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2021-05-03 00:12:06,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call 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:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2021-05-03 00:12:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-03 00:12:06,404 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:06,404 INFO L523 BasicCegarLoop]: trace histogram [11, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:06,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-03 00:12:06,404 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:06,405 INFO L82 PathProgramCache]: Analyzing trace with hash 601551863, now seen corresponding path program 5 times [2021-05-03 00:12:06,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:06,405 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1640121622] [2021-05-03 00:12:06,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:06,412 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_82) (< v_main_~x~0_82 999999)) InVars {main_~x~0=v_main_~x~0_82} OutVars{main_~x~0=v_main_~x~0_82} AuxVars[] AssignedVars[] [2021-05-03 00:12:06,415 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:06,416 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:06,417 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:06,427 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:06,429 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:06,459 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:06,477 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_84 999999) (< v_main_~x~0_84 50000)) InVars {main_~x~0=v_main_~x~0_84} OutVars{main_~x~0=v_main_~x~0_84} AuxVars[] AssignedVars[] [2021-05-03 00:12:06,478 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:06,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:06,483 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:06,494 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:06,503 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:06,504 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_86 50000) InVars {main_~x~0=v_main_~x~0_86} OutVars{main_~x~0=v_main_~x~0_86} AuxVars[] AssignedVars[] [2021-05-03 00:12:06,505 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:06,506 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:06,510 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:06,521 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:06,531 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_88 1000000) (<= 50000 v_main_~x~0_88)) InVars {main_~x~0=v_main_~x~0_88} OutVars{main_~x~0=v_main_~x~0_88} AuxVars[] AssignedVars[] [2021-05-03 00:12:06,538 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:06,553 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:06,557 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:06,566 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:06,569 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:06,581 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:06,597 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:06,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:06,655 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:06,656 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:06,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:06,844 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:06,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1640121622] [2021-05-03 00:12:06,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1640121622] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:06,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:06,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:12:06,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161855023] [2021-05-03 00:12:06,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:12:06,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:06,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:12:06,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:12:06,846 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 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:12:07,174 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-05-03 00:12:07,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:07,648 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2021-05-03 00:12:07,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:12:07,649 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 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:12:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:07,652 INFO L225 Difference]: With dead ends: 77 [2021-05-03 00:12:07,652 INFO L226 Difference]: Without dead ends: 45 [2021-05-03 00:12:07,653 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 774.2ms TimeCoverageRelationStatistics Valid=405, Invalid=1077, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:12:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-05-03 00:12:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-05-03 00:12:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.1) internal successors, (44), 40 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:12:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2021-05-03 00:12:07,664 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 39 [2021-05-03 00:12:07,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:07,664 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2021-05-03 00:12:07,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 20 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:12:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2021-05-03 00:12:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-03 00:12:07,665 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:07,665 INFO L523 BasicCegarLoop]: trace histogram [13, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:07,665 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-03 00:12:07,665 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:07,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:07,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2144480746, now seen corresponding path program 6 times [2021-05-03 00:12:07,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:07,666 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1583790566] [2021-05-03 00:12:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:07,673 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_103) (< v_main_~x~0_103 999999)) InVars {main_~x~0=v_main_~x~0_103} OutVars{main_~x~0=v_main_~x~0_103} AuxVars[] AssignedVars[] [2021-05-03 00:12:07,675 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:07,676 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:07,678 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:07,686 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:07,688 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:07,712 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:07,730 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_105 999999) (< v_main_~x~0_105 50000)) InVars {main_~x~0=v_main_~x~0_105} OutVars{main_~x~0=v_main_~x~0_105} AuxVars[] AssignedVars[] [2021-05-03 00:12:07,734 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:07,740 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:07,745 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:07,750 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:07,773 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:07,775 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_107 50000) InVars {main_~x~0=v_main_~x~0_107} OutVars{main_~x~0=v_main_~x~0_107} AuxVars[] AssignedVars[] [2021-05-03 00:12:07,776 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:07,777 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:07,781 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:07,791 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:07,803 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_109) (< v_main_~x~0_109 1000000)) InVars {main_~x~0=v_main_~x~0_109} OutVars{main_~x~0=v_main_~x~0_109} AuxVars[] AssignedVars[] [2021-05-03 00:12:07,804 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:07,805 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:07,808 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:07,816 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:07,818 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:07,843 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:07,867 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:07,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:07,952 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:07,953 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:07,955 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:08,160 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:08,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1583790566] [2021-05-03 00:12:08,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1583790566] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:08,160 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:08,160 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:12:08,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009873623] [2021-05-03 00:12:08,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:12:08,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:08,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:12:08,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:12:08,161 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call 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:08,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:08,969 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2021-05-03 00:12:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:12:08,970 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 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 44 [2021-05-03 00:12:08,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:08,971 INFO L225 Difference]: With dead ends: 87 [2021-05-03 00:12:08,971 INFO L226 Difference]: Without dead ends: 50 [2021-05-03 00:12:08,972 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 735.3ms TimeCoverageRelationStatistics Valid=557, Invalid=1513, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:12:08,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-05-03 00:12:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-05-03 00:12:08,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 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:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2021-05-03 00:12:08,978 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 44 [2021-05-03 00:12:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:08,978 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2021-05-03 00:12:08,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 23 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call 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:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2021-05-03 00:12:08,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:12:08,979 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:08,979 INFO L523 BasicCegarLoop]: trace histogram [15, 14, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:08,979 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-03 00:12:08,979 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:08,979 INFO L82 PathProgramCache]: Analyzing trace with hash 266043011, now seen corresponding path program 7 times [2021-05-03 00:12:08,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:08,980 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1795960610] [2021-05-03 00:12:08,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:09,009 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_126) (< v_main_~x~0_126 999999)) InVars {main_~x~0=v_main_~x~0_126} OutVars{main_~x~0=v_main_~x~0_126} AuxVars[] AssignedVars[] [2021-05-03 00:12:09,011 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:09,013 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:09,014 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:09,024 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:09,026 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:09,050 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:09,067 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_128 50000) (< v_main_~x~0_128 999999)) InVars {main_~x~0=v_main_~x~0_128} OutVars{main_~x~0=v_main_~x~0_128} AuxVars[] AssignedVars[] [2021-05-03 00:12:09,068 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:09,069 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:09,075 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:09,087 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:09,096 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:09,097 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_130 50000) InVars {main_~x~0=v_main_~x~0_130} OutVars{main_~x~0=v_main_~x~0_130} AuxVars[] AssignedVars[] [2021-05-03 00:12:09,098 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:09,104 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:09,113 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:09,135 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:09,146 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_132 1000000) (<= 50000 v_main_~x~0_132)) InVars {main_~x~0=v_main_~x~0_132} OutVars{main_~x~0=v_main_~x~0_132} AuxVars[] AssignedVars[] [2021-05-03 00:12:09,150 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:09,166 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:09,174 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:09,185 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:09,187 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:09,201 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:09,217 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:09,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:09,298 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:09,299 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:09,301 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:09,541 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:09,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1795960610] [2021-05-03 00:12:09,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1795960610] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:09,541 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:09,541 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:12:09,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307925400] [2021-05-03 00:12:09,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:12:09,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:09,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:12:09,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=480, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:12:09,543 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 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:12:10,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:10,516 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2021-05-03 00:12:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:12:10,520 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 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:12:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:10,520 INFO L225 Difference]: With dead ends: 97 [2021-05-03 00:12:10,520 INFO L226 Difference]: Without dead ends: 55 [2021-05-03 00:12:10,521 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 894.4ms TimeCoverageRelationStatistics Valid=660, Invalid=1890, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:12:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-03 00:12:10,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-05-03 00:12:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.08) internal successors, (54), 50 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:12:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2021-05-03 00:12:10,526 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2021-05-03 00:12:10,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:10,526 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2021-05-03 00:12:10,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 26 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:12:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2021-05-03 00:12:10,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-05-03 00:12:10,527 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:10,527 INFO L523 BasicCegarLoop]: trace histogram [17, 16, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:10,527 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-03 00:12:10,527 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:10,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2144068746, now seen corresponding path program 8 times [2021-05-03 00:12:10,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:10,528 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1347653315] [2021-05-03 00:12:10,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:10,534 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_151 999999) (<= 50000 v_main_~x~0_151)) InVars {main_~x~0=v_main_~x~0_151} OutVars{main_~x~0=v_main_~x~0_151} AuxVars[] AssignedVars[] [2021-05-03 00:12:10,536 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:10,549 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:10,551 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:10,558 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:10,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:10,571 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:10,588 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_153 50000) (< v_main_~x~0_153 999999)) InVars {main_~x~0=v_main_~x~0_153} OutVars{main_~x~0=v_main_~x~0_153} AuxVars[] AssignedVars[] [2021-05-03 00:12:10,590 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:10,596 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:10,602 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:10,607 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:10,615 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:10,616 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_155 50000) InVars {main_~x~0=v_main_~x~0_155} OutVars{main_~x~0=v_main_~x~0_155} AuxVars[] AssignedVars[] [2021-05-03 00:12:10,617 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:10,617 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:10,621 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:10,631 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:10,643 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_157 1000000) (<= 50000 v_main_~x~0_157)) InVars {main_~x~0=v_main_~x~0_157} OutVars{main_~x~0=v_main_~x~0_157} AuxVars[] AssignedVars[] [2021-05-03 00:12:10,644 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:10,658 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:10,660 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:10,668 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:10,670 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:10,682 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:10,697 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:10,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:10,829 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:10,831 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:10,873 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:10,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1347653315] [2021-05-03 00:12:10,873 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1347653315] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:10,874 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:10,874 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-03 00:12:10,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000458948] [2021-05-03 00:12:10,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-03 00:12:10,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:10,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-03 00:12:10,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=160, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:12:10,875 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call 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:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:11,181 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2021-05-03 00:12:11,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:12:11,181 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 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 54 [2021-05-03 00:12:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:11,182 INFO L225 Difference]: With dead ends: 105 [2021-05-03 00:12:11,182 INFO L226 Difference]: Without dead ends: 58 [2021-05-03 00:12:11,182 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 366.4ms TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:12:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-03 00:12:11,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-05-03 00:12:11,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 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:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2021-05-03 00:12:11,187 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 54 [2021-05-03 00:12:11,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:11,188 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2021-05-03 00:12:11,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call 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:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2021-05-03 00:12:11,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-03 00:12:11,188 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:11,188 INFO L523 BasicCegarLoop]: trace histogram [18, 16, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:11,188 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-03 00:12:11,189 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:11,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:11,189 INFO L82 PathProgramCache]: Analyzing trace with hash -147134154, now seen corresponding path program 9 times [2021-05-03 00:12:11,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:11,189 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1332626707] [2021-05-03 00:12:11,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:11,194 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_163) (< v_main_~x~0_163 999999)) InVars {main_~x~0=v_main_~x~0_163} OutVars{main_~x~0=v_main_~x~0_163} AuxVars[] AssignedVars[] [2021-05-03 00:12:11,196 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:11,210 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:11,212 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:11,219 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:11,221 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:11,235 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:11,252 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_165 50000) (< 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:12:11,254 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:11,260 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:11,263 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:11,268 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:11,276 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:11,277 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_167 50000) InVars {main_~x~0=v_main_~x~0_167} OutVars{main_~x~0=v_main_~x~0_167} AuxVars[] AssignedVars[] [2021-05-03 00:12:11,278 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:11,292 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:11,295 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:11,301 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:11,311 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_169 1000000) (<= 50000 v_main_~x~0_169)) InVars {main_~x~0=v_main_~x~0_169} OutVars{main_~x~0=v_main_~x~0_169} AuxVars[] AssignedVars[] [2021-05-03 00:12:11,317 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:11,318 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:11,319 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:11,327 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:11,329 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:11,363 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:11,379 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:11,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:11,477 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:11,478 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:11,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:11,776 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:11,776 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1332626707] [2021-05-03 00:12:11,776 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1332626707] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:11,776 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:11,776 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:12:11,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004007775] [2021-05-03 00:12:11,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:12:11,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:11,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:12:11,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=629, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:12:11,777 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call 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:12,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:12,963 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2021-05-03 00:12:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:12:12,964 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 2 states have call successors, (3), 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:12:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:12,964 INFO L225 Difference]: With dead ends: 111 [2021-05-03 00:12:12,964 INFO L226 Difference]: Without dead ends: 63 [2021-05-03 00:12:12,965 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1109.1ms TimeCoverageRelationStatistics Valid=897, Invalid=2525, Unknown=0, NotChecked=0, Total=3422 [2021-05-03 00:12:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-03 00:12:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-05-03 00:12:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 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:12:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2021-05-03 00:12:12,971 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 57 [2021-05-03 00:12:12,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:12,971 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2021-05-03 00:12:12,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 30 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call 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:12,971 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2021-05-03 00:12:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-03 00:12:12,972 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:12,972 INFO L523 BasicCegarLoop]: trace histogram [20, 18, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:12,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-03 00:12:12,972 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:12,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:12,972 INFO L82 PathProgramCache]: Analyzing trace with hash 973125431, now seen corresponding path program 10 times [2021-05-03 00:12:12,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:12,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [37853785] [2021-05-03 00:12:12,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:12,978 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_191) (< v_main_~x~0_191 999999)) InVars {main_~x~0=v_main_~x~0_191} OutVars{main_~x~0=v_main_~x~0_191} AuxVars[] AssignedVars[] [2021-05-03 00:12:12,980 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:12,981 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:12,982 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:12,991 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:12,993 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:13,015 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:13,031 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_193 50000) (< v_main_~x~0_193 999999)) InVars {main_~x~0=v_main_~x~0_193} OutVars{main_~x~0=v_main_~x~0_193} AuxVars[] AssignedVars[] [2021-05-03 00:12:13,032 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:13,032 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:13,036 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:13,046 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:13,055 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:13,057 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_195 50000) InVars {main_~x~0=v_main_~x~0_195} OutVars{main_~x~0=v_main_~x~0_195} AuxVars[] AssignedVars[] [2021-05-03 00:12:13,058 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:13,058 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:13,062 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:13,071 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:13,080 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_197) (< v_main_~x~0_197 1000000)) InVars {main_~x~0=v_main_~x~0_197} OutVars{main_~x~0=v_main_~x~0_197} AuxVars[] AssignedVars[] [2021-05-03 00:12:13,082 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:13,095 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:13,097 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:13,105 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:13,107 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:13,119 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:13,133 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:13,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:13,236 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:13,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:13,239 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:13,567 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:13,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [37853785] [2021-05-03 00:12:13,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [37853785] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:13,568 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:13,568 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:12:13,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067472057] [2021-05-03 00:12:13,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:12:13,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:13,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:12:13,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=763, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:12:13,569 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 33 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:12:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:14,978 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-05-03 00:12:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:12:14,979 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 33 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 62 [2021-05-03 00:12:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:14,979 INFO L225 Difference]: With dead ends: 121 [2021-05-03 00:12:14,979 INFO L226 Difference]: Without dead ends: 68 [2021-05-03 00:12:14,981 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1297.3ms TimeCoverageRelationStatistics Valid=1071, Invalid=3089, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:12:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-03 00:12:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-05-03 00:12:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 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:14,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-05-03 00:12:14,988 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 62 [2021-05-03 00:12:14,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:14,988 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-05-03 00:12:14,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 33 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:12:14,989 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-05-03 00:12:14,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:12:14,989 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:14,989 INFO L523 BasicCegarLoop]: trace histogram [22, 20, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:14,989 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-03 00:12:14,989 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:14,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:14,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1013750530, now seen corresponding path program 11 times [2021-05-03 00:12:14,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:14,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [228987968] [2021-05-03 00:12:14,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:14,995 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_221) (< v_main_~x~0_221 999999)) InVars {main_~x~0=v_main_~x~0_221} OutVars{main_~x~0=v_main_~x~0_221} AuxVars[] AssignedVars[] [2021-05-03 00:12:14,996 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:15,013 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:15,015 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:15,025 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:15,027 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:15,042 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:15,060 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_223 999999) (< v_main_~x~0_223 50000)) InVars {main_~x~0=v_main_~x~0_223} OutVars{main_~x~0=v_main_~x~0_223} AuxVars[] AssignedVars[] [2021-05-03 00:12:15,062 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:15,062 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:15,066 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:15,084 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:15,092 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:15,093 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_225 50000) InVars {main_~x~0=v_main_~x~0_225} OutVars{main_~x~0=v_main_~x~0_225} AuxVars[] AssignedVars[] [2021-05-03 00:12:15,094 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:15,095 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:15,099 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:15,110 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:15,120 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_227 1000000) (<= 50000 v_main_~x~0_227)) InVars {main_~x~0=v_main_~x~0_227} OutVars{main_~x~0=v_main_~x~0_227} AuxVars[] AssignedVars[] [2021-05-03 00:12:15,123 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:15,140 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:15,146 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:15,154 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:15,156 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:15,169 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:15,185 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:15,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:15,305 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:15,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:15,308 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:15,659 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:15,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [228987968] [2021-05-03 00:12:15,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [228987968] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:15,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:15,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:12:15,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369212997] [2021-05-03 00:12:15,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:12:15,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:15,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:12:15,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=910, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:12:15,660 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 37 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 36 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call 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:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:17,167 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2021-05-03 00:12:17,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:12:17,167 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 36 states have internal predecessors, (62), 2 states have call successors, (3), 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:12:17,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:17,168 INFO L225 Difference]: With dead ends: 131 [2021-05-03 00:12:17,168 INFO L226 Difference]: Without dead ends: 73 [2021-05-03 00:12:17,170 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 1416.0ms TimeCoverageRelationStatistics Valid=1260, Invalid=3710, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:12:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-03 00:12:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-05-03 00:12:17,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 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:12:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2021-05-03 00:12:17,175 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 67 [2021-05-03 00:12:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:17,176 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2021-05-03 00:12:17,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 36 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call 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:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2021-05-03 00:12:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-05-03 00:12:17,176 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:17,176 INFO L523 BasicCegarLoop]: trace histogram [24, 22, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:17,176 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-03 00:12:17,176 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash 852847211, now seen corresponding path program 12 times [2021-05-03 00:12:17,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:17,177 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [736774495] [2021-05-03 00:12:17,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:17,183 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_253) (< v_main_~x~0_253 999999)) InVars {main_~x~0=v_main_~x~0_253} OutVars{main_~x~0=v_main_~x~0_253} AuxVars[] AssignedVars[] [2021-05-03 00:12:17,184 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:17,198 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:17,199 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:17,207 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:17,209 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:17,220 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:17,244 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_255 50000) (< v_main_~x~0_255 999999)) InVars {main_~x~0=v_main_~x~0_255} OutVars{main_~x~0=v_main_~x~0_255} AuxVars[] AssignedVars[] [2021-05-03 00:12:17,246 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:17,246 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:17,250 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:17,266 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:17,274 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:17,278 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_257 50000) InVars {main_~x~0=v_main_~x~0_257} OutVars{main_~x~0=v_main_~x~0_257} AuxVars[] AssignedVars[] [2021-05-03 00:12:17,281 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:17,285 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:17,290 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:17,301 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:17,311 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_259) (< v_main_~x~0_259 1000000)) InVars {main_~x~0=v_main_~x~0_259} OutVars{main_~x~0=v_main_~x~0_259} AuxVars[] AssignedVars[] [2021-05-03 00:12:17,313 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:17,328 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:17,331 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:17,346 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:17,348 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:17,360 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:17,376 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:17,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:17,517 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:17,518 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:17,519 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:17,936 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:17,936 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [736774495] [2021-05-03 00:12:17,936 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [736774495] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:17,936 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:17,936 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:12:17,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854066040] [2021-05-03 00:12:17,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:12:17,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:17,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:12:17,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=1070, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:12:17,938 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 40 states, 40 states have (on average 1.675) internal successors, (67), 39 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:12:19,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:19,685 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2021-05-03 00:12:19,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-03 00:12:19,686 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.675) internal successors, (67), 39 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 72 [2021-05-03 00:12:19,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:19,686 INFO L225 Difference]: With dead ends: 141 [2021-05-03 00:12:19,686 INFO L226 Difference]: Without dead ends: 78 [2021-05-03 00:12:19,688 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 1660.7ms TimeCoverageRelationStatistics Valid=1464, Invalid=4388, Unknown=0, NotChecked=0, Total=5852 [2021-05-03 00:12:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-05-03 00:12:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-05-03 00:12:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 73 states have internal predecessors, (77), 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:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-05-03 00:12:19,693 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 72 [2021-05-03 00:12:19,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:19,693 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-05-03 00:12:19,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.675) internal successors, (67), 39 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:12:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-05-03 00:12:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-03 00:12:19,694 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:19,694 INFO L523 BasicCegarLoop]: trace histogram [26, 24, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:19,694 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-03 00:12:19,694 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:19,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:19,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1663914702, now seen corresponding path program 13 times [2021-05-03 00:12:19,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:19,695 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [106302534] [2021-05-03 00:12:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:19,700 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_287) (< v_main_~x~0_287 999999)) InVars {main_~x~0=v_main_~x~0_287} OutVars{main_~x~0=v_main_~x~0_287} AuxVars[] AssignedVars[] [2021-05-03 00:12:19,701 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:19,702 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:19,703 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:19,711 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:19,712 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:19,735 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:19,754 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_289 50000) (< v_main_~x~0_289 999999)) InVars {main_~x~0=v_main_~x~0_289} OutVars{main_~x~0=v_main_~x~0_289} AuxVars[] AssignedVars[] [2021-05-03 00:12:19,756 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:19,756 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:19,760 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:19,771 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:19,779 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:19,780 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_291 50000) InVars {main_~x~0=v_main_~x~0_291} OutVars{main_~x~0=v_main_~x~0_291} AuxVars[] AssignedVars[] [2021-05-03 00:12:19,783 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:19,789 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:19,796 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:19,802 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:19,813 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_293) (< v_main_~x~0_293 1000000)) InVars {main_~x~0=v_main_~x~0_293} OutVars{main_~x~0=v_main_~x~0_293} AuxVars[] AssignedVars[] [2021-05-03 00:12:19,817 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:19,818 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:19,822 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:19,830 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:19,832 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:19,855 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:19,871 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:19,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:19,998 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:19,999 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:20,001 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:20,464 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:20,464 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [106302534] [2021-05-03 00:12:20,464 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [106302534] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:20,464 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:20,464 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-03 00:12:20,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323378441] [2021-05-03 00:12:20,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-03 00:12:20,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:20,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-03 00:12:20,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=1243, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:12:20,466 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 43 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 42 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call 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:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:22,295 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2021-05-03 00:12:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-03 00:12:22,296 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 42 states have internal predecessors, (72), 2 states have call successors, (3), 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:12:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:22,296 INFO L225 Difference]: With dead ends: 151 [2021-05-03 00:12:22,296 INFO L226 Difference]: Without dead ends: 83 [2021-05-03 00:12:22,298 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1832 ImplicationChecksByTransitivity, 1742.2ms TimeCoverageRelationStatistics Valid=1683, Invalid=5123, Unknown=0, NotChecked=0, Total=6806 [2021-05-03 00:12:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-03 00:12:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-05-03 00:12:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0512820512820513) internal successors, (82), 78 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:12:22,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2021-05-03 00:12:22,303 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 77 [2021-05-03 00:12:22,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:22,304 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2021-05-03 00:12:22,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 42 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call 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:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2021-05-03 00:12:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-05-03 00:12:22,305 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:22,305 INFO L523 BasicCegarLoop]: trace histogram [28, 26, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:22,305 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-03 00:12:22,305 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:22,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:22,305 INFO L82 PathProgramCache]: Analyzing trace with hash -732203105, now seen corresponding path program 14 times [2021-05-03 00:12:22,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:22,306 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1346208356] [2021-05-03 00:12:22,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:22,314 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_323) (< v_main_~x~0_323 999999)) InVars {main_~x~0=v_main_~x~0_323} OutVars{main_~x~0=v_main_~x~0_323} AuxVars[] AssignedVars[] [2021-05-03 00:12:22,316 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:22,329 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:22,337 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:22,343 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:22,345 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:22,356 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:22,371 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_325 50000) (< v_main_~x~0_325 999999)) InVars {main_~x~0=v_main_~x~0_325} OutVars{main_~x~0=v_main_~x~0_325} AuxVars[] AssignedVars[] [2021-05-03 00:12:22,377 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:22,383 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:22,388 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:22,395 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:22,403 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:22,405 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_327 50000) InVars {main_~x~0=v_main_~x~0_327} OutVars{main_~x~0=v_main_~x~0_327} AuxVars[] AssignedVars[] [2021-05-03 00:12:22,407 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:22,413 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:22,417 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:22,439 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:22,451 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_329 1000000) (<= 50000 v_main_~x~0_329)) InVars {main_~x~0=v_main_~x~0_329} OutVars{main_~x~0=v_main_~x~0_329} AuxVars[] AssignedVars[] [2021-05-03 00:12:22,456 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:22,457 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:22,459 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:22,467 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:22,469 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:22,493 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:22,509 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:22,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:22,671 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:22,672 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:22,674 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:23,183 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:23,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1346208356] [2021-05-03 00:12:23,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1346208356] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:23,184 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:23,184 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-03 00:12:23,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622667286] [2021-05-03 00:12:23,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-03 00:12:23,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:23,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-03 00:12:23,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=1429, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:12:23,185 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 46 states, 46 states have (on average 1.673913043478261) internal successors, (77), 45 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:12:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:25,272 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2021-05-03 00:12:25,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-03 00:12:25,273 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.673913043478261) internal successors, (77), 45 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 82 [2021-05-03 00:12:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:25,273 INFO L225 Difference]: With dead ends: 161 [2021-05-03 00:12:25,273 INFO L226 Difference]: Without dead ends: 88 [2021-05-03 00:12:25,275 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2120 ImplicationChecksByTransitivity, 1992.3ms TimeCoverageRelationStatistics Valid=1917, Invalid=5915, Unknown=0, NotChecked=0, Total=7832 [2021-05-03 00:12:25,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-05-03 00:12:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-05-03 00:12:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 83 states have internal predecessors, (87), 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:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2021-05-03 00:12:25,281 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 82 [2021-05-03 00:12:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:25,281 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2021-05-03 00:12:25,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 1.673913043478261) internal successors, (77), 45 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:12:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2021-05-03 00:12:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-03 00:12:25,281 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:25,282 INFO L523 BasicCegarLoop]: trace histogram [30, 28, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:25,282 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-03 00:12:25,282 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:25,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash 164384922, now seen corresponding path program 15 times [2021-05-03 00:12:25,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:25,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2090324454] [2021-05-03 00:12:25,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:25,287 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_361 999999) (<= 50000 v_main_~x~0_361)) InVars {main_~x~0=v_main_~x~0_361} OutVars{main_~x~0=v_main_~x~0_361} AuxVars[] AssignedVars[] [2021-05-03 00:12:25,289 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:25,290 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:25,291 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:25,301 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:25,303 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:25,327 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:25,344 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_363 999999) (< v_main_~x~0_363 50000)) InVars {main_~x~0=v_main_~x~0_363} OutVars{main_~x~0=v_main_~x~0_363} AuxVars[] AssignedVars[] [2021-05-03 00:12:25,345 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:25,351 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:25,355 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:25,360 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:25,369 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:25,370 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_365 50000) InVars {main_~x~0=v_main_~x~0_365} OutVars{main_~x~0=v_main_~x~0_365} AuxVars[] AssignedVars[] [2021-05-03 00:12:25,370 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:25,378 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:25,382 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:25,392 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:25,407 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_367) (< v_main_~x~0_367 1000000)) InVars {main_~x~0=v_main_~x~0_367} OutVars{main_~x~0=v_main_~x~0_367} AuxVars[] AssignedVars[] [2021-05-03 00:12:25,411 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:25,412 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:25,413 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:25,421 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:25,423 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:25,447 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:25,463 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:25,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:25,629 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:25,630 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:25,631 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:26,211 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:26,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2090324454] [2021-05-03 00:12:26,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2090324454] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:26,211 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:26,211 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-03 00:12:26,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609127030] [2021-05-03 00:12:26,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-03 00:12:26,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:26,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-03 00:12:26,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=1693, Unknown=0, NotChecked=0, Total=2450 [2021-05-03 00:12:26,212 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 48 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call 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:28,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:28,545 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2021-05-03 00:12:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-03 00:12:28,548 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 48 states have internal predecessors, (82), 2 states have call successors, (3), 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:12:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:28,549 INFO L225 Difference]: With dead ends: 171 [2021-05-03 00:12:28,549 INFO L226 Difference]: Without dead ends: 93 [2021-05-03 00:12:28,550 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 2220.8ms TimeCoverageRelationStatistics Valid=2230, Invalid=6890, Unknown=0, NotChecked=0, Total=9120 [2021-05-03 00:12:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-03 00:12:28,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-05-03 00:12:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0454545454545454) internal successors, (92), 88 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:12:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2021-05-03 00:12:28,556 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 87 [2021-05-03 00:12:28,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:28,556 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2021-05-03 00:12:28,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 48 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call 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:28,557 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2021-05-03 00:12:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-05-03 00:12:28,557 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:28,557 INFO L523 BasicCegarLoop]: trace histogram [32, 30, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:28,557 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-05-03 00:12:28,557 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:28,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:28,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1893490989, now seen corresponding path program 16 times [2021-05-03 00:12:28,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:28,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1078019600] [2021-05-03 00:12:28,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:28,563 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_401) (< v_main_~x~0_401 999999)) InVars {main_~x~0=v_main_~x~0_401} OutVars{main_~x~0=v_main_~x~0_401} AuxVars[] AssignedVars[] [2021-05-03 00:12:28,565 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:28,565 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:28,567 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:28,575 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:28,577 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:28,600 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:28,616 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_403 50000) (< v_main_~x~0_403 999999)) InVars {main_~x~0=v_main_~x~0_403} OutVars{main_~x~0=v_main_~x~0_403} AuxVars[] AssignedVars[] [2021-05-03 00:12:28,617 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:28,618 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:28,622 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:28,632 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:28,640 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:28,642 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_405 50000) InVars {main_~x~0=v_main_~x~0_405} OutVars{main_~x~0=v_main_~x~0_405} AuxVars[] AssignedVars[] [2021-05-03 00:12:28,644 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:28,650 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:28,653 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:28,658 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:28,670 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_407 1000000) (<= 50000 v_main_~x~0_407)) InVars {main_~x~0=v_main_~x~0_407} OutVars{main_~x~0=v_main_~x~0_407} AuxVars[] AssignedVars[] [2021-05-03 00:12:28,672 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:28,688 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:28,689 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:28,697 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:28,700 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:28,713 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:28,731 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:28,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:28,910 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:28,911 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:28,912 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:29,600 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:29,601 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1078019600] [2021-05-03 00:12:29,601 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1078019600] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:29,601 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:29,601 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-03 00:12:29,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086824050] [2021-05-03 00:12:29,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-03 00:12:29,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:29,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-03 00:12:29,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=1840, Unknown=0, NotChecked=0, Total=2652 [2021-05-03 00:12:29,602 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 52 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 51 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:12:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:32,179 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2021-05-03 00:12:32,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-03 00:12:32,179 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 51 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 92 [2021-05-03 00:12:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:32,180 INFO L225 Difference]: With dead ends: 181 [2021-05-03 00:12:32,180 INFO L226 Difference]: Without dead ends: 98 [2021-05-03 00:12:32,181 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 2452.7ms TimeCoverageRelationStatistics Valid=2430, Invalid=7670, Unknown=0, NotChecked=0, Total=10100 [2021-05-03 00:12:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-03 00:12:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-05-03 00:12:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.043010752688172) internal successors, (97), 93 states have internal predecessors, (97), 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:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2021-05-03 00:12:32,187 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 92 [2021-05-03 00:12:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:32,187 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2021-05-03 00:12:32,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 51 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:12:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2021-05-03 00:12:32,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-05-03 00:12:32,188 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:32,188 INFO L523 BasicCegarLoop]: trace histogram [34, 32, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:32,188 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-03 00:12:32,188 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:32,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:32,188 INFO L82 PathProgramCache]: Analyzing trace with hash -405220250, now seen corresponding path program 17 times [2021-05-03 00:12:32,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:32,188 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1905386681] [2021-05-03 00:12:32,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:32,198 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_443 999999) (<= 50000 v_main_~x~0_443)) InVars {main_~x~0=v_main_~x~0_443} OutVars{main_~x~0=v_main_~x~0_443} AuxVars[] AssignedVars[] [2021-05-03 00:12:32,200 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:32,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:32,217 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:32,225 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:32,227 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:32,239 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:32,256 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_445 50000) (< v_main_~x~0_445 999999)) InVars {main_~x~0=v_main_~x~0_445} OutVars{main_~x~0=v_main_~x~0_445} AuxVars[] AssignedVars[] [2021-05-03 00:12:32,257 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:32,259 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:32,263 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:32,279 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:32,288 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:32,301 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_447 50000) InVars {main_~x~0=v_main_~x~0_447} OutVars{main_~x~0=v_main_~x~0_447} AuxVars[] AssignedVars[] [2021-05-03 00:12:32,302 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:32,308 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:32,312 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:32,318 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:32,329 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_449) (< v_main_~x~0_449 1000000)) InVars {main_~x~0=v_main_~x~0_449} OutVars{main_~x~0=v_main_~x~0_449} AuxVars[] AssignedVars[] [2021-05-03 00:12:32,330 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:32,344 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:32,346 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:32,353 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:32,355 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:32,372 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:32,401 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:32,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:32,605 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:32,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:32,607 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:33,313 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:33,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1905386681] [2021-05-03 00:12:33,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1905386681] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:33,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:33,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-03 00:12:33,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580784901] [2021-05-03 00:12:33,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-03 00:12:33,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:33,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-03 00:12:33,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=2065, Unknown=0, NotChecked=0, Total=2970 [2021-05-03 00:12:33,314 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand has 55 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 54 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call 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:36,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:36,211 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2021-05-03 00:12:36,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-03 00:12:36,212 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 54 states have internal predecessors, (92), 2 states have call successors, (3), 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:12:36,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:36,212 INFO L225 Difference]: With dead ends: 191 [2021-05-03 00:12:36,212 INFO L226 Difference]: Without dead ends: 103 [2021-05-03 00:12:36,213 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3127 ImplicationChecksByTransitivity, 2739.5ms TimeCoverageRelationStatistics Valid=2709, Invalid=8633, Unknown=0, NotChecked=0, Total=11342 [2021-05-03 00:12:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-05-03 00:12:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-05-03 00:12:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 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:12:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2021-05-03 00:12:36,219 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 97 [2021-05-03 00:12:36,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:36,220 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2021-05-03 00:12:36,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 55 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 54 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call 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:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2021-05-03 00:12:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-05-03 00:12:36,220 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:36,220 INFO L523 BasicCegarLoop]: trace histogram [36, 34, 18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:36,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-05-03 00:12:36,221 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:36,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:36,221 INFO L82 PathProgramCache]: Analyzing trace with hash 209625095, now seen corresponding path program 18 times [2021-05-03 00:12:36,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:36,221 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [701738230] [2021-05-03 00:12:36,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:36,233 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_487) (< v_main_~x~0_487 999999)) InVars {main_~x~0=v_main_~x~0_487} OutVars{main_~x~0=v_main_~x~0_487} AuxVars[] AssignedVars[] [2021-05-03 00:12:36,235 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:36,235 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:36,236 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:36,245 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:36,247 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:36,269 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:36,286 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_489 999999) (< v_main_~x~0_489 50000)) InVars {main_~x~0=v_main_~x~0_489} OutVars{main_~x~0=v_main_~x~0_489} AuxVars[] AssignedVars[] [2021-05-03 00:12:36,287 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:36,287 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:36,291 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:36,301 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:36,310 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:36,311 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_491 50000) InVars {main_~x~0=v_main_~x~0_491} OutVars{main_~x~0=v_main_~x~0_491} AuxVars[] AssignedVars[] [2021-05-03 00:12:36,312 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:36,312 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:36,316 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:36,326 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:36,336 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_493) (< v_main_~x~0_493 1000000)) InVars {main_~x~0=v_main_~x~0_493} OutVars{main_~x~0=v_main_~x~0_493} AuxVars[] AssignedVars[] [2021-05-03 00:12:36,337 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:36,351 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:36,352 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:36,359 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:36,361 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:36,372 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:36,387 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:36,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:36,594 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:36,595 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:36,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:37,400 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:37,400 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [701738230] [2021-05-03 00:12:37,400 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [701738230] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:37,400 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:37,400 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-03 00:12:37,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540734676] [2021-05-03 00:12:37,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-03 00:12:37,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:37,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-03 00:12:37,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1003, Invalid=2303, Unknown=0, NotChecked=0, Total=3306 [2021-05-03 00:12:37,416 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand has 58 states, 58 states have (on average 1.6724137931034482) internal successors, (97), 57 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:12:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:40,720 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2021-05-03 00:12:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-03 00:12:40,720 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.6724137931034482) internal successors, (97), 57 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 102 [2021-05-03 00:12:40,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:40,721 INFO L225 Difference]: With dead ends: 201 [2021-05-03 00:12:40,721 INFO L226 Difference]: Without dead ends: 108 [2021-05-03 00:12:40,722 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3500 ImplicationChecksByTransitivity, 3026.5ms TimeCoverageRelationStatistics Valid=3003, Invalid=9653, Unknown=0, NotChecked=0, Total=12656 [2021-05-03 00:12:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-05-03 00:12:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-05-03 00:12:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.0388349514563107) internal successors, (107), 103 states have internal predecessors, (107), 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:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2021-05-03 00:12:40,729 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 102 [2021-05-03 00:12:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:40,729 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2021-05-03 00:12:40,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 58 states, 58 states have (on average 1.6724137931034482) internal successors, (97), 57 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:12:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2021-05-03 00:12:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-03 00:12:40,729 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:40,729 INFO L523 BasicCegarLoop]: trace histogram [38, 36, 19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:40,729 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-05-03 00:12:40,729 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:40,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:40,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1440604622, now seen corresponding path program 19 times [2021-05-03 00:12:40,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:40,730 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1504489218] [2021-05-03 00:12:40,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:40,736 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_533 999999) (<= 50000 v_main_~x~0_533)) InVars {main_~x~0=v_main_~x~0_533} OutVars{main_~x~0=v_main_~x~0_533} AuxVars[] AssignedVars[] [2021-05-03 00:12:40,737 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:40,752 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:40,754 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:40,763 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:40,764 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:40,776 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:40,797 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_535 999999) (< v_main_~x~0_535 50000)) InVars {main_~x~0=v_main_~x~0_535} OutVars{main_~x~0=v_main_~x~0_535} AuxVars[] AssignedVars[] [2021-05-03 00:12:40,798 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:40,804 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:40,808 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:40,813 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:40,821 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:40,822 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_537 50000) InVars {main_~x~0=v_main_~x~0_537} OutVars{main_~x~0=v_main_~x~0_537} AuxVars[] AssignedVars[] [2021-05-03 00:12:40,823 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:40,824 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:40,827 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:40,838 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:40,857 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_539 1000000) (<= 50000 v_main_~x~0_539)) InVars {main_~x~0=v_main_~x~0_539} OutVars{main_~x~0=v_main_~x~0_539} AuxVars[] AssignedVars[] [2021-05-03 00:12:40,859 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:40,860 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:40,861 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:40,870 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:40,872 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:40,899 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:40,918 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:41,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:41,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:12:41,191 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:41,245 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:41,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1504489218] [2021-05-03 00:12:41,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1504489218] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:41,246 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:41,246 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:12:41,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425955431] [2021-05-03 00:12:41,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:12:41,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:41,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:12:41,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:12:41,247 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 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:12:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:41,955 INFO L93 Difference]: Finished difference Result 209 states and 217 transitions. [2021-05-03 00:12:41,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:12:41,956 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 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 107 [2021-05-03 00:12:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:41,957 INFO L225 Difference]: With dead ends: 209 [2021-05-03 00:12:41,957 INFO L226 Difference]: Without dead ends: 111 [2021-05-03 00:12:41,957 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 886.9ms TimeCoverageRelationStatistics Valid=955, Invalid=1697, Unknown=0, NotChecked=0, Total=2652 [2021-05-03 00:12:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-05-03 00:12:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-05-03 00:12:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 106 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:12:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2021-05-03 00:12:41,964 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 107 [2021-05-03 00:12:41,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:41,964 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2021-05-03 00:12:41,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 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:12:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2021-05-03 00:12:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-05-03 00:12:41,964 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:41,965 INFO L523 BasicCegarLoop]: trace histogram [39, 36, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:41,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-05-03 00:12:41,965 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:41,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:41,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1594168716, now seen corresponding path program 20 times [2021-05-03 00:12:41,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:41,965 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1529131387] [2021-05-03 00:12:41,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:41,971 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_546 999999) (<= 50000 v_main_~x~0_546)) InVars {main_~x~0=v_main_~x~0_546} OutVars{main_~x~0=v_main_~x~0_546} AuxVars[] AssignedVars[] [2021-05-03 00:12:41,972 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:41,987 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:41,988 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:41,995 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:41,997 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:42,009 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:42,030 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_548 50000) (< v_main_~x~0_548 999999)) InVars {main_~x~0=v_main_~x~0_548} OutVars{main_~x~0=v_main_~x~0_548} AuxVars[] AssignedVars[] [2021-05-03 00:12:42,031 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:42,038 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:42,042 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:42,048 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:42,059 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:42,060 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_550 50000) InVars {main_~x~0=v_main_~x~0_550} OutVars{main_~x~0=v_main_~x~0_550} AuxVars[] AssignedVars[] [2021-05-03 00:12:42,062 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:42,068 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:42,072 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:42,077 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:42,087 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_552 1000000) (<= 50000 v_main_~x~0_552)) InVars {main_~x~0=v_main_~x~0_552} OutVars{main_~x~0=v_main_~x~0_552} AuxVars[] AssignedVars[] [2021-05-03 00:12:42,089 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:42,105 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:42,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:42,114 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:42,116 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:42,134 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:42,150 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:42,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:42,376 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:42,377 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:42,378 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:43,255 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:43,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1529131387] [2021-05-03 00:12:43,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1529131387] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:43,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:43,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2021-05-03 00:12:43,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776811680] [2021-05-03 00:12:43,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2021-05-03 00:12:43,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:43,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-05-03 00:12:43,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1166, Invalid=2616, Unknown=0, NotChecked=0, Total=3782 [2021-05-03 00:12:43,256 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand has 62 states, 62 states have (on average 1.6612903225806452) internal successors, (103), 61 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:12:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:46,759 INFO L93 Difference]: Finished difference Result 215 states and 226 transitions. [2021-05-03 00:12:46,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-05-03 00:12:46,760 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.6612903225806452) internal successors, (103), 61 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 110 [2021-05-03 00:12:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:46,760 INFO L225 Difference]: With dead ends: 215 [2021-05-03 00:12:46,760 INFO L226 Difference]: Without dead ends: 116 [2021-05-03 00:12:46,762 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4068 ImplicationChecksByTransitivity, 3280.4ms TimeCoverageRelationStatistics Valid=3492, Invalid=11028, Unknown=0, NotChecked=0, Total=14520 [2021-05-03 00:12:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-05-03 00:12:46,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-05-03 00:12:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.0360360360360361) internal successors, (115), 111 states have internal predecessors, (115), 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:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2021-05-03 00:12:46,768 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 110 [2021-05-03 00:12:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:46,769 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2021-05-03 00:12:46,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 62 states, 62 states have (on average 1.6612903225806452) internal successors, (103), 61 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:12:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2021-05-03 00:12:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-05-03 00:12:46,769 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:46,769 INFO L523 BasicCegarLoop]: trace histogram [41, 38, 21, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:46,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-05-03 00:12:46,770 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:46,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:46,770 INFO L82 PathProgramCache]: Analyzing trace with hash 129194597, now seen corresponding path program 21 times [2021-05-03 00:12:46,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:46,770 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [939347621] [2021-05-03 00:12:46,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:46,775 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_595 999999) (<= 50000 v_main_~x~0_595)) InVars {main_~x~0=v_main_~x~0_595} OutVars{main_~x~0=v_main_~x~0_595} AuxVars[] AssignedVars[] [2021-05-03 00:12:46,777 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:46,777 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:46,779 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:46,786 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:46,788 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:46,811 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:46,829 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_597 50000) (< v_main_~x~0_597 999999)) InVars {main_~x~0=v_main_~x~0_597} OutVars{main_~x~0=v_main_~x~0_597} AuxVars[] AssignedVars[] [2021-05-03 00:12:46,830 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:46,836 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:46,839 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:46,845 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:46,854 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:46,854 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_599 50000) InVars {main_~x~0=v_main_~x~0_599} OutVars{main_~x~0=v_main_~x~0_599} AuxVars[] AssignedVars[] [2021-05-03 00:12:46,855 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:46,856 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:46,859 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:46,881 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:46,894 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_601) (< v_main_~x~0_601 1000000)) InVars {main_~x~0=v_main_~x~0_601} OutVars{main_~x~0=v_main_~x~0_601} AuxVars[] AssignedVars[] [2021-05-03 00:12:46,895 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:46,896 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:46,897 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:46,905 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:46,908 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:46,932 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:46,958 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:47,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:47,215 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:47,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:47,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:48,144 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:48,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [939347621] [2021-05-03 00:12:48,145 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [939347621] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:48,145 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:48,145 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2021-05-03 00:12:48,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803624179] [2021-05-03 00:12:48,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-05-03 00:12:48,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:48,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-05-03 00:12:48,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=2883, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:12:48,146 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand has 65 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 64 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call 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:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:52,066 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions. [2021-05-03 00:12:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-05-03 00:12:52,067 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 64 states have internal predecessors, (108), 2 states have call successors, (3), 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:12:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:52,068 INFO L225 Difference]: With dead ends: 225 [2021-05-03 00:12:52,068 INFO L226 Difference]: Without dead ends: 121 [2021-05-03 00:12:52,069 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4492 ImplicationChecksByTransitivity, 3636.6ms TimeCoverageRelationStatistics Valid=3825, Invalid=12177, Unknown=0, NotChecked=0, Total=16002 [2021-05-03 00:12:52,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-05-03 00:12:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-05-03 00:12:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 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:12:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 124 transitions. [2021-05-03 00:12:52,076 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 124 transitions. Word has length 115 [2021-05-03 00:12:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:52,076 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 124 transitions. [2021-05-03 00:12:52,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 65 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 64 states have internal predecessors, (108), 2 states have call successors, (3), 3 states have call 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:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2021-05-03 00:12:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-05-03 00:12:52,076 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:52,077 INFO L523 BasicCegarLoop]: trace histogram [43, 40, 22, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:52,077 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-05-03 00:12:52,077 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:52,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2068507752, now seen corresponding path program 22 times [2021-05-03 00:12:52,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:52,077 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [197329158] [2021-05-03 00:12:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:52,085 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_646) (< v_main_~x~0_646 999999)) InVars {main_~x~0=v_main_~x~0_646} OutVars{main_~x~0=v_main_~x~0_646} AuxVars[] AssignedVars[] [2021-05-03 00:12:52,087 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:52,101 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:52,103 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:52,111 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:52,113 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:52,126 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:52,143 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_648 50000) (< v_main_~x~0_648 999999)) InVars {main_~x~0=v_main_~x~0_648} OutVars{main_~x~0=v_main_~x~0_648} AuxVars[] AssignedVars[] [2021-05-03 00:12:52,144 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:52,145 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:52,148 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:52,159 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:52,169 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:52,170 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_650 50000) InVars {main_~x~0=v_main_~x~0_650} OutVars{main_~x~0=v_main_~x~0_650} AuxVars[] AssignedVars[] [2021-05-03 00:12:52,171 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:52,177 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:52,182 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:52,187 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:52,198 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_652 1000000) (<= 50000 v_main_~x~0_652)) InVars {main_~x~0=v_main_~x~0_652} OutVars{main_~x~0=v_main_~x~0_652} AuxVars[] AssignedVars[] [2021-05-03 00:12:52,199 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:52,214 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:52,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:52,223 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:52,225 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:52,246 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:52,262 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:52,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:52,565 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:52,566 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:52,567 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:53,585 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:53,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [197329158] [2021-05-03 00:12:53,586 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [197329158] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:53,586 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:53,586 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2021-05-03 00:12:53,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838573132] [2021-05-03 00:12:53,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2021-05-03 00:12:53,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:53,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-05-03 00:12:53,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1393, Invalid=3163, Unknown=0, NotChecked=0, Total=4556 [2021-05-03 00:12:53,587 INFO L87 Difference]: Start difference. First operand 121 states and 124 transitions. Second operand has 68 states, 68 states have (on average 1.661764705882353) internal successors, (113), 67 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:12:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:57,825 INFO L93 Difference]: Finished difference Result 235 states and 246 transitions. [2021-05-03 00:12:57,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-05-03 00:12:57,833 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.661764705882353) internal successors, (113), 67 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 120 [2021-05-03 00:12:57,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:57,834 INFO L225 Difference]: With dead ends: 235 [2021-05-03 00:12:57,834 INFO L226 Difference]: Without dead ends: 126 [2021-05-03 00:12:57,835 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4915 ImplicationChecksByTransitivity, 3951.9ms TimeCoverageRelationStatistics Valid=4173, Invalid=13383, Unknown=0, NotChecked=0, Total=17556 [2021-05-03 00:12:57,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-05-03 00:12:57,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-05-03 00:12:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.0330578512396693) internal successors, (125), 121 states have internal predecessors, (125), 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,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 129 transitions. [2021-05-03 00:12:57,843 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 129 transitions. Word has length 120 [2021-05-03 00:12:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:57,843 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 129 transitions. [2021-05-03 00:12:57,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 68 states, 68 states have (on average 1.661764705882353) internal successors, (113), 67 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:12:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2021-05-03 00:12:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-03 00:12:57,844 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:57,844 INFO L523 BasicCegarLoop]: trace histogram [45, 42, 23, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:57,844 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-05-03 00:12:57,844 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:57,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:57,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1192174735, now seen corresponding path program 23 times [2021-05-03 00:12:57,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:57,845 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1336211023] [2021-05-03 00:12:57,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:57,853 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_699 999999) (<= 50000 v_main_~x~0_699)) InVars {main_~x~0=v_main_~x~0_699} OutVars{main_~x~0=v_main_~x~0_699} AuxVars[] AssignedVars[] [2021-05-03 00:12:57,854 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:57,869 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:57,871 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:57,879 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:57,882 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:57,894 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:57,912 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_701 50000) (< v_main_~x~0_701 999999)) InVars {main_~x~0=v_main_~x~0_701} OutVars{main_~x~0=v_main_~x~0_701} AuxVars[] AssignedVars[] [2021-05-03 00:12:57,913 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:57,919 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:57,923 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:57,928 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:57,937 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:57,939 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_703 50000) InVars {main_~x~0=v_main_~x~0_703} OutVars{main_~x~0=v_main_~x~0_703} AuxVars[] AssignedVars[] [2021-05-03 00:12:57,939 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:57,946 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:57,949 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:57,955 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:57,966 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_705 1000000) (<= 50000 v_main_~x~0_705)) InVars {main_~x~0=v_main_~x~0_705} OutVars{main_~x~0=v_main_~x~0_705} AuxVars[] AssignedVars[] [2021-05-03 00:12:57,969 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:57,970 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:57,971 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:57,980 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:57,982 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:58,007 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:58,024 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:58,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:58,299 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,299 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:58,301 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:59,428 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:59,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1336211023] [2021-05-03 00:12:59,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1336211023] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:59,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:59,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2021-05-03 00:12:59,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854475074] [2021-05-03 00:12:59,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2021-05-03 00:12:59,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:59,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-05-03 00:12:59,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1514, Invalid=3456, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:12:59,430 INFO L87 Difference]: Start difference. First operand 126 states and 129 transitions. Second operand has 71 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 70 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call 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,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:04,024 INFO L93 Difference]: Finished difference Result 245 states and 256 transitions. [2021-05-03 00:13:04,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-05-03 00:13:04,029 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 70 states have internal predecessors, (118), 2 states have call successors, (3), 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:13:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:04,030 INFO L225 Difference]: With dead ends: 245 [2021-05-03 00:13:04,030 INFO L226 Difference]: Without dead ends: 131 [2021-05-03 00:13:04,031 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5380 ImplicationChecksByTransitivity, 4263.7ms TimeCoverageRelationStatistics Valid=4536, Invalid=14646, Unknown=0, NotChecked=0, Total=19182 [2021-05-03 00:13:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-03 00:13:04,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-05-03 00:13:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 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:13:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 134 transitions. [2021-05-03 00:13:04,039 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 134 transitions. Word has length 125 [2021-05-03 00:13:04,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:04,039 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 134 transitions. [2021-05-03 00:13:04,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 71 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 70 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call 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,039 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2021-05-03 00:13:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-05-03 00:13:04,040 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:04,040 INFO L523 BasicCegarLoop]: trace histogram [47, 44, 24, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:04,040 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-05-03 00:13:04,040 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:04,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2075715492, now seen corresponding path program 24 times [2021-05-03 00:13:04,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:04,041 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1978440345] [2021-05-03 00:13:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:04,046 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_754) (< v_main_~x~0_754 999999)) InVars {main_~x~0=v_main_~x~0_754} OutVars{main_~x~0=v_main_~x~0_754} AuxVars[] AssignedVars[] [2021-05-03 00:13:04,048 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:04,048 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:04,049 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:04,057 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:04,059 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:04,082 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:04,098 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_756 50000) (< v_main_~x~0_756 999999)) InVars {main_~x~0=v_main_~x~0_756} OutVars{main_~x~0=v_main_~x~0_756} AuxVars[] AssignedVars[] [2021-05-03 00:13:04,099 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:04,100 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:04,103 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:04,114 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:04,123 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:04,124 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_758 50000) InVars {main_~x~0=v_main_~x~0_758} OutVars{main_~x~0=v_main_~x~0_758} AuxVars[] AssignedVars[] [2021-05-03 00:13:04,125 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:04,140 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:04,145 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:04,151 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:04,164 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_760 1000000) (<= 50000 v_main_~x~0_760)) InVars {main_~x~0=v_main_~x~0_760} OutVars{main_~x~0=v_main_~x~0_760} AuxVars[] AssignedVars[] [2021-05-03 00:13:04,165 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:04,181 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:04,185 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:04,192 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:04,194 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:04,207 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:04,224 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:04,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:04,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:13:04,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:04,662 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:04,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1978440345] [2021-05-03 00:13:04,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1978440345] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:04,663 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:04,663 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:13:04,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383557679] [2021-05-03 00:13:04,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:13:04,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:04,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:13:04,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=660, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:13:04,664 INFO L87 Difference]: Start difference. First operand 131 states and 134 transitions. Second operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call 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,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:05,643 INFO L93 Difference]: Finished difference Result 253 states and 261 transitions. [2021-05-03 00:13:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:13:05,644 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 2 states have call successors, (3), 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 130 [2021-05-03 00:13:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:05,644 INFO L225 Difference]: With dead ends: 253 [2021-05-03 00:13:05,644 INFO L226 Difference]: Without dead ends: 134 [2021-05-03 00:13:05,645 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1200.9ms TimeCoverageRelationStatistics Valid=1455, Invalid=2577, Unknown=0, NotChecked=0, Total=4032 [2021-05-03 00:13:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-05-03 00:13:05,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2021-05-03 00:13:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 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,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2021-05-03 00:13:05,653 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 130 [2021-05-03 00:13:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:05,653 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2021-05-03 00:13:05,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call 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,653 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2021-05-03 00:13:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-05-03 00:13:05,654 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:05,654 INFO L523 BasicCegarLoop]: trace histogram [48, 44, 25, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:05,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-05-03 00:13:05,654 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:05,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:05,654 INFO L82 PathProgramCache]: Analyzing trace with hash -770374620, now seen corresponding path program 25 times [2021-05-03 00:13:05,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:05,654 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [395379194] [2021-05-03 00:13:05,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:05,660 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_768) (< v_main_~x~0_768 999999)) InVars {main_~x~0=v_main_~x~0_768} OutVars{main_~x~0=v_main_~x~0_768} AuxVars[] AssignedVars[] [2021-05-03 00:13:05,664 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:05,678 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:05,680 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:05,689 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:05,690 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:05,702 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:05,719 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_770 50000) (< v_main_~x~0_770 999999)) InVars {main_~x~0=v_main_~x~0_770} OutVars{main_~x~0=v_main_~x~0_770} AuxVars[] AssignedVars[] [2021-05-03 00:13:05,720 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:05,720 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:05,724 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:05,734 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:05,743 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:05,744 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_772 50000) InVars {main_~x~0=v_main_~x~0_772} OutVars{main_~x~0=v_main_~x~0_772} AuxVars[] AssignedVars[] [2021-05-03 00:13:05,745 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:05,745 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:05,749 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:05,760 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:05,771 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_774 1000000) (<= 50000 v_main_~x~0_774)) 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:05,772 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:05,786 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:05,787 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:05,797 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:05,799 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:05,812 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:05,828 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:06,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:06,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:13:06,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:06,167 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:07,420 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:07,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [395379194] [2021-05-03 00:13:07,420 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [395379194] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:07,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:07,420 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2021-05-03 00:13:07,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794932738] [2021-05-03 00:13:07,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2021-05-03 00:13:07,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:07,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-05-03 00:13:07,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=3837, Unknown=0, NotChecked=0, Total=5550 [2021-05-03 00:13:07,422 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand has 75 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 74 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call 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,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:12,518 INFO L93 Difference]: Finished difference Result 259 states and 270 transitions. [2021-05-03 00:13:12,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-05-03 00:13:12,518 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 74 states have internal predecessors, (124), 2 states have call successors, (3), 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:13:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:12,519 INFO L225 Difference]: With dead ends: 259 [2021-05-03 00:13:12,519 INFO L226 Difference]: Without dead ends: 139 [2021-05-03 00:13:12,520 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6076 ImplicationChecksByTransitivity, 4698.2ms TimeCoverageRelationStatistics Valid=5133, Invalid=16329, Unknown=0, NotChecked=0, Total=21462 [2021-05-03 00:13:12,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-03 00:13:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-05-03 00:13:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0298507462686568) internal successors, (138), 134 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:13:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2021-05-03 00:13:12,528 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 133 [2021-05-03 00:13:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:12,528 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2021-05-03 00:13:12,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 75 states, 75 states have (on average 1.6533333333333333) internal successors, (124), 74 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call 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,528 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2021-05-03 00:13:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-05-03 00:13:12,529 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:12,529 INFO L523 BasicCegarLoop]: trace histogram [50, 46, 26, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:12,529 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-05-03 00:13:12,529 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:12,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:12,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2034429193, now seen corresponding path program 26 times [2021-05-03 00:13:12,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:12,530 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2095858761] [2021-05-03 00:13:12,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:12,538 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_826 999999) (<= 50000 v_main_~x~0_826)) InVars {main_~x~0=v_main_~x~0_826} OutVars{main_~x~0=v_main_~x~0_826} AuxVars[] AssignedVars[] [2021-05-03 00:13:12,540 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:12,540 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:12,542 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:12,549 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:12,555 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:12,579 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:12,597 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_828 50000) (< v_main_~x~0_828 999999)) InVars {main_~x~0=v_main_~x~0_828} OutVars{main_~x~0=v_main_~x~0_828} AuxVars[] AssignedVars[] [2021-05-03 00:13:12,606 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:12,607 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:12,611 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:12,623 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:12,632 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:12,634 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_830 50000) InVars {main_~x~0=v_main_~x~0_830} OutVars{main_~x~0=v_main_~x~0_830} AuxVars[] AssignedVars[] [2021-05-03 00:13:12,636 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:12,642 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:12,646 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:12,651 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:12,663 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_832) (< v_main_~x~0_832 1000000)) InVars {main_~x~0=v_main_~x~0_832} OutVars{main_~x~0=v_main_~x~0_832} AuxVars[] AssignedVars[] [2021-05-03 00:13:12,664 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:12,679 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:12,681 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:12,689 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:12,691 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:12,703 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:12,719 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:13,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:13,084 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,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:13,086 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:14,420 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:14,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2095858761] [2021-05-03 00:13:14,420 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2095858761] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:14,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:14,420 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2021-05-03 00:13:14,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752211205] [2021-05-03 00:13:14,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-03 00:13:14,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:14,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-03 00:13:14,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1898, Invalid=4264, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:13:14,421 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand has 78 states, 78 states have (on average 1.6538461538461537) internal successors, (129), 77 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:13:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:20,036 INFO L93 Difference]: Finished difference Result 269 states and 280 transitions. [2021-05-03 00:13:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-05-03 00:13:20,036 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.6538461538461537) internal successors, (129), 77 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 138 [2021-05-03 00:13:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:20,037 INFO L225 Difference]: With dead ends: 269 [2021-05-03 00:13:20,037 INFO L226 Difference]: Without dead ends: 144 [2021-05-03 00:13:20,038 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6689 ImplicationChecksByTransitivity, 5151.2ms TimeCoverageRelationStatistics Valid=5635, Invalid=17927, Unknown=0, NotChecked=0, Total=23562 [2021-05-03 00:13:20,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-05-03 00:13:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-05-03 00:13:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 139 states have internal predecessors, (143), 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,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 147 transitions. [2021-05-03 00:13:20,046 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 147 transitions. Word has length 138 [2021-05-03 00:13:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:20,046 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 147 transitions. [2021-05-03 00:13:20,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 78 states, 78 states have (on average 1.6538461538461537) internal successors, (129), 77 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:13:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 147 transitions. [2021-05-03 00:13:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-03 00:13:20,047 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:20,047 INFO L523 BasicCegarLoop]: trace histogram [52, 48, 27, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:20,047 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-03 00:13:20,047 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:20,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:20,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1463290992, now seen corresponding path program 27 times [2021-05-03 00:13:20,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:20,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1990061558] [2021-05-03 00:13:20,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:20,054 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_886) (< v_main_~x~0_886 999999)) InVars {main_~x~0=v_main_~x~0_886} OutVars{main_~x~0=v_main_~x~0_886} AuxVars[] AssignedVars[] [2021-05-03 00:13:20,055 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:20,056 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:20,057 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:20,066 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:20,068 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:20,090 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:20,107 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_888 50000) (< v_main_~x~0_888 999999)) InVars {main_~x~0=v_main_~x~0_888} OutVars{main_~x~0=v_main_~x~0_888} AuxVars[] AssignedVars[] [2021-05-03 00:13:20,109 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:20,115 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:20,119 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:20,125 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:20,134 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:20,135 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_890 50000) InVars {main_~x~0=v_main_~x~0_890} OutVars{main_~x~0=v_main_~x~0_890} AuxVars[] AssignedVars[] [2021-05-03 00:13:20,136 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:20,142 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:20,146 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:20,151 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:20,161 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_892) (< v_main_~x~0_892 1000000)) InVars {main_~x~0=v_main_~x~0_892} OutVars{main_~x~0=v_main_~x~0_892} AuxVars[] AssignedVars[] [2021-05-03 00:13:20,163 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:20,163 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:20,165 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:20,172 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:20,174 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:20,196 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:20,212 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:20,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:20,620 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:20,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:20,622 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:22,094 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:22,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1990061558] [2021-05-03 00:13:22,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1990061558] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:22,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:22,095 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2021-05-03 00:13:22,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737434566] [2021-05-03 00:13:22,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2021-05-03 00:13:22,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:22,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2021-05-03 00:13:22,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2039, Invalid=4603, Unknown=0, NotChecked=0, Total=6642 [2021-05-03 00:13:22,096 INFO L87 Difference]: Start difference. First operand 144 states and 147 transitions. Second operand has 81 states, 81 states have (on average 1.654320987654321) internal successors, (134), 80 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call 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,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:28,420 INFO L93 Difference]: Finished difference Result 279 states and 290 transitions. [2021-05-03 00:13:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-05-03 00:13:28,420 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.654320987654321) internal successors, (134), 80 states have internal predecessors, (134), 2 states have call successors, (3), 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:13:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:28,421 INFO L225 Difference]: With dead ends: 279 [2021-05-03 00:13:28,421 INFO L226 Difference]: Without dead ends: 149 [2021-05-03 00:13:28,422 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7230 ImplicationChecksByTransitivity, 5637.7ms TimeCoverageRelationStatistics Valid=6056, Invalid=19384, Unknown=0, NotChecked=0, Total=25440 [2021-05-03 00:13:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-05-03 00:13:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-05-03 00:13:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 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:13:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 152 transitions. [2021-05-03 00:13:28,431 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 152 transitions. Word has length 143 [2021-05-03 00:13:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:28,431 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 152 transitions. [2021-05-03 00:13:28,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 81 states, 81 states have (on average 1.654320987654321) internal successors, (134), 80 states have internal predecessors, (134), 2 states have call successors, (3), 3 states have call 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,431 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 152 transitions. [2021-05-03 00:13:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-05-03 00:13:28,432 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:28,432 INFO L523 BasicCegarLoop]: trace histogram [54, 50, 28, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:28,432 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-05-03 00:13:28,432 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:28,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:28,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1745004099, now seen corresponding path program 28 times [2021-05-03 00:13:28,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:28,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1451771275] [2021-05-03 00:13:28,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:28,445 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_948) (< v_main_~x~0_948 999999)) InVars {main_~x~0=v_main_~x~0_948} OutVars{main_~x~0=v_main_~x~0_948} AuxVars[] AssignedVars[] [2021-05-03 00:13:28,446 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:28,447 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:28,448 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:28,457 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:28,459 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:28,484 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:28,502 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_950 50000) (< v_main_~x~0_950 999999)) InVars {main_~x~0=v_main_~x~0_950} OutVars{main_~x~0=v_main_~x~0_950} AuxVars[] AssignedVars[] [2021-05-03 00:13:28,509 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:28,509 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:28,514 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:28,525 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:28,535 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:28,536 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_952 50000) InVars {main_~x~0=v_main_~x~0_952} OutVars{main_~x~0=v_main_~x~0_952} AuxVars[] AssignedVars[] [2021-05-03 00:13:28,537 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:28,538 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:28,542 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:28,553 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:28,564 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_954 1000000) (<= 50000 v_main_~x~0_954)) InVars {main_~x~0=v_main_~x~0_954} OutVars{main_~x~0=v_main_~x~0_954} AuxVars[] AssignedVars[] [2021-05-03 00:13:28,565 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:28,566 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:28,568 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:28,577 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:28,579 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:28,602 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:28,619 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:29,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:29,108 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,110 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:29,177 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:29,177 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1451771275] [2021-05-03 00:13:29,177 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1451771275] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:29,177 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:29,177 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:13:29,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773766627] [2021-05-03 00:13:29,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:13:29,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:29,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:13:29,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=859, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:13:29,178 INFO L87 Difference]: Start difference. First operand 149 states and 152 transitions. Second operand has 37 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call 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:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:30,371 INFO L93 Difference]: Finished difference Result 287 states and 295 transitions. [2021-05-03 00:13:30,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:13:30,372 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 2 states have call successors, (3), 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 148 [2021-05-03 00:13:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:30,372 INFO L225 Difference]: With dead ends: 287 [2021-05-03 00:13:30,372 INFO L226 Difference]: Without dead ends: 152 [2021-05-03 00:13:30,373 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1162 ImplicationChecksByTransitivity, 1560.7ms TimeCoverageRelationStatistics Valid=1950, Invalid=3452, Unknown=0, NotChecked=0, Total=5402 [2021-05-03 00:13:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-05-03 00:13:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-05-03 00:13:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.0272108843537415) internal successors, (151), 147 states have internal predecessors, (151), 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:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2021-05-03 00:13:30,381 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 148 [2021-05-03 00:13:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:30,381 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2021-05-03 00:13:30,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 36 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call 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:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2021-05-03 00:13:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-05-03 00:13:30,382 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:30,382 INFO L523 BasicCegarLoop]: trace histogram [55, 50, 29, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:30,382 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-03 00:13:30,382 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:30,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1684775331, now seen corresponding path program 29 times [2021-05-03 00:13:30,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:30,383 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1293347162] [2021-05-03 00:13:30,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:30,389 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_963 999999) (<= 50000 v_main_~x~0_963)) InVars {main_~x~0=v_main_~x~0_963} OutVars{main_~x~0=v_main_~x~0_963} AuxVars[] AssignedVars[] [2021-05-03 00:13:30,390 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:30,391 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:30,396 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:30,404 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:30,406 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:30,431 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:30,448 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_965 50000) (< v_main_~x~0_965 999999)) InVars {main_~x~0=v_main_~x~0_965} OutVars{main_~x~0=v_main_~x~0_965} AuxVars[] AssignedVars[] [2021-05-03 00:13:30,449 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:30,455 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:30,459 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:30,465 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:30,475 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:30,476 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_967 50000) InVars {main_~x~0=v_main_~x~0_967} OutVars{main_~x~0=v_main_~x~0_967} AuxVars[] AssignedVars[] [2021-05-03 00:13:30,477 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:30,483 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:30,487 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:30,492 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:30,503 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_969 1000000) (<= 50000 v_main_~x~0_969)) InVars {main_~x~0=v_main_~x~0_969} OutVars{main_~x~0=v_main_~x~0_969} AuxVars[] AssignedVars[] [2021-05-03 00:13:30,504 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:30,519 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:30,521 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:30,536 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:30,538 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:30,551 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:30,568 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:30,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:30,985 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:30,986 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:30,987 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:32,559 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:32,559 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1293347162] [2021-05-03 00:13:32,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1293347162] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:32,559 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:32,559 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [85] imperfect sequences [] total 85 [2021-05-03 00:13:32,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860212030] [2021-05-03 00:13:32,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2021-05-03 00:13:32,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:32,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2021-05-03 00:13:32,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=4927, Unknown=0, NotChecked=0, Total=7140 [2021-05-03 00:13:32,561 INFO L87 Difference]: Start difference. First operand 152 states and 155 transitions. Second operand has 85 states, 85 states have (on average 1.6470588235294117) internal successors, (140), 84 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have call 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:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:39,130 INFO L93 Difference]: Finished difference Result 293 states and 304 transitions. [2021-05-03 00:13:39,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-05-03 00:13:39,141 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 1.6470588235294117) internal successors, (140), 84 states have internal predecessors, (140), 2 states have call successors, (3), 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:13:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:39,142 INFO L225 Difference]: With dead ends: 293 [2021-05-03 00:13:39,142 INFO L226 Difference]: Without dead ends: 157 [2021-05-03 00:13:39,144 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7925 ImplicationChecksByTransitivity, 6015.2ms TimeCoverageRelationStatistics Valid=6633, Invalid=21089, Unknown=0, NotChecked=0, Total=27722 [2021-05-03 00:13:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-05-03 00:13:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-05-03 00:13:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.0263157894736843) internal successors, (156), 152 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:13:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2021-05-03 00:13:39,153 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 151 [2021-05-03 00:13:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:39,153 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2021-05-03 00:13:39,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 85 states, 85 states have (on average 1.6470588235294117) internal successors, (140), 84 states have internal predecessors, (140), 2 states have call successors, (3), 3 states have call 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:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2021-05-03 00:13:39,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-05-03 00:13:39,154 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:39,154 INFO L523 BasicCegarLoop]: trace histogram [57, 52, 30, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:39,154 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-05-03 00:13:39,154 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:39,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:39,154 INFO L82 PathProgramCache]: Analyzing trace with hash -405089814, now seen corresponding path program 30 times [2021-05-03 00:13:39,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:39,155 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [207848545] [2021-05-03 00:13:39,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:39,164 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1028 999999) (<= 50000 v_main_~x~0_1028)) InVars {main_~x~0=v_main_~x~0_1028} OutVars{main_~x~0=v_main_~x~0_1028} AuxVars[] AssignedVars[] [2021-05-03 00:13:39,165 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:39,166 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:39,168 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:39,177 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:39,180 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:39,206 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:39,225 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1030 50000) (< v_main_~x~0_1030 999999)) InVars {main_~x~0=v_main_~x~0_1030} OutVars{main_~x~0=v_main_~x~0_1030} AuxVars[] AssignedVars[] [2021-05-03 00:13:39,227 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:39,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:39,231 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:39,243 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:39,254 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:39,255 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1032 50000) InVars {main_~x~0=v_main_~x~0_1032} OutVars{main_~x~0=v_main_~x~0_1032} AuxVars[] AssignedVars[] [2021-05-03 00:13:39,256 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:39,263 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:39,267 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:39,273 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:39,284 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1034 1000000) (<= 50000 v_main_~x~0_1034)) InVars {main_~x~0=v_main_~x~0_1034} OutVars{main_~x~0=v_main_~x~0_1034} AuxVars[] AssignedVars[] [2021-05-03 00:13:39,285 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:39,301 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:39,303 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:39,312 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:39,314 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:39,327 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:39,345 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:39,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:39,851 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,852 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:39,854 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:41,500 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:41,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [207848545] [2021-05-03 00:13:41,500 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [207848545] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:41,500 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:41,500 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [88] imperfect sequences [] total 88 [2021-05-03 00:13:41,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60113678] [2021-05-03 00:13:41,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2021-05-03 00:13:41,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:41,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2021-05-03 00:13:41,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2365, Invalid=5291, Unknown=0, NotChecked=0, Total=7656 [2021-05-03 00:13:41,502 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand has 88 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 87 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:13:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:48,438 INFO L93 Difference]: Finished difference Result 303 states and 314 transitions. [2021-05-03 00:13:48,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-05-03 00:13:48,439 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 87 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 156 [2021-05-03 00:13:48,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:48,444 INFO L225 Difference]: With dead ends: 303 [2021-05-03 00:13:48,444 INFO L226 Difference]: Without dead ends: 162 [2021-05-03 00:13:48,446 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8513 ImplicationChecksByTransitivity, 6440.1ms TimeCoverageRelationStatistics Valid=7089, Invalid=22667, Unknown=0, NotChecked=0, Total=29756 [2021-05-03 00:13:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-05-03 00:13:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-05-03 00:13:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 157 states have (on average 1.0254777070063694) internal successors, (161), 157 states have internal predecessors, (161), 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:48,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 165 transitions. [2021-05-03 00:13:48,470 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 165 transitions. Word has length 156 [2021-05-03 00:13:48,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:48,470 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 165 transitions. [2021-05-03 00:13:48,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 88 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 87 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:13:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 165 transitions. [2021-05-03 00:13:48,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-05-03 00:13:48,471 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:48,471 INFO L523 BasicCegarLoop]: trace histogram [59, 54, 31, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:48,471 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-05-03 00:13:48,471 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:48,471 INFO L82 PathProgramCache]: Analyzing trace with hash -102661841, now seen corresponding path program 31 times [2021-05-03 00:13:48,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:48,471 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1780689173] [2021-05-03 00:13:48,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:48,482 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1095 999999) (<= 50000 v_main_~x~0_1095)) InVars {main_~x~0=v_main_~x~0_1095} OutVars{main_~x~0=v_main_~x~0_1095} AuxVars[] AssignedVars[] [2021-05-03 00:13:48,484 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:48,485 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:48,486 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:48,494 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:48,496 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:48,521 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:48,543 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1097 999999) (< v_main_~x~0_1097 50000)) InVars {main_~x~0=v_main_~x~0_1097} OutVars{main_~x~0=v_main_~x~0_1097} AuxVars[] AssignedVars[] [2021-05-03 00:13:48,544 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:48,557 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:48,561 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:48,567 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:48,576 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:48,584 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1099 50000) InVars {main_~x~0=v_main_~x~0_1099} OutVars{main_~x~0=v_main_~x~0_1099} AuxVars[] AssignedVars[] [2021-05-03 00:13:48,586 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:48,593 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:48,597 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:48,603 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:48,614 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1101 1000000) (<= 50000 v_main_~x~0_1101)) InVars {main_~x~0=v_main_~x~0_1101} OutVars{main_~x~0=v_main_~x~0_1101} AuxVars[] AssignedVars[] [2021-05-03 00:13:48,615 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:48,630 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:48,632 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:48,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:48,642 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:48,655 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:48,673 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:49,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:49,145 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:49,146 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:49,147 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:50,945 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:50,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1780689173] [2021-05-03 00:13:50,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1780689173] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:50,945 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:50,945 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [91] imperfect sequences [] total 91 [2021-05-03 00:13:50,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153401648] [2021-05-03 00:13:50,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2021-05-03 00:13:50,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:50,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2021-05-03 00:13:50,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2522, Invalid=5668, Unknown=0, NotChecked=0, Total=8190 [2021-05-03 00:13:50,947 INFO L87 Difference]: Start difference. First operand 162 states and 165 transitions. Second operand has 91 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 90 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call 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,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:58,461 INFO L93 Difference]: Finished difference Result 313 states and 324 transitions. [2021-05-03 00:13:58,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-05-03 00:13:58,463 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 90 states have internal predecessors, (150), 2 states have call successors, (3), 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:13:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:58,463 INFO L225 Difference]: With dead ends: 313 [2021-05-03 00:13:58,463 INFO L226 Difference]: Without dead ends: 167 [2021-05-03 00:13:58,465 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9122 ImplicationChecksByTransitivity, 6879.4ms TimeCoverageRelationStatistics Valid=7560, Invalid=24302, Unknown=0, NotChecked=0, Total=31862 [2021-05-03 00:13:58,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-05-03 00:13:58,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-05-03 00:13:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.0246913580246915) internal successors, (166), 162 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:13:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2021-05-03 00:13:58,474 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 161 [2021-05-03 00:13:58,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:58,475 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2021-05-03 00:13:58,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 91 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 90 states have internal predecessors, (150), 2 states have call successors, (3), 3 states have call 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,475 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2021-05-03 00:13:58,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2021-05-03 00:13:58,475 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:58,476 INFO L523 BasicCegarLoop]: trace histogram [61, 56, 32, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:58,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-05-03 00:13:58,476 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:58,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:58,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1256706210, now seen corresponding path program 32 times [2021-05-03 00:13:58,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:58,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2014535136] [2021-05-03 00:13:58,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:58,482 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1164) (< v_main_~x~0_1164 999999)) InVars {main_~x~0=v_main_~x~0_1164} OutVars{main_~x~0=v_main_~x~0_1164} AuxVars[] AssignedVars[] [2021-05-03 00:13:58,484 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:58,485 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:58,486 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:58,494 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:58,496 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:58,520 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:58,538 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1166 999999) (< v_main_~x~0_1166 50000)) InVars {main_~x~0=v_main_~x~0_1166} OutVars{main_~x~0=v_main_~x~0_1166} AuxVars[] AssignedVars[] [2021-05-03 00:13:58,539 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:58,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:58,550 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:58,555 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:58,565 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:58,572 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1168 50000) InVars {main_~x~0=v_main_~x~0_1168} OutVars{main_~x~0=v_main_~x~0_1168} AuxVars[] AssignedVars[] [2021-05-03 00:13:58,574 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:58,580 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:58,584 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:58,601 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:58,613 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1170 1000000) (<= 50000 v_main_~x~0_1170)) InVars {main_~x~0=v_main_~x~0_1170} OutVars{main_~x~0=v_main_~x~0_1170} AuxVars[] AssignedVars[] [2021-05-03 00:13:58,615 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:58,615 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:58,618 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:58,629 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:58,631 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:58,657 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:58,675 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:59,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:59,178 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:59,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:59,180 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:14:01,128 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:01,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2014535136] [2021-05-03 00:14:01,128 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2014535136] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:01,129 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:01,129 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [94] imperfect sequences [] total 94 [2021-05-03 00:14:01,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328097571] [2021-05-03 00:14:01,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2021-05-03 00:14:01,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:01,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2021-05-03 00:14:01,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2684, Invalid=6058, Unknown=0, NotChecked=0, Total=8742 [2021-05-03 00:14:01,130 INFO L87 Difference]: Start difference. First operand 167 states and 170 transitions. Second operand has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 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:14:09,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:09,075 INFO L93 Difference]: Finished difference Result 323 states and 334 transitions. [2021-05-03 00:14:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-05-03 00:14:09,076 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 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 166 [2021-05-03 00:14:09,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:09,077 INFO L225 Difference]: With dead ends: 323 [2021-05-03 00:14:09,077 INFO L226 Difference]: Without dead ends: 172 [2021-05-03 00:14:09,078 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9752 ImplicationChecksByTransitivity, 7306.1ms TimeCoverageRelationStatistics Valid=8046, Invalid=25994, Unknown=0, NotChecked=0, Total=34040 [2021-05-03 00:14:09,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-05-03 00:14:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2021-05-03 00:14:09,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.0239520958083832) internal successors, (171), 167 states have internal predecessors, (171), 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,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 175 transitions. [2021-05-03 00:14:09,088 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 175 transitions. Word has length 166 [2021-05-03 00:14:09,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:09,088 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 175 transitions. [2021-05-03 00:14:09,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 94 states, 94 states have (on average 1.648936170212766) internal successors, (155), 93 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:14:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 175 transitions. [2021-05-03 00:14:09,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-05-03 00:14:09,089 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:09,089 INFO L523 BasicCegarLoop]: trace histogram [63, 58, 33, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:09,089 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-05-03 00:14:09,089 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:09,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:09,089 INFO L82 PathProgramCache]: Analyzing trace with hash -660883781, now seen corresponding path program 33 times [2021-05-03 00:14:09,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:09,090 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1405907899] [2021-05-03 00:14:09,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:09,095 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1235) (< v_main_~x~0_1235 999999)) InVars {main_~x~0=v_main_~x~0_1235} OutVars{main_~x~0=v_main_~x~0_1235} AuxVars[] AssignedVars[] [2021-05-03 00:14:09,096 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:09,111 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:09,113 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:09,120 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:09,122 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:09,136 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:09,154 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1237 50000) (< v_main_~x~0_1237 999999)) InVars {main_~x~0=v_main_~x~0_1237} OutVars{main_~x~0=v_main_~x~0_1237} AuxVars[] AssignedVars[] [2021-05-03 00:14:09,155 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:14:09,162 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:09,166 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:09,172 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:14:09,181 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:09,182 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1239 50000) InVars {main_~x~0=v_main_~x~0_1239} OutVars{main_~x~0=v_main_~x~0_1239} AuxVars[] AssignedVars[] [2021-05-03 00:14:09,183 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:14:09,184 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:09,188 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:09,199 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:14:09,216 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1241 1000000) (<= 50000 v_main_~x~0_1241)) InVars {main_~x~0=v_main_~x~0_1241} OutVars{main_~x~0=v_main_~x~0_1241} AuxVars[] AssignedVars[] [2021-05-03 00:14:09,219 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:09,233 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:09,235 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:09,242 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:09,244 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:09,257 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:09,274 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:09,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:09,879 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:09,880 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:14:09,882 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:14:11,956 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:11,956 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1405907899] [2021-05-03 00:14:11,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1405907899] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:11,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:11,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [97] imperfect sequences [] total 97 [2021-05-03 00:14:11,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311181123] [2021-05-03 00:14:11,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2021-05-03 00:14:11,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:11,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2021-05-03 00:14:11,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2851, Invalid=6461, Unknown=0, NotChecked=0, Total=9312 [2021-05-03 00:14:11,958 INFO L87 Difference]: Start difference. First operand 172 states and 175 transitions. Second operand has 97 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 96 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call 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:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:20,453 INFO L93 Difference]: Finished difference Result 333 states and 344 transitions. [2021-05-03 00:14:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2021-05-03 00:14:20,454 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 96 states have internal predecessors, (160), 2 states have call successors, (3), 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:14:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:20,455 INFO L225 Difference]: With dead ends: 333 [2021-05-03 00:14:20,455 INFO L226 Difference]: Without dead ends: 177 [2021-05-03 00:14:20,456 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10436 ImplicationChecksByTransitivity, 7859.7ms TimeCoverageRelationStatistics Valid=8547, Invalid=27743, Unknown=0, NotChecked=0, Total=36290 [2021-05-03 00:14:20,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-05-03 00:14:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-05-03 00:14:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.0232558139534884) internal successors, (176), 172 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:14:20,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 180 transitions. [2021-05-03 00:14:20,467 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 180 transitions. Word has length 171 [2021-05-03 00:14:20,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:20,467 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 180 transitions. [2021-05-03 00:14:20,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 97 states, 97 states have (on average 1.6494845360824741) internal successors, (160), 96 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call 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:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 180 transitions. [2021-05-03 00:14:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-05-03 00:14:20,468 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:20,468 INFO L523 BasicCegarLoop]: trace histogram [65, 60, 34, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:20,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-05-03 00:14:20,468 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:20,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:20,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1953261870, now seen corresponding path program 34 times [2021-05-03 00:14:20,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:20,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1917747387] [2021-05-03 00:14:20,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:20,474 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1308) (< v_main_~x~0_1308 999999)) InVars {main_~x~0=v_main_~x~0_1308} OutVars{main_~x~0=v_main_~x~0_1308} AuxVars[] AssignedVars[] [2021-05-03 00:14:20,476 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:20,477 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:20,478 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:20,487 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:20,489 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:20,514 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:20,533 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1310 50000) (< v_main_~x~0_1310 999999)) InVars {main_~x~0=v_main_~x~0_1310} OutVars{main_~x~0=v_main_~x~0_1310} AuxVars[] AssignedVars[] [2021-05-03 00:14:20,534 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:14:20,535 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:20,539 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:20,551 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:14:20,561 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:20,562 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1312 50000) InVars {main_~x~0=v_main_~x~0_1312} OutVars{main_~x~0=v_main_~x~0_1312} AuxVars[] AssignedVars[] [2021-05-03 00:14:20,563 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:14:20,563 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:20,567 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:20,578 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:14:20,590 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1314) (< v_main_~x~0_1314 1000000)) InVars {main_~x~0=v_main_~x~0_1314} OutVars{main_~x~0=v_main_~x~0_1314} AuxVars[] AssignedVars[] [2021-05-03 00:14:20,591 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:20,592 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:20,593 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:20,601 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:20,603 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:20,629 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:20,647 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:21,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:21,221 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:21,222 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:14:21,223 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:14:23,438 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:23,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1917747387] [2021-05-03 00:14:23,438 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1917747387] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:23,438 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:23,439 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [100] imperfect sequences [] total 100 [2021-05-03 00:14:23,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174872699] [2021-05-03 00:14:23,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states [2021-05-03 00:14:23,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:23,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2021-05-03 00:14:23,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3023, Invalid=6877, Unknown=0, NotChecked=0, Total=9900 [2021-05-03 00:14:23,440 INFO L87 Difference]: Start difference. First operand 177 states and 180 transitions. Second operand has 100 states, 100 states have (on average 1.65) internal successors, (165), 99 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:14:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:32,547 INFO L93 Difference]: Finished difference Result 343 states and 354 transitions. [2021-05-03 00:14:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2021-05-03 00:14:32,548 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 1.65) internal successors, (165), 99 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 176 [2021-05-03 00:14:32,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:32,549 INFO L225 Difference]: With dead ends: 343 [2021-05-03 00:14:32,549 INFO L226 Difference]: Without dead ends: 182 [2021-05-03 00:14:32,551 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11075 ImplicationChecksByTransitivity, 8265.6ms TimeCoverageRelationStatistics Valid=9063, Invalid=29549, Unknown=0, NotChecked=0, Total=38612 [2021-05-03 00:14:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-05-03 00:14:32,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-05-03 00:14:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 177 states have (on average 1.0225988700564972) internal successors, (181), 177 states have internal predecessors, (181), 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,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 185 transitions. [2021-05-03 00:14:32,561 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 185 transitions. Word has length 176 [2021-05-03 00:14:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:32,561 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 185 transitions. [2021-05-03 00:14:32,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 100 states, 100 states have (on average 1.65) internal successors, (165), 99 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:14:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 185 transitions. [2021-05-03 00:14:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-05-03 00:14:32,562 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:32,562 INFO L523 BasicCegarLoop]: trace histogram [67, 62, 35, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:32,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-05-03 00:14:32,562 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:32,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:32,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1436910151, now seen corresponding path program 35 times [2021-05-03 00:14:32,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:32,563 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1445223072] [2021-05-03 00:14:32,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:32,568 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1383 999999) (<= 50000 v_main_~x~0_1383)) InVars {main_~x~0=v_main_~x~0_1383} OutVars{main_~x~0=v_main_~x~0_1383} AuxVars[] AssignedVars[] [2021-05-03 00:14:32,569 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:32,570 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:32,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:32,581 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:32,583 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:32,607 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:32,625 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1385 999999) (< v_main_~x~0_1385 50000)) InVars {main_~x~0=v_main_~x~0_1385} OutVars{main_~x~0=v_main_~x~0_1385} AuxVars[] AssignedVars[] [2021-05-03 00:14:32,626 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:14:32,632 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:32,637 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:32,642 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:14:32,651 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:32,653 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1387 50000) InVars {main_~x~0=v_main_~x~0_1387} OutVars{main_~x~0=v_main_~x~0_1387} AuxVars[] AssignedVars[] [2021-05-03 00:14:32,654 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:14:32,660 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:32,664 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:32,669 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:14:32,680 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1389 1000000) (<= 50000 v_main_~x~0_1389)) InVars {main_~x~0=v_main_~x~0_1389} OutVars{main_~x~0=v_main_~x~0_1389} AuxVars[] AssignedVars[] [2021-05-03 00:14:32,682 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:32,697 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:32,699 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:32,708 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:32,710 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:32,723 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:32,741 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:33,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:33,345 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,346 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:14:33,347 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:14:35,682 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:35,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1445223072] [2021-05-03 00:14:35,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1445223072] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:35,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:35,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [103] imperfect sequences [] total 103 [2021-05-03 00:14:35,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707496738] [2021-05-03 00:14:35,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2021-05-03 00:14:35,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:35,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2021-05-03 00:14:35,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3200, Invalid=7306, Unknown=0, NotChecked=0, Total=10506 [2021-05-03 00:14:35,684 INFO L87 Difference]: Start difference. First operand 182 states and 185 transitions. Second operand has 103 states, 103 states have (on average 1.6504854368932038) internal successors, (170), 102 states have internal predecessors, (170), 2 states have call successors, (3), 3 states have call 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:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:45,571 INFO L93 Difference]: Finished difference Result 353 states and 364 transitions. [2021-05-03 00:14:45,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2021-05-03 00:14:45,572 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.6504854368932038) internal successors, (170), 102 states have internal predecessors, (170), 2 states have call successors, (3), 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:14:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:45,573 INFO L225 Difference]: With dead ends: 353 [2021-05-03 00:14:45,573 INFO L226 Difference]: Without dead ends: 187 [2021-05-03 00:14:45,575 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11768 ImplicationChecksByTransitivity, 8759.6ms TimeCoverageRelationStatistics Valid=9594, Invalid=31412, Unknown=0, NotChecked=0, Total=41006 [2021-05-03 00:14:45,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-05-03 00:14:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2021-05-03 00:14:45,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.021978021978022) internal successors, (186), 182 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:14:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 190 transitions. [2021-05-03 00:14:45,585 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 190 transitions. Word has length 181 [2021-05-03 00:14:45,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:45,585 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 190 transitions. [2021-05-03 00:14:45,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 103 states, 103 states have (on average 1.6504854368932038) internal successors, (170), 102 states have internal predecessors, (170), 2 states have call successors, (3), 3 states have call 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:45,586 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 190 transitions. [2021-05-03 00:14:45,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-05-03 00:14:45,586 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:45,586 INFO L523 BasicCegarLoop]: trace histogram [69, 64, 36, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:45,586 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-05-03 00:14:45,586 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:45,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:45,587 INFO L82 PathProgramCache]: Analyzing trace with hash -559822778, now seen corresponding path program 36 times [2021-05-03 00:14:45,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:45,587 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [562130986] [2021-05-03 00:14:45,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:45,593 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1460 999999) (<= 50000 v_main_~x~0_1460)) InVars {main_~x~0=v_main_~x~0_1460} OutVars{main_~x~0=v_main_~x~0_1460} AuxVars[] AssignedVars[] [2021-05-03 00:14:45,595 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:45,613 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:45,614 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:45,624 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:45,626 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:45,641 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:45,663 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1462 50000) (< v_main_~x~0_1462 999999)) InVars {main_~x~0=v_main_~x~0_1462} OutVars{main_~x~0=v_main_~x~0_1462} AuxVars[] AssignedVars[] [2021-05-03 00:14:45,664 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:14:45,665 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:45,670 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:45,684 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:14:45,696 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:45,697 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1464 50000) InVars {main_~x~0=v_main_~x~0_1464} OutVars{main_~x~0=v_main_~x~0_1464} AuxVars[] AssignedVars[] [2021-05-03 00:14:45,698 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:14:45,706 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:45,710 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:45,717 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:14:45,731 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1466 1000000) (<= 50000 v_main_~x~0_1466)) InVars {main_~x~0=v_main_~x~0_1466} OutVars{main_~x~0=v_main_~x~0_1466} AuxVars[] AssignedVars[] [2021-05-03 00:14:45,733 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:45,750 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:45,752 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:45,762 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:45,764 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:45,780 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:45,803 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:46,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:46,465 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:46,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:14:46,468 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:14:48,983 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:48,983 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [562130986] [2021-05-03 00:14:48,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [562130986] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:48,984 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:48,984 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [106] imperfect sequences [] total 106 [2021-05-03 00:14:48,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465680097] [2021-05-03 00:14:48,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states [2021-05-03 00:14:48,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:48,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2021-05-03 00:14:48,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3382, Invalid=7748, Unknown=0, NotChecked=0, Total=11130 [2021-05-03 00:14:48,985 INFO L87 Difference]: Start difference. First operand 187 states and 190 transitions. Second operand has 106 states, 106 states have (on average 1.650943396226415) internal successors, (175), 105 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:14:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:59,480 INFO L93 Difference]: Finished difference Result 363 states and 374 transitions. [2021-05-03 00:14:59,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-05-03 00:14:59,480 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 106 states have (on average 1.650943396226415) internal successors, (175), 105 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 186 [2021-05-03 00:14:59,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:59,481 INFO L225 Difference]: With dead ends: 363 [2021-05-03 00:14:59,481 INFO L226 Difference]: Without dead ends: 192 [2021-05-03 00:14:59,483 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12482 ImplicationChecksByTransitivity, 9449.4ms TimeCoverageRelationStatistics Valid=10140, Invalid=33332, Unknown=0, NotChecked=0, Total=43472 [2021-05-03 00:14:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-05-03 00:14:59,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2021-05-03 00:14:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 187 states have (on average 1.0213903743315509) internal successors, (191), 187 states have internal predecessors, (191), 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,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 195 transitions. [2021-05-03 00:14:59,493 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 195 transitions. Word has length 186 [2021-05-03 00:14:59,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:59,494 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 195 transitions. [2021-05-03 00:14:59,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 106 states, 106 states have (on average 1.650943396226415) internal successors, (175), 105 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:14:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 195 transitions. [2021-05-03 00:14:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-05-03 00:14:59,494 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:59,495 INFO L523 BasicCegarLoop]: trace histogram [71, 66, 37, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:59,495 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-05-03 00:14:59,495 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:59,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:59,495 INFO L82 PathProgramCache]: Analyzing trace with hash -599120941, now seen corresponding path program 37 times [2021-05-03 00:14:59,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:59,495 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1757781797] [2021-05-03 00:14:59,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:59,501 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1539) (< v_main_~x~0_1539 999999)) InVars {main_~x~0=v_main_~x~0_1539} OutVars{main_~x~0=v_main_~x~0_1539} AuxVars[] AssignedVars[] [2021-05-03 00:14:59,503 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:59,518 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:59,520 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:59,529 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:59,532 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:59,546 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:59,566 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1541 50000) (< v_main_~x~0_1541 999999)) InVars {main_~x~0=v_main_~x~0_1541} OutVars{main_~x~0=v_main_~x~0_1541} AuxVars[] AssignedVars[] [2021-05-03 00:14:59,568 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:14:59,568 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:59,572 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:59,584 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:14:59,595 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:59,596 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1543 50000) InVars {main_~x~0=v_main_~x~0_1543} OutVars{main_~x~0=v_main_~x~0_1543} AuxVars[] AssignedVars[] [2021-05-03 00:14:59,597 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:14:59,598 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:59,602 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:59,613 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:14:59,625 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1545 1000000) (<= 50000 v_main_~x~0_1545)) InVars {main_~x~0=v_main_~x~0_1545} OutVars{main_~x~0=v_main_~x~0_1545} AuxVars[] AssignedVars[] [2021-05-03 00:14:59,628 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:59,644 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:59,646 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:59,655 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:59,664 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:59,680 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:59,700 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:00,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:00,365 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:00,366 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:00,368 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:03,018 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:03,018 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1757781797] [2021-05-03 00:15:03,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1757781797] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:03,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:03,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [109] imperfect sequences [] total 109 [2021-05-03 00:15:03,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349773193] [2021-05-03 00:15:03,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2021-05-03 00:15:03,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:03,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2021-05-03 00:15:03,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3569, Invalid=8203, Unknown=0, NotChecked=0, Total=11772 [2021-05-03 00:15:03,020 INFO L87 Difference]: Start difference. First operand 192 states and 195 transitions. Second operand has 109 states, 109 states have (on average 1.651376146788991) internal successors, (180), 108 states have internal predecessors, (180), 2 states have call successors, (3), 3 states have call 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:14,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:14,737 INFO L93 Difference]: Finished difference Result 373 states and 384 transitions. [2021-05-03 00:15:14,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-05-03 00:15:14,738 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 1.651376146788991) internal successors, (180), 108 states have internal predecessors, (180), 2 states have call successors, (3), 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 191 [2021-05-03 00:15:14,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:14,752 INFO L225 Difference]: With dead ends: 373 [2021-05-03 00:15:14,752 INFO L226 Difference]: Without dead ends: 197 [2021-05-03 00:15:14,755 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13254 ImplicationChecksByTransitivity, 10185.2ms TimeCoverageRelationStatistics Valid=10701, Invalid=35309, Unknown=0, NotChecked=0, Total=46010 [2021-05-03 00:15:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-05-03 00:15:14,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-05-03 00:15:14,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 192 states have (on average 1.0208333333333333) internal successors, (196), 192 states have internal predecessors, (196), 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:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 200 transitions. [2021-05-03 00:15:14,766 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 200 transitions. Word has length 191 [2021-05-03 00:15:14,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:14,766 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 200 transitions. [2021-05-03 00:15:14,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 109 states, 109 states have (on average 1.651376146788991) internal successors, (180), 108 states have internal predecessors, (180), 2 states have call successors, (3), 3 states have call 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:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 200 transitions. [2021-05-03 00:15:14,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-05-03 00:15:14,767 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:14,767 INFO L523 BasicCegarLoop]: trace histogram [73, 68, 38, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:14,767 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-05-03 00:15:14,767 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:14,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:14,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2102887354, now seen corresponding path program 38 times [2021-05-03 00:15:14,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:14,768 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [482870842] [2021-05-03 00:15:14,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:14,774 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1620) (< v_main_~x~0_1620 999999)) InVars {main_~x~0=v_main_~x~0_1620} OutVars{main_~x~0=v_main_~x~0_1620} AuxVars[] AssignedVars[] [2021-05-03 00:15:14,776 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:14,777 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:14,779 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:14,788 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:14,791 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:14,818 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:14,839 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1622 999999) (< v_main_~x~0_1622 50000)) InVars {main_~x~0=v_main_~x~0_1622} OutVars{main_~x~0=v_main_~x~0_1622} AuxVars[] AssignedVars[] [2021-05-03 00:15:14,841 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:15:14,841 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:14,846 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:14,860 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:15:14,873 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:14,874 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1624 50000) InVars {main_~x~0=v_main_~x~0_1624} OutVars{main_~x~0=v_main_~x~0_1624} AuxVars[] AssignedVars[] [2021-05-03 00:15:14,875 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:15:14,876 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:14,881 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:14,894 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:15:14,927 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1626 1000000) (<= 50000 v_main_~x~0_1626)) InVars {main_~x~0=v_main_~x~0_1626} OutVars{main_~x~0=v_main_~x~0_1626} AuxVars[] AssignedVars[] [2021-05-03 00:15:14,929 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:14,930 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:14,931 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:14,941 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:14,944 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:14,976 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:14,998 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:15,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:15,727 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:15,728 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:15,729 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:18,651 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:18,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [482870842] [2021-05-03 00:15:18,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [482870842] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:18,651 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:18,651 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [112] imperfect sequences [] total 112 [2021-05-03 00:15:18,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928552239] [2021-05-03 00:15:18,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 112 states [2021-05-03 00:15:18,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:18,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2021-05-03 00:15:18,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3761, Invalid=8671, Unknown=0, NotChecked=0, Total=12432 [2021-05-03 00:15:18,653 INFO L87 Difference]: Start difference. First operand 197 states and 200 transitions. Second operand has 112 states, 112 states have (on average 1.6517857142857142) internal successors, (185), 111 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) [2021-05-03 00:15:30,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:30,783 INFO L93 Difference]: Finished difference Result 383 states and 394 transitions. [2021-05-03 00:15:30,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2021-05-03 00:15:30,784 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 1.6517857142857142) internal successors, (185), 111 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) Word has length 196 [2021-05-03 00:15:30,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:30,785 INFO L225 Difference]: With dead ends: 383 [2021-05-03 00:15:30,785 INFO L226 Difference]: Without dead ends: 202 [2021-05-03 00:15:30,787 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14011 ImplicationChecksByTransitivity, 10801.1ms TimeCoverageRelationStatistics Valid=11277, Invalid=37343, Unknown=0, NotChecked=0, Total=48620 [2021-05-03 00:15:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-05-03 00:15:30,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2021-05-03 00:15:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.0203045685279188) internal successors, (201), 197 states have internal predecessors, (201), 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:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 205 transitions. [2021-05-03 00:15:30,799 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 205 transitions. Word has length 196 [2021-05-03 00:15:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:30,799 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 205 transitions. [2021-05-03 00:15:30,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 112 states, 112 states have (on average 1.6517857142857142) internal successors, (185), 111 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) [2021-05-03 00:15:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 205 transitions. [2021-05-03 00:15:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-05-03 00:15:30,800 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:30,800 INFO L523 BasicCegarLoop]: trace histogram [75, 70, 39, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:30,800 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-05-03 00:15:30,800 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:30,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:30,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1978344609, now seen corresponding path program 39 times [2021-05-03 00:15:30,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:30,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [357536586] [2021-05-03 00:15:30,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:30,811 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1703) (< v_main_~x~0_1703 999999)) InVars {main_~x~0=v_main_~x~0_1703} OutVars{main_~x~0=v_main_~x~0_1703} AuxVars[] AssignedVars[] [2021-05-03 00:15:30,813 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:30,814 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:30,815 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:30,824 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:30,827 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:30,852 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:30,872 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1705 999999) (< v_main_~x~0_1705 50000)) 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:30,873 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:15:30,874 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:30,878 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:30,890 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:15:30,901 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:30,902 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1707 50000) 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:30,903 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:15:30,904 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:30,908 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:30,928 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:15:30,941 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1709) (< v_main_~x~0_1709 1000000)) InVars {main_~x~0=v_main_~x~0_1709} OutVars{main_~x~0=v_main_~x~0_1709} AuxVars[] AssignedVars[] [2021-05-03 00:15:30,942 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:30,943 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:30,944 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:30,953 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:30,955 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:30,981 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:31,005 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:31,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:31,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:31,797 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:31,798 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:34,888 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:34,888 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [357536586] [2021-05-03 00:15:34,888 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [357536586] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:34,888 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:34,888 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [115] imperfect sequences [] total 115 [2021-05-03 00:15:34,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479063324] [2021-05-03 00:15:34,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2021-05-03 00:15:34,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:34,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2021-05-03 00:15:34,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3958, Invalid=9152, Unknown=0, NotChecked=0, Total=13110 [2021-05-03 00:15:34,890 INFO L87 Difference]: Start difference. First operand 202 states and 205 transitions. Second operand has 115 states, 115 states have (on average 1.6521739130434783) internal successors, (190), 114 states have internal predecessors, (190), 2 states have call successors, (3), 3 states have call 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:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:47,840 INFO L93 Difference]: Finished difference Result 393 states and 404 transitions. [2021-05-03 00:15:47,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2021-05-03 00:15:47,840 INFO L78 Accepts]: Start accepts. Automaton has has 115 states, 115 states have (on average 1.6521739130434783) internal successors, (190), 114 states have internal predecessors, (190), 2 states have call successors, (3), 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 201 [2021-05-03 00:15:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:47,841 INFO L225 Difference]: With dead ends: 393 [2021-05-03 00:15:47,841 INFO L226 Difference]: Without dead ends: 207 [2021-05-03 00:15:47,844 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14789 ImplicationChecksByTransitivity, 11542.0ms TimeCoverageRelationStatistics Valid=11868, Invalid=39434, Unknown=0, NotChecked=0, Total=51302 [2021-05-03 00:15:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-05-03 00:15:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-05-03 00:15:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.0198019801980198) internal successors, (206), 202 states have internal predecessors, (206), 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:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 210 transitions. [2021-05-03 00:15:47,856 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 210 transitions. Word has length 201 [2021-05-03 00:15:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:47,856 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 210 transitions. [2021-05-03 00:15:47,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 115 states, 115 states have (on average 1.6521739130434783) internal successors, (190), 114 states have internal predecessors, (190), 2 states have call successors, (3), 3 states have call 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:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 210 transitions. [2021-05-03 00:15:47,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-05-03 00:15:47,857 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:47,857 INFO L523 BasicCegarLoop]: trace histogram [77, 72, 40, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:47,857 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-05-03 00:15:47,857 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:47,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:47,857 INFO L82 PathProgramCache]: Analyzing trace with hash -158758610, now seen corresponding path program 40 times [2021-05-03 00:15:47,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:47,858 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [133283867] [2021-05-03 00:15:47,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:47,870 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1788 999999) (<= 50000 v_main_~x~0_1788)) InVars {main_~x~0=v_main_~x~0_1788} OutVars{main_~x~0=v_main_~x~0_1788} AuxVars[] AssignedVars[] [2021-05-03 00:15:47,871 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:47,888 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:47,892 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:47,907 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:47,909 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:47,924 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:47,973 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1790 50000) (< v_main_~x~0_1790 999999)) InVars {main_~x~0=v_main_~x~0_1790} OutVars{main_~x~0=v_main_~x~0_1790} AuxVars[] AssignedVars[] [2021-05-03 00:15:47,974 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:15:47,981 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:47,986 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:47,992 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:15:48,003 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:48,004 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1792 50000) InVars {main_~x~0=v_main_~x~0_1792} OutVars{main_~x~0=v_main_~x~0_1792} AuxVars[] AssignedVars[] [2021-05-03 00:15:48,005 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:15:48,005 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:48,010 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:48,023 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:15:48,038 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1794) (< v_main_~x~0_1794 1000000)) InVars {main_~x~0=v_main_~x~0_1794} OutVars{main_~x~0=v_main_~x~0_1794} AuxVars[] AssignedVars[] [2021-05-03 00:15:48,039 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:48,056 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:48,058 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:48,070 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:48,073 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:48,087 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:48,106 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:49,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:49,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:15:49,166 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:49,259 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:49,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [133283867] [2021-05-03 00:15:49,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [133283867] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:49,259 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:49,259 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-03 00:15:49,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671586970] [2021-05-03 00:15:49,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-03 00:15:49,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:49,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-03 00:15:49,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1268, Invalid=1488, Unknown=0, NotChecked=0, Total=2756 [2021-05-03 00:15:49,261 INFO L87 Difference]: Start difference. First operand 207 states and 210 transitions. Second operand has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call 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:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:51,455 INFO L93 Difference]: Finished difference Result 401 states and 409 transitions. [2021-05-03 00:15:51,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-03 00:15:51,456 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 2 states have call successors, (3), 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 206 [2021-05-03 00:15:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:51,457 INFO L225 Difference]: With dead ends: 401 [2021-05-03 00:15:51,457 INFO L226 Difference]: Without dead ends: 210 [2021-05-03 00:15:51,458 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2049 ImplicationChecksByTransitivity, 3032.7ms TimeCoverageRelationStatistics Valid=3601, Invalid=6299, Unknown=0, NotChecked=0, Total=9900 [2021-05-03 00:15:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-05-03 00:15:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-05-03 00:15:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.0195121951219512) internal successors, (209), 205 states have internal predecessors, (209), 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:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 213 transitions. [2021-05-03 00:15:51,469 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 213 transitions. Word has length 206 [2021-05-03 00:15:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:51,470 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 213 transitions. [2021-05-03 00:15:51,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call 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:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 213 transitions. [2021-05-03 00:15:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-05-03 00:15:51,470 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:51,471 INFO L523 BasicCegarLoop]: trace histogram [78, 72, 41, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:51,471 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-05-03 00:15:51,471 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:51,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:51,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2064695826, now seen corresponding path program 41 times [2021-05-03 00:15:51,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:51,471 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2109329164] [2021-05-03 00:15:51,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:51,478 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1804) (< v_main_~x~0_1804 999999)) InVars {main_~x~0=v_main_~x~0_1804} OutVars{main_~x~0=v_main_~x~0_1804} AuxVars[] AssignedVars[] [2021-05-03 00:15:51,481 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:51,498 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:51,500 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:51,510 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:51,514 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:51,529 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:51,549 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1806 50000) (< v_main_~x~0_1806 999999)) InVars {main_~x~0=v_main_~x~0_1806} OutVars{main_~x~0=v_main_~x~0_1806} AuxVars[] AssignedVars[] [2021-05-03 00:15:51,551 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:15:51,551 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:51,556 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:51,569 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:15:51,580 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:51,582 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1808 50000) InVars {main_~x~0=v_main_~x~0_1808} OutVars{main_~x~0=v_main_~x~0_1808} AuxVars[] AssignedVars[] [2021-05-03 00:15:51,583 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:15:51,591 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:51,596 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:51,603 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:15:51,617 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1810 1000000) (<= 50000 v_main_~x~0_1810)) InVars {main_~x~0=v_main_~x~0_1810} OutVars{main_~x~0=v_main_~x~0_1810} AuxVars[] AssignedVars[] [2021-05-03 00:15:51,619 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:51,643 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:51,645 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:51,655 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:51,657 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:51,672 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:51,694 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:52,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:52,677 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,685 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:52,687 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:56,067 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:56,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2109329164] [2021-05-03 00:15:56,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2109329164] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:56,067 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:56,067 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [119] imperfect sequences [] total 119 [2021-05-03 00:15:56,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218819250] [2021-05-03 00:15:56,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2021-05-03 00:15:56,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:56,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2021-05-03 00:15:56,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4277, Invalid=9765, Unknown=0, NotChecked=0, Total=14042 [2021-05-03 00:15:56,069 INFO L87 Difference]: Start difference. First operand 210 states and 213 transitions. Second operand has 119 states, 119 states have (on average 1.6470588235294117) internal successors, (196), 118 states have internal predecessors, (196), 2 states have call successors, (3), 3 states have call 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:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:10,583 INFO L93 Difference]: Finished difference Result 407 states and 418 transitions. [2021-05-03 00:16:10,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2021-05-03 00:16:10,584 INFO L78 Accepts]: Start accepts. Automaton has has 119 states, 119 states have (on average 1.6470588235294117) internal successors, (196), 118 states have internal predecessors, (196), 2 states have call successors, (3), 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 209 [2021-05-03 00:16:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:10,585 INFO L225 Difference]: With dead ends: 407 [2021-05-03 00:16:10,585 INFO L226 Difference]: Without dead ends: 215 [2021-05-03 00:16:10,587 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15927 ImplicationChecksByTransitivity, 12799.5ms TimeCoverageRelationStatistics Valid=12825, Invalid=42165, Unknown=0, NotChecked=0, Total=54990 [2021-05-03 00:16:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-05-03 00:16:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2021-05-03 00:16:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 210 states have (on average 1.019047619047619) internal successors, (214), 210 states have internal predecessors, (214), 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:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 218 transitions. [2021-05-03 00:16:10,599 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 218 transitions. Word has length 209 [2021-05-03 00:16:10,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:10,599 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 218 transitions. [2021-05-03 00:16:10,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 119 states, 119 states have (on average 1.6470588235294117) internal successors, (196), 118 states have internal predecessors, (196), 2 states have call successors, (3), 3 states have call 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:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 218 transitions. [2021-05-03 00:16:10,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-05-03 00:16:10,600 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:10,600 INFO L523 BasicCegarLoop]: trace histogram [80, 74, 42, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:10,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-05-03 00:16:10,600 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:10,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:10,600 INFO L82 PathProgramCache]: Analyzing trace with hash 706306011, now seen corresponding path program 42 times [2021-05-03 00:16:10,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:10,600 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [531230024] [2021-05-03 00:16:10,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:10,607 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1892) (< v_main_~x~0_1892 999999)) InVars {main_~x~0=v_main_~x~0_1892} OutVars{main_~x~0=v_main_~x~0_1892} AuxVars[] AssignedVars[] [2021-05-03 00:16:10,608 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:16:10,609 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:10,611 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:10,619 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:10,622 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:10,649 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:16:10,670 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1894 999999) (< v_main_~x~0_1894 50000)) InVars {main_~x~0=v_main_~x~0_1894} OutVars{main_~x~0=v_main_~x~0_1894} AuxVars[] AssignedVars[] [2021-05-03 00:16:10,671 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:16:10,672 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:10,676 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:10,689 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:16:10,700 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:10,701 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1896 50000) InVars {main_~x~0=v_main_~x~0_1896} OutVars{main_~x~0=v_main_~x~0_1896} AuxVars[] AssignedVars[] [2021-05-03 00:16:10,702 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:16:10,709 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:10,713 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:10,720 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:16:10,733 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1898 1000000) (<= 50000 v_main_~x~0_1898)) InVars {main_~x~0=v_main_~x~0_1898} OutVars{main_~x~0=v_main_~x~0_1898} AuxVars[] AssignedVars[] [2021-05-03 00:16:10,734 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:16:10,751 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:10,754 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:10,770 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:10,773 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:10,787 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:16:10,806 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:11,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:11,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:16:11,793 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:11,794 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:15,256 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:15,256 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [531230024] [2021-05-03 00:16:15,256 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [531230024] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:15,256 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:15,256 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [122] imperfect sequences [] total 122 [2021-05-03 00:16:15,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229018654] [2021-05-03 00:16:15,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states [2021-05-03 00:16:15,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:15,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2021-05-03 00:16:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4566, Invalid=10440, Unknown=0, NotChecked=0, Total=15006 [2021-05-03 00:16:15,258 INFO L87 Difference]: Start difference. First operand 215 states and 218 transitions. Second operand has 122 states, 122 states have (on average 1.6475409836065573) internal successors, (201), 121 states have internal predecessors, (201), 2 states have call successors, (3), 3 states have call 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:30,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:30,201 INFO L93 Difference]: Finished difference Result 417 states and 428 transitions. [2021-05-03 00:16:30,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2021-05-03 00:16:30,202 INFO L78 Accepts]: Start accepts. Automaton has has 122 states, 122 states have (on average 1.6475409836065573) internal successors, (201), 121 states have internal predecessors, (201), 2 states have call successors, (3), 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 214 [2021-05-03 00:16:30,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:30,202 INFO L225 Difference]: With dead ends: 417 [2021-05-03 00:16:30,202 INFO L226 Difference]: Without dead ends: 220 [2021-05-03 00:16:30,205 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16867 ImplicationChecksByTransitivity, 13270.7ms TimeCoverageRelationStatistics Valid=13611, Invalid=44711, Unknown=0, NotChecked=0, Total=58322 [2021-05-03 00:16:30,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-05-03 00:16:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-05-03 00:16:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 215 states have (on average 1.0186046511627906) internal successors, (219), 215 states have internal predecessors, (219), 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:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 223 transitions. [2021-05-03 00:16:30,218 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 223 transitions. Word has length 214 [2021-05-03 00:16:30,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:30,218 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 223 transitions. [2021-05-03 00:16:30,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 122 states, 122 states have (on average 1.6475409836065573) internal successors, (201), 121 states have internal predecessors, (201), 2 states have call successors, (3), 3 states have call 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:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 223 transitions. [2021-05-03 00:16:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-05-03 00:16:30,219 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:30,219 INFO L523 BasicCegarLoop]: trace histogram [82, 76, 43, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:30,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-05-03 00:16:30,220 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:30,220 INFO L82 PathProgramCache]: Analyzing trace with hash 744841438, now seen corresponding path program 43 times [2021-05-03 00:16:30,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:30,220 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2034512407] [2021-05-03 00:16:30,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:30,228 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1982) (< v_main_~x~0_1982 999999)) InVars {main_~x~0=v_main_~x~0_1982} OutVars{main_~x~0=v_main_~x~0_1982} AuxVars[] AssignedVars[] [2021-05-03 00:16:30,230 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:16:30,249 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,251 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,260 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:30,263 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:30,277 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:16:30,305 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1984 50000) (< v_main_~x~0_1984 999999)) InVars {main_~x~0=v_main_~x~0_1984} OutVars{main_~x~0=v_main_~x~0_1984} AuxVars[] AssignedVars[] [2021-05-03 00:16:30,306 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:16:30,314 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:30,331 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:16:30,342 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:30,345 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1986 50000) InVars {main_~x~0=v_main_~x~0_1986} OutVars{main_~x~0=v_main_~x~0_1986} AuxVars[] AssignedVars[] [2021-05-03 00:16:30,346 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:16:30,347 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,352 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:30,366 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:16:30,380 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_1988) (< v_main_~x~0_1988 1000000)) InVars {main_~x~0=v_main_~x~0_1988} OutVars{main_~x~0=v_main_~x~0_1988} AuxVars[] AssignedVars[] [2021-05-03 00:16:30,381 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:16:30,382 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:30,393 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:30,395 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:30,425 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:16:30,446 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:31,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:31,647 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:31,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:31,757 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:31,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2034512407] [2021-05-03 00:16:31,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2034512407] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:31,757 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:31,758 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-03 00:16:31,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265721381] [2021-05-03 00:16:31,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-03 00:16:31,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:31,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-03 00:16:31,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1472, Invalid=1720, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:16:31,759 INFO L87 Difference]: Start difference. First operand 220 states and 223 transitions. Second operand has 54 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 53 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:16:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:34,374 INFO L93 Difference]: Finished difference Result 425 states and 433 transitions. [2021-05-03 00:16:34,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-03 00:16:34,375 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 53 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 219 [2021-05-03 00:16:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:34,376 INFO L225 Difference]: With dead ends: 425 [2021-05-03 00:16:34,376 INFO L226 Difference]: Without dead ends: 223 [2021-05-03 00:16:34,377 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2448 ImplicationChecksByTransitivity, 3572.3ms TimeCoverageRelationStatistics Valid=4199, Invalid=7357, Unknown=0, NotChecked=0, Total=11556 [2021-05-03 00:16:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-05-03 00:16:34,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2021-05-03 00:16:34,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 218 states have (on average 1.018348623853211) internal successors, (222), 218 states have internal predecessors, (222), 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,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 226 transitions. [2021-05-03 00:16:34,389 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 226 transitions. Word has length 219 [2021-05-03 00:16:34,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:34,389 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 226 transitions. [2021-05-03 00:16:34,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 53 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:16:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 226 transitions. [2021-05-03 00:16:34,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2021-05-03 00:16:34,390 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:34,390 INFO L523 BasicCegarLoop]: trace histogram [83, 76, 44, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:34,390 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-05-03 00:16:34,390 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:34,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:34,390 INFO L82 PathProgramCache]: Analyzing trace with hash 779694920, now seen corresponding path program 44 times [2021-05-03 00:16:34,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:34,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [488097870] [2021-05-03 00:16:34,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:34,397 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1999 999999) (<= 50000 v_main_~x~0_1999)) InVars {main_~x~0=v_main_~x~0_1999} OutVars{main_~x~0=v_main_~x~0_1999} AuxVars[] AssignedVars[] [2021-05-03 00:16:34,399 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:16:34,400 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,413 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:34,415 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:34,446 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:16:34,470 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2001 50000) (< v_main_~x~0_2001 999999)) InVars {main_~x~0=v_main_~x~0_2001} OutVars{main_~x~0=v_main_~x~0_2001} AuxVars[] AssignedVars[] [2021-05-03 00:16:34,475 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:16:34,483 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,487 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:34,495 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:16:34,506 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:34,508 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2003 50000) InVars {main_~x~0=v_main_~x~0_2003} OutVars{main_~x~0=v_main_~x~0_2003} AuxVars[] AssignedVars[] [2021-05-03 00:16:34,509 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:16:34,517 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,523 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:34,530 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:16:34,546 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2005 1000000) (<= 50000 v_main_~x~0_2005)) InVars {main_~x~0=v_main_~x~0_2005} OutVars{main_~x~0=v_main_~x~0_2005} AuxVars[] AssignedVars[] [2021-05-03 00:16:34,550 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:16:34,551 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,553 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:34,565 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:34,567 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:34,598 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:16:34,619 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:35,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:35,643 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:35,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:35,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:39,569 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:39,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [488097870] [2021-05-03 00:16:39,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [488097870] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:39,569 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:39,569 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [126] imperfect sequences [] total 126 [2021-05-03 00:16:39,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066203111] [2021-05-03 00:16:39,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states [2021-05-03 00:16:39,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:39,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2021-05-03 00:16:39,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4826, Invalid=10924, Unknown=0, NotChecked=0, Total=15750 [2021-05-03 00:16:39,571 INFO L87 Difference]: Start difference. First operand 223 states and 226 transitions. Second operand has 126 states, 126 states have (on average 1.6428571428571428) internal successors, (207), 125 states have internal predecessors, (207), 2 states have call successors, (3), 3 states have call 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:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:56,140 INFO L93 Difference]: Finished difference Result 431 states and 442 transitions. [2021-05-03 00:16:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2021-05-03 00:16:56,140 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 126 states have (on average 1.6428571428571428) internal successors, (207), 125 states have internal predecessors, (207), 2 states have call successors, (3), 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 222 [2021-05-03 00:16:56,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:56,141 INFO L225 Difference]: With dead ends: 431 [2021-05-03 00:16:56,141 INFO L226 Difference]: Without dead ends: 228 [2021-05-03 00:16:56,144 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17964 ImplicationChecksByTransitivity, 14779.3ms TimeCoverageRelationStatistics Valid=14472, Invalid=47280, Unknown=0, NotChecked=0, Total=61752 [2021-05-03 00:16:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-05-03 00:16:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2021-05-03 00:16:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 223 states have (on average 1.0179372197309418) internal successors, (227), 223 states have internal predecessors, (227), 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:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 231 transitions. [2021-05-03 00:16:56,167 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 231 transitions. Word has length 222 [2021-05-03 00:16:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:56,168 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 231 transitions. [2021-05-03 00:16:56,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 126 states, 126 states have (on average 1.6428571428571428) internal successors, (207), 125 states have internal predecessors, (207), 2 states have call successors, (3), 3 states have call 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:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 231 transitions. [2021-05-03 00:16:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-05-03 00:16:56,177 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:56,177 INFO L523 BasicCegarLoop]: trace histogram [85, 78, 45, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:56,177 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-05-03 00:16:56,177 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:56,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash 906572817, now seen corresponding path program 45 times [2021-05-03 00:16:56,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:56,178 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2059071975] [2021-05-03 00:16:56,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:56,191 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2092) (< v_main_~x~0_2092 999999)) InVars {main_~x~0=v_main_~x~0_2092} OutVars{main_~x~0=v_main_~x~0_2092} AuxVars[] AssignedVars[] [2021-05-03 00:16:56,206 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:16:56,207 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,209 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,222 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:56,225 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:56,259 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:16:56,283 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2094 50000) (< v_main_~x~0_2094 999999)) InVars {main_~x~0=v_main_~x~0_2094} OutVars{main_~x~0=v_main_~x~0_2094} AuxVars[] AssignedVars[] [2021-05-03 00:16:56,285 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:16:56,293 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,299 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:56,307 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:16:56,320 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:56,322 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2096 50000) InVars {main_~x~0=v_main_~x~0_2096} OutVars{main_~x~0=v_main_~x~0_2096} AuxVars[] AssignedVars[] [2021-05-03 00:16:56,323 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:16:56,332 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,337 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:56,362 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:16:56,377 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2098) (< v_main_~x~0_2098 1000000)) InVars {main_~x~0=v_main_~x~0_2098} OutVars{main_~x~0=v_main_~x~0_2098} AuxVars[] AssignedVars[] [2021-05-03 00:16:56,379 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:16:56,399 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,401 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:56,413 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:56,415 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:56,433 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:16:56,456 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:57,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:57,705 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:57,706 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:57,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:01,922 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:01,922 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2059071975] [2021-05-03 00:17:01,922 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2059071975] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:01,922 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:01,922 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [129] imperfect sequences [] total 129 [2021-05-03 00:17:01,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009151231] [2021-05-03 00:17:01,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2021-05-03 00:17:01,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:01,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2021-05-03 00:17:01,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5049, Invalid=11463, Unknown=0, NotChecked=0, Total=16512 [2021-05-03 00:17:01,924 INFO L87 Difference]: Start difference. First operand 228 states and 231 transitions. Second operand has 129 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 128 states have internal predecessors, (212), 2 states have call successors, (3), 3 states have call 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:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:20,441 INFO L93 Difference]: Finished difference Result 441 states and 452 transitions. [2021-05-03 00:17:20,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2021-05-03 00:17:20,442 INFO L78 Accepts]: Start accepts. Automaton has has 129 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 128 states have internal predecessors, (212), 2 states have call successors, (3), 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 227 [2021-05-03 00:17:20,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:20,443 INFO L225 Difference]: With dead ends: 441 [2021-05-03 00:17:20,443 INFO L226 Difference]: Without dead ends: 233 [2021-05-03 00:17:20,446 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18844 ImplicationChecksByTransitivity, 16132.4ms TimeCoverageRelationStatistics Valid=15141, Invalid=49629, Unknown=0, NotChecked=0, Total=64770 [2021-05-03 00:17:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-05-03 00:17:20,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-05-03 00:17:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 228 states have (on average 1.0175438596491229) internal successors, (232), 228 states have internal predecessors, (232), 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:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 236 transitions. [2021-05-03 00:17:20,458 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 236 transitions. Word has length 227 [2021-05-03 00:17:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:20,458 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 236 transitions. [2021-05-03 00:17:20,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 129 states, 129 states have (on average 1.6434108527131783) internal successors, (212), 128 states have internal predecessors, (212), 2 states have call successors, (3), 3 states have call 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:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 236 transitions. [2021-05-03 00:17:20,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-05-03 00:17:20,459 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:20,459 INFO L523 BasicCegarLoop]: trace histogram [87, 80, 46, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:20,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2021-05-03 00:17:20,459 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:20,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:20,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2125840324, now seen corresponding path program 46 times [2021-05-03 00:17:20,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:20,460 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [94205894] [2021-05-03 00:17:20,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:20,471 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2187) (< v_main_~x~0_2187 999999)) InVars {main_~x~0=v_main_~x~0_2187} OutVars{main_~x~0=v_main_~x~0_2187} AuxVars[] AssignedVars[] [2021-05-03 00:17:20,473 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:17:20,495 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,497 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,509 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:20,512 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:20,528 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:17:20,552 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2189 50000) (< v_main_~x~0_2189 999999)) InVars {main_~x~0=v_main_~x~0_2189} OutVars{main_~x~0=v_main_~x~0_2189} AuxVars[] AssignedVars[] [2021-05-03 00:17:20,553 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:17:20,561 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,566 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:20,574 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:17:20,587 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:20,588 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2191 50000) InVars {main_~x~0=v_main_~x~0_2191} OutVars{main_~x~0=v_main_~x~0_2191} AuxVars[] AssignedVars[] [2021-05-03 00:17:20,590 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:17:20,598 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,603 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:20,611 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:17:20,627 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2193 1000000) (<= 50000 v_main_~x~0_2193)) InVars {main_~x~0=v_main_~x~0_2193} OutVars{main_~x~0=v_main_~x~0_2193} AuxVars[] AssignedVars[] [2021-05-03 00:17:20,640 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:17:20,666 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,667 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:20,677 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:20,680 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:20,698 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:17:20,721 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:22,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:22,018 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:22,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:22,025 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:26,901 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:26,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [94205894] [2021-05-03 00:17:26,902 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [94205894] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:26,902 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:26,902 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [132] imperfect sequences [] total 132 [2021-05-03 00:17:26,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167964036] [2021-05-03 00:17:26,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 132 states [2021-05-03 00:17:26,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2021-05-03 00:17:26,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5277, Invalid=12015, Unknown=0, NotChecked=0, Total=17292 [2021-05-03 00:17:26,904 INFO L87 Difference]: Start difference. First operand 233 states and 236 transitions. Second operand has 132 states, 132 states have (on average 1.643939393939394) internal successors, (217), 131 states have internal predecessors, (217), 2 states have call successors, (3), 3 states have call 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:47,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:47,914 INFO L93 Difference]: Finished difference Result 451 states and 462 transitions. [2021-05-03 00:17:47,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-05-03 00:17:47,915 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.643939393939394) internal successors, (217), 131 states have internal predecessors, (217), 2 states have call successors, (3), 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 232 [2021-05-03 00:17:47,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:47,916 INFO L225 Difference]: With dead ends: 451 [2021-05-03 00:17:47,916 INFO L226 Difference]: Without dead ends: 238 [2021-05-03 00:17:47,919 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19745 ImplicationChecksByTransitivity, 18460.2ms TimeCoverageRelationStatistics Valid=15825, Invalid=52035, Unknown=0, NotChecked=0, Total=67860 [2021-05-03 00:17:47,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-05-03 00:17:47,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2021-05-03 00:17:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 233 states have (on average 1.0171673819742488) internal successors, (237), 233 states have internal predecessors, (237), 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:47,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 241 transitions. [2021-05-03 00:17:47,932 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 241 transitions. Word has length 232 [2021-05-03 00:17:47,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:47,932 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 241 transitions. [2021-05-03 00:17:47,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 132 states, 132 states have (on average 1.643939393939394) internal successors, (217), 131 states have internal predecessors, (217), 2 states have call successors, (3), 3 states have call 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:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 241 transitions. [2021-05-03 00:17:47,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2021-05-03 00:17:47,933 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:47,933 INFO L523 BasicCegarLoop]: trace histogram [89, 82, 47, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:47,934 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-05-03 00:17:47,934 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:47,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:47,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1388120605, now seen corresponding path program 47 times [2021-05-03 00:17:47,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:47,934 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [811158317] [2021-05-03 00:17:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:47,943 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2284) (< v_main_~x~0_2284 999999)) InVars {main_~x~0=v_main_~x~0_2284} OutVars{main_~x~0=v_main_~x~0_2284} AuxVars[] AssignedVars[] [2021-05-03 00:17:47,945 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:17:47,970 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:47,972 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:47,986 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:47,989 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:48,009 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:17:48,040 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2286 50000) (< v_main_~x~0_2286 999999)) InVars {main_~x~0=v_main_~x~0_2286} OutVars{main_~x~0=v_main_~x~0_2286} AuxVars[] AssignedVars[] [2021-05-03 00:17:48,042 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:17:48,052 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:48,058 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:48,067 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:17:48,082 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:48,084 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2288 50000) InVars {main_~x~0=v_main_~x~0_2288} OutVars{main_~x~0=v_main_~x~0_2288} AuxVars[] AssignedVars[] [2021-05-03 00:17:48,086 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:17:48,086 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:48,093 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:48,113 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:17:48,134 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2290 1000000) (<= 50000 v_main_~x~0_2290)) InVars {main_~x~0=v_main_~x~0_2290} OutVars{main_~x~0=v_main_~x~0_2290} AuxVars[] AssignedVars[] [2021-05-03 00:17:48,136 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:17:48,137 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:48,140 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:48,158 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:48,161 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:48,201 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:17:48,230 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:49,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:49,924 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:49,925 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:49,928 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:55,573 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:55,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [811158317] [2021-05-03 00:17:55,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [811158317] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:55,574 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:55,574 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [135] imperfect sequences [] total 135 [2021-05-03 00:17:55,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639957943] [2021-05-03 00:17:55,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2021-05-03 00:17:55,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:55,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2021-05-03 00:17:55,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5510, Invalid=12580, Unknown=0, NotChecked=0, Total=18090 [2021-05-03 00:17:55,576 INFO L87 Difference]: Start difference. First operand 238 states and 241 transitions. Second operand has 135 states, 135 states have (on average 1.6444444444444444) internal successors, (222), 134 states have internal predecessors, (222), 2 states have call successors, (3), 3 states have call 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,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:20,256 INFO L93 Difference]: Finished difference Result 461 states and 472 transitions. [2021-05-03 00:18:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2021-05-03 00:18:20,258 INFO L78 Accepts]: Start accepts. Automaton has has 135 states, 135 states have (on average 1.6444444444444444) internal successors, (222), 134 states have internal predecessors, (222), 2 states have call successors, (3), 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 237 [2021-05-03 00:18:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:20,259 INFO L225 Difference]: With dead ends: 461 [2021-05-03 00:18:20,259 INFO L226 Difference]: Without dead ends: 243 [2021-05-03 00:18:20,262 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20620 ImplicationChecksByTransitivity, 21499.0ms TimeCoverageRelationStatistics Valid=16524, Invalid=54498, Unknown=0, NotChecked=0, Total=71022 [2021-05-03 00:18:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-05-03 00:18:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2021-05-03 00:18:20,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 238 states have (on average 1.0168067226890756) internal successors, (242), 238 states have internal predecessors, (242), 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,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 246 transitions. [2021-05-03 00:18:20,275 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 246 transitions. Word has length 237 [2021-05-03 00:18:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:20,275 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 246 transitions. [2021-05-03 00:18:20,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 135 states, 135 states have (on average 1.6444444444444444) internal successors, (222), 134 states have internal predecessors, (222), 2 states have call successors, (3), 3 states have call 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,276 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 246 transitions. [2021-05-03 00:18:20,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2021-05-03 00:18:20,276 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:20,277 INFO L523 BasicCegarLoop]: trace histogram [91, 84, 48, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:20,277 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2021-05-03 00:18:20,277 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:20,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:20,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1350256848, now seen corresponding path program 48 times [2021-05-03 00:18:20,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:20,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [238469692] [2021-05-03 00:18:20,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:20,286 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2383 999999) (<= 50000 v_main_~x~0_2383)) InVars {main_~x~0=v_main_~x~0_2383} OutVars{main_~x~0=v_main_~x~0_2383} AuxVars[] AssignedVars[] [2021-05-03 00:18:20,288 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:18:20,289 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,292 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,307 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:20,310 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:20,349 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:18:20,381 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2385 50000) (< v_main_~x~0_2385 999999)) InVars {main_~x~0=v_main_~x~0_2385} OutVars{main_~x~0=v_main_~x~0_2385} AuxVars[] AssignedVars[] [2021-05-03 00:18:20,383 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:18:20,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,391 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:20,414 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:18:20,434 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:20,436 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2387 50000) InVars {main_~x~0=v_main_~x~0_2387} OutVars{main_~x~0=v_main_~x~0_2387} AuxVars[] AssignedVars[] [2021-05-03 00:18:20,440 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:18:20,453 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,459 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:20,474 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:18:20,498 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2389) (< v_main_~x~0_2389 1000000)) InVars {main_~x~0=v_main_~x~0_2389} OutVars{main_~x~0=v_main_~x~0_2389} AuxVars[] AssignedVars[] [2021-05-03 00:18:20,500 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:18:20,529 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,531 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:20,546 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:20,549 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:20,566 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:18:20,597 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:22,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:22,442 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:22,444 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:22,447 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:29,434 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:29,435 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [238469692] [2021-05-03 00:18:29,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [238469692] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:29,435 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:29,435 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [138] imperfect sequences [] total 138 [2021-05-03 00:18:29,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041271376] [2021-05-03 00:18:29,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 138 states [2021-05-03 00:18:29,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:29,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2021-05-03 00:18:29,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5748, Invalid=13158, Unknown=0, NotChecked=0, Total=18906 [2021-05-03 00:18:29,437 INFO L87 Difference]: Start difference. First operand 243 states and 246 transitions. Second operand has 138 states, 138 states have (on average 1.644927536231884) internal successors, (227), 137 states have internal predecessors, (227), 2 states have call successors, (3), 3 states have call 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:57,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:57,801 INFO L93 Difference]: Finished difference Result 471 states and 482 transitions. [2021-05-03 00:18:57,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2021-05-03 00:18:57,802 INFO L78 Accepts]: Start accepts. Automaton has has 138 states, 138 states have (on average 1.644927536231884) internal successors, (227), 137 states have internal predecessors, (227), 2 states have call successors, (3), 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 242 [2021-05-03 00:18:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:57,803 INFO L225 Difference]: With dead ends: 471 [2021-05-03 00:18:57,803 INFO L226 Difference]: Without dead ends: 248 [2021-05-03 00:18:57,806 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21562 ImplicationChecksByTransitivity, 24673.8ms TimeCoverageRelationStatistics Valid=17238, Invalid=57018, Unknown=0, NotChecked=0, Total=74256 [2021-05-03 00:18:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-05-03 00:18:57,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2021-05-03 00:18:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 243 states have (on average 1.0164609053497942) internal successors, (247), 243 states have internal predecessors, (247), 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:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 251 transitions. [2021-05-03 00:18:57,820 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 251 transitions. Word has length 242 [2021-05-03 00:18:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:57,820 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 251 transitions. [2021-05-03 00:18:57,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 138 states, 138 states have (on average 1.644927536231884) internal successors, (227), 137 states have internal predecessors, (227), 2 states have call successors, (3), 3 states have call 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:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 251 transitions. [2021-05-03 00:18:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2021-05-03 00:18:57,821 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:57,821 INFO L523 BasicCegarLoop]: trace histogram [93, 86, 49, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:57,821 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-05-03 00:18:57,821 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:57,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:57,822 INFO L82 PathProgramCache]: Analyzing trace with hash 323556905, now seen corresponding path program 49 times [2021-05-03 00:18:57,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:57,822 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [142273719] [2021-05-03 00:18:57,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:57,831 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2484) (< v_main_~x~0_2484 999999)) InVars {main_~x~0=v_main_~x~0_2484} OutVars{main_~x~0=v_main_~x~0_2484} AuxVars[] AssignedVars[] [2021-05-03 00:18:57,832 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:18:57,834 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,836 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,852 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:57,856 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:57,901 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:18:57,935 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2486 999999) (< v_main_~x~0_2486 50000)) InVars {main_~x~0=v_main_~x~0_2486} OutVars{main_~x~0=v_main_~x~0_2486} AuxVars[] AssignedVars[] [2021-05-03 00:18:57,937 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:18:57,948 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,955 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:57,966 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:18:57,987 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:57,989 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2488 50000) InVars {main_~x~0=v_main_~x~0_2488} OutVars{main_~x~0=v_main_~x~0_2488} AuxVars[] AssignedVars[] [2021-05-03 00:18:57,990 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:18:57,991 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:57,999 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:58,022 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:18:58,046 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2490 1000000) (<= 50000 v_main_~x~0_2490)) InVars {main_~x~0=v_main_~x~0_2490} OutVars{main_~x~0=v_main_~x~0_2490} AuxVars[] AssignedVars[] [2021-05-03 00:18:58,048 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:18:58,073 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:58,076 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:58,088 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:58,092 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:58,116 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:18:58,153 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:00,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:00,087 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:00,088 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:00,091 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:07,743 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:07,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [142273719] [2021-05-03 00:19:07,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [142273719] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:07,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:07,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [141] imperfect sequences [] total 141 [2021-05-03 00:19:07,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648385433] [2021-05-03 00:19:07,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2021-05-03 00:19:07,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:07,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2021-05-03 00:19:07,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5991, Invalid=13749, Unknown=0, NotChecked=0, Total=19740 [2021-05-03 00:19:07,745 INFO L87 Difference]: Start difference. First operand 248 states and 251 transitions. Second operand has 141 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 140 states have internal predecessors, (232), 2 states have call successors, (3), 3 states have call 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:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:41,963 INFO L93 Difference]: Finished difference Result 481 states and 492 transitions. [2021-05-03 00:19:41,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2021-05-03 00:19:41,965 INFO L78 Accepts]: Start accepts. Automaton has has 141 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 140 states have internal predecessors, (232), 2 states have call successors, (3), 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 247 [2021-05-03 00:19:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:41,966 INFO L225 Difference]: With dead ends: 481 [2021-05-03 00:19:41,966 INFO L226 Difference]: Without dead ends: 253 [2021-05-03 00:19:41,970 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22574 ImplicationChecksByTransitivity, 28141.8ms TimeCoverageRelationStatistics Valid=17967, Invalid=59595, Unknown=0, NotChecked=0, Total=77562 [2021-05-03 00:19:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-05-03 00:19:41,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2021-05-03 00:19:41,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 248 states have (on average 1.0161290322580645) internal successors, (252), 248 states have internal predecessors, (252), 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:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 256 transitions. [2021-05-03 00:19:41,984 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 256 transitions. Word has length 247 [2021-05-03 00:19:41,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:41,984 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 256 transitions. [2021-05-03 00:19:41,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 141 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 140 states have internal predecessors, (232), 2 states have call successors, (3), 3 states have call 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:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 256 transitions. [2021-05-03 00:19:41,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2021-05-03 00:19:41,985 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:41,985 INFO L523 BasicCegarLoop]: trace histogram [95, 88, 50, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:41,985 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-05-03 00:19:41,986 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:41,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:41,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1600825308, now seen corresponding path program 50 times [2021-05-03 00:19:41,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:41,986 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1849075622] [2021-05-03 00:19:41,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:41,996 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2587) (< v_main_~x~0_2587 999999)) InVars {main_~x~0=v_main_~x~0_2587} OutVars{main_~x~0=v_main_~x~0_2587} AuxVars[] AssignedVars[] [2021-05-03 00:19:41,998 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:19:42,029 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:42,032 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:42,047 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:42,051 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:42,078 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:19:42,123 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2589 999999) (< v_main_~x~0_2589 50000)) InVars {main_~x~0=v_main_~x~0_2589} OutVars{main_~x~0=v_main_~x~0_2589} AuxVars[] AssignedVars[] [2021-05-03 00:19:42,125 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:19:42,126 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:42,143 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:19:42,165 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:19:42,188 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:42,190 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2591 50000) InVars {main_~x~0=v_main_~x~0_2591} OutVars{main_~x~0=v_main_~x~0_2591} AuxVars[] AssignedVars[] [2021-05-03 00:19:42,192 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:19:42,205 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:42,214 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:19:42,231 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:19:42,260 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2593 1000000) (<= 50000 v_main_~x~0_2593)) InVars {main_~x~0=v_main_~x~0_2593} OutVars{main_~x~0=v_main_~x~0_2593} AuxVars[] AssignedVars[] [2021-05-03 00:19:42,264 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:19:42,265 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:42,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:42,286 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:42,290 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:42,337 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:19:42,376 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:44,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:44,609 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:44,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:44,615 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:54,311 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:19:54,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1849075622] [2021-05-03 00:19:54,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1849075622] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:19:54,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:19:54,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [144] imperfect sequences [] total 144 [2021-05-03 00:19:54,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507660155] [2021-05-03 00:19:54,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 144 states [2021-05-03 00:19:54,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:19:54,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2021-05-03 00:19:54,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6239, Invalid=14353, Unknown=0, NotChecked=0, Total=20592 [2021-05-03 00:19:54,315 INFO L87 Difference]: Start difference. First operand 253 states and 256 transitions. Second operand has 144 states, 144 states have (on average 1.6458333333333333) internal successors, (237), 143 states have internal predecessors, (237), 2 states have call successors, (3), 3 states have call 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:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:20:36,354 INFO L93 Difference]: Finished difference Result 491 states and 502 transitions. [2021-05-03 00:20:36,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2021-05-03 00:20:36,358 INFO L78 Accepts]: Start accepts. Automaton has has 144 states, 144 states have (on average 1.6458333333333333) internal successors, (237), 143 states have internal predecessors, (237), 2 states have call successors, (3), 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 252 [2021-05-03 00:20:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:20:36,360 INFO L225 Difference]: With dead ends: 491 [2021-05-03 00:20:36,360 INFO L226 Difference]: Without dead ends: 258 [2021-05-03 00:20:36,363 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23559 ImplicationChecksByTransitivity, 33883.0ms TimeCoverageRelationStatistics Valid=18711, Invalid=62229, Unknown=0, NotChecked=0, Total=80940 [2021-05-03 00:20:36,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-05-03 00:20:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2021-05-03 00:20:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 253 states have (on average 1.0158102766798418) internal successors, (257), 253 states have internal predecessors, (257), 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:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 261 transitions. [2021-05-03 00:20:36,377 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 261 transitions. Word has length 252 [2021-05-03 00:20:36,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:20:36,377 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 261 transitions. [2021-05-03 00:20:36,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 144 states, 144 states have (on average 1.6458333333333333) internal successors, (237), 143 states have internal predecessors, (237), 2 states have call successors, (3), 3 states have call 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:36,377 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 261 transitions. [2021-05-03 00:20:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2021-05-03 00:20:36,378 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:20:36,378 INFO L523 BasicCegarLoop]: trace histogram [97, 90, 51, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:20:36,378 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-05-03 00:20:36,378 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:20:36,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:20:36,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1210017739, now seen corresponding path program 51 times [2021-05-03 00:20:36,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:20:36,379 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [622360526] [2021-05-03 00:20:36,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:20:36,388 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2692) (< v_main_~x~0_2692 999999)) InVars {main_~x~0=v_main_~x~0_2692} OutVars{main_~x~0=v_main_~x~0_2692} AuxVars[] AssignedVars[] [2021-05-03 00:20:36,391 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:20:36,392 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:36,397 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:36,418 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:36,422 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:36,480 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:20:36,550 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2694 50000) (< v_main_~x~0_2694 999999)) InVars {main_~x~0=v_main_~x~0_2694} OutVars{main_~x~0=v_main_~x~0_2694} AuxVars[] AssignedVars[] [2021-05-03 00:20:36,552 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:20:36,569 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:36,577 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:20:36,591 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:20:36,615 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:36,617 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2696 50000) InVars {main_~x~0=v_main_~x~0_2696} OutVars{main_~x~0=v_main_~x~0_2696} AuxVars[] AssignedVars[] [2021-05-03 00:20:36,619 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:20:36,620 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:36,628 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:20:36,660 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:20:36,693 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2698) (< v_main_~x~0_2698 1000000)) InVars {main_~x~0=v_main_~x~0_2698} OutVars{main_~x~0=v_main_~x~0_2698} AuxVars[] AssignedVars[] [2021-05-03 00:20:36,695 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:20:36,729 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:36,732 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:20:36,749 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:20:36,753 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:20:36,788 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:20:36,839 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:20:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:39,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:20:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:20:39,306 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:39,307 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:39,310 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:50,168 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:50,168 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [622360526] [2021-05-03 00:20:50,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [622360526] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:50,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:50,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [147] imperfect sequences [] total 147 [2021-05-03 00:20:50,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643572981] [2021-05-03 00:20:50,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2021-05-03 00:20:50,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:50,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2021-05-03 00:20:50,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6492, Invalid=14970, Unknown=0, NotChecked=0, Total=21462 [2021-05-03 00:20:50,171 INFO L87 Difference]: Start difference. First operand 258 states and 261 transitions. Second operand has 147 states, 147 states have (on average 1.6462585034013606) internal successors, (242), 146 states have internal predecessors, (242), 2 states have call successors, (3), 3 states have call 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:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:36,259 INFO L93 Difference]: Finished difference Result 501 states and 512 transitions. [2021-05-03 00:21:36,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2021-05-03 00:21:36,262 INFO L78 Accepts]: Start accepts. Automaton has has 147 states, 147 states have (on average 1.6462585034013606) internal successors, (242), 146 states have internal predecessors, (242), 2 states have call successors, (3), 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 257 [2021-05-03 00:21:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:36,263 INFO L225 Difference]: With dead ends: 501 [2021-05-03 00:21:36,263 INFO L226 Difference]: Without dead ends: 263 [2021-05-03 00:21:36,267 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24565 ImplicationChecksByTransitivity, 36891.0ms TimeCoverageRelationStatistics Valid=19470, Invalid=64920, Unknown=0, NotChecked=0, Total=84390 [2021-05-03 00:21:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-05-03 00:21:36,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2021-05-03 00:21:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.0155038759689923) internal successors, (262), 258 states have internal predecessors, (262), 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:36,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 266 transitions. [2021-05-03 00:21:36,281 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 266 transitions. Word has length 257 [2021-05-03 00:21:36,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:36,282 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 266 transitions. [2021-05-03 00:21:36,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 147 states, 147 states have (on average 1.6462585034013606) internal successors, (242), 146 states have internal predecessors, (242), 2 states have call successors, (3), 3 states have call 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:36,282 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 266 transitions. [2021-05-03 00:21:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2021-05-03 00:21:36,283 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:36,283 INFO L523 BasicCegarLoop]: trace histogram [99, 92, 52, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:36,283 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-05-03 00:21:36,283 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:36,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:36,284 INFO L82 PathProgramCache]: Analyzing trace with hash -441916648, now seen corresponding path program 52 times [2021-05-03 00:21:36,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:36,284 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1113111109] [2021-05-03 00:21:36,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:36,295 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2799 999999) (<= 50000 v_main_~x~0_2799)) InVars {main_~x~0=v_main_~x~0_2799} OutVars{main_~x~0=v_main_~x~0_2799} AuxVars[] AssignedVars[] [2021-05-03 00:21:36,297 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:21:36,299 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:36,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:36,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:36,328 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:36,394 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:21:36,452 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2801 50000) (< v_main_~x~0_2801 999999)) InVars {main_~x~0=v_main_~x~0_2801} OutVars{main_~x~0=v_main_~x~0_2801} AuxVars[] AssignedVars[] [2021-05-03 00:21:36,454 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:21:36,471 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:36,482 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:21:36,499 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:21:36,531 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:36,535 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2803 50000) InVars {main_~x~0=v_main_~x~0_2803} OutVars{main_~x~0=v_main_~x~0_2803} AuxVars[] AssignedVars[] [2021-05-03 00:21:36,536 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:21:36,553 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:36,563 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:21:36,579 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:21:36,623 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2805 1000000) (<= 50000 v_main_~x~0_2805)) InVars {main_~x~0=v_main_~x~0_2805} OutVars{main_~x~0=v_main_~x~0_2805} AuxVars[] AssignedVars[] [2021-05-03 00:21:36,625 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:21:36,666 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:36,669 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:36,691 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:36,696 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:36,745 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:21:36,799 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:40,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:40,128 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:40,129 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:40,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:51,691 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:51,692 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1113111109] [2021-05-03 00:21:51,692 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1113111109] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:51,692 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:51,692 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [150] imperfect sequences [] total 150 [2021-05-03 00:21:51,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175660338] [2021-05-03 00:21:51,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 150 states [2021-05-03 00:21:51,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:51,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2021-05-03 00:21:51,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6750, Invalid=15600, Unknown=0, NotChecked=0, Total=22350 [2021-05-03 00:21:51,694 INFO L87 Difference]: Start difference. First operand 263 states and 266 transitions. Second operand has 150 states, 150 states have (on average 1.6466666666666667) internal successors, (247), 149 states have internal predecessors, (247), 2 states have call successors, (3), 3 states have call 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:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:22:40,148 INFO L93 Difference]: Finished difference Result 511 states and 522 transitions. [2021-05-03 00:22:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2021-05-03 00:22:40,151 INFO L78 Accepts]: Start accepts. Automaton has has 150 states, 150 states have (on average 1.6466666666666667) internal successors, (247), 149 states have internal predecessors, (247), 2 states have call successors, (3), 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 262 [2021-05-03 00:22:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:22:40,152 INFO L225 Difference]: With dead ends: 511 [2021-05-03 00:22:40,152 INFO L226 Difference]: Without dead ends: 268 [2021-05-03 00:22:40,156 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25592 ImplicationChecksByTransitivity, 39805.8ms TimeCoverageRelationStatistics Valid=20244, Invalid=67668, Unknown=0, NotChecked=0, Total=87912 [2021-05-03 00:22:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-05-03 00:22:40,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2021-05-03 00:22:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.015209125475285) internal successors, (267), 263 states have internal predecessors, (267), 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:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2021-05-03 00:22:40,170 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 262 [2021-05-03 00:22:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:22:40,170 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2021-05-03 00:22:40,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 150 states, 150 states have (on average 1.6466666666666667) internal successors, (247), 149 states have internal predecessors, (247), 2 states have call successors, (3), 3 states have call 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:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2021-05-03 00:22:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2021-05-03 00:22:40,171 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:22:40,171 INFO L523 BasicCegarLoop]: trace histogram [101, 94, 53, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:22:40,171 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2021-05-03 00:22:40,171 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:22:40,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:22:40,172 INFO L82 PathProgramCache]: Analyzing trace with hash 620154945, now seen corresponding path program 53 times [2021-05-03 00:22:40,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:22:40,172 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064538914] [2021-05-03 00:22:40,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:22:40,184 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2908) (< v_main_~x~0_2908 999999)) InVars {main_~x~0=v_main_~x~0_2908} OutVars{main_~x~0=v_main_~x~0_2908} AuxVars[] AssignedVars[] [2021-05-03 00:22:40,186 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:22:40,225 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:40,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:40,246 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:40,251 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:40,284 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:22:40,347 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2910 50000) (< v_main_~x~0_2910 999999)) InVars {main_~x~0=v_main_~x~0_2910} OutVars{main_~x~0=v_main_~x~0_2910} AuxVars[] AssignedVars[] [2021-05-03 00:22:40,349 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:22:40,350 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:40,361 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:22:40,393 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:22:40,426 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:40,430 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2912 50000) InVars {main_~x~0=v_main_~x~0_2912} OutVars{main_~x~0=v_main_~x~0_2912} AuxVars[] AssignedVars[] [2021-05-03 00:22:40,431 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:22:40,448 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:40,459 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:22:40,474 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:22:40,512 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_2914) (< v_main_~x~0_2914 1000000)) InVars {main_~x~0=v_main_~x~0_2914} OutVars{main_~x~0=v_main_~x~0_2914} AuxVars[] AssignedVars[] [2021-05-03 00:22:40,515 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:22:40,548 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:40,550 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:22:40,574 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:22:40,579 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:22:40,617 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:22:40,673 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:22:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:43,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:22:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:22:43,598 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:43,600 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:43,604 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:22:56,659 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:22:56,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064538914] [2021-05-03 00:22:56,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1064538914] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:22:56,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:22:56,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [153] imperfect sequences [] total 153 [2021-05-03 00:22:56,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777275442] [2021-05-03 00:22:56,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 153 states [2021-05-03 00:22:56,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:22:56,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2021-05-03 00:22:56,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7013, Invalid=16243, Unknown=0, NotChecked=0, Total=23256 [2021-05-03 00:22:56,662 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand has 153 states, 153 states have (on average 1.6470588235294117) internal successors, (252), 152 states have internal predecessors, (252), 2 states have call successors, (3), 3 states have call 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:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:23:49,923 INFO L93 Difference]: Finished difference Result 521 states and 532 transitions. [2021-05-03 00:23:49,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2021-05-03 00:23:49,925 INFO L78 Accepts]: Start accepts. Automaton has has 153 states, 153 states have (on average 1.6470588235294117) internal successors, (252), 152 states have internal predecessors, (252), 2 states have call successors, (3), 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 267 [2021-05-03 00:23:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:23:49,926 INFO L225 Difference]: With dead ends: 521 [2021-05-03 00:23:49,927 INFO L226 Difference]: Without dead ends: 273 [2021-05-03 00:23:49,931 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26640 ImplicationChecksByTransitivity, 43962.1ms TimeCoverageRelationStatistics Valid=21033, Invalid=70473, Unknown=0, NotChecked=0, Total=91506 [2021-05-03 00:23:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-05-03 00:23:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-05-03 00:23:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.0149253731343284) internal successors, (272), 268 states have internal predecessors, (272), 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:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 276 transitions. [2021-05-03 00:23:49,946 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 276 transitions. Word has length 267 [2021-05-03 00:23:49,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:23:49,946 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 276 transitions. [2021-05-03 00:23:49,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 153 states, 153 states have (on average 1.6470588235294117) internal successors, (252), 152 states have internal predecessors, (252), 2 states have call successors, (3), 3 states have call 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:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 276 transitions. [2021-05-03 00:23:49,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2021-05-03 00:23:49,947 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:23:49,947 INFO L523 BasicCegarLoop]: trace histogram [103, 96, 54, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:23:49,947 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2021-05-03 00:23:49,947 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:23:49,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:23:49,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1649666036, now seen corresponding path program 54 times [2021-05-03 00:23:49,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:23:49,948 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1246244805] [2021-05-03 00:23:49,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:23:49,960 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3019 999999) (<= 50000 v_main_~x~0_3019)) InVars {main_~x~0=v_main_~x~0_3019} OutVars{main_~x~0=v_main_~x~0_3019} AuxVars[] AssignedVars[] [2021-05-03 00:23:49,963 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:23:49,964 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:49,967 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:49,986 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:49,991 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:50,059 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:23:50,118 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3021 999999) (< v_main_~x~0_3021 50000)) InVars {main_~x~0=v_main_~x~0_3021} OutVars{main_~x~0=v_main_~x~0_3021} AuxVars[] AssignedVars[] [2021-05-03 00:23:50,120 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:23:50,121 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:50,133 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:23:50,179 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:23:50,222 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:50,226 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3023 50000) InVars {main_~x~0=v_main_~x~0_3023} OutVars{main_~x~0=v_main_~x~0_3023} AuxVars[] AssignedVars[] [2021-05-03 00:23:50,228 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:23:50,229 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:50,241 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:23:50,275 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:23:50,314 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3025 1000000) (<= 50000 v_main_~x~0_3025)) InVars {main_~x~0=v_main_~x~0_3025} OutVars{main_~x~0=v_main_~x~0_3025} AuxVars[] AssignedVars[] [2021-05-03 00:23:50,317 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:23:50,361 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:50,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:23:50,389 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:23:50,394 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:23:50,440 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:23:50,514 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:23:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:54,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:23:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:23:54,196 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:54,198 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:23:54,202 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:24:09,692 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:24:09,693 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1246244805] [2021-05-03 00:24:09,693 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1246244805] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:24:09,693 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:24:09,693 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [156] imperfect sequences [] total 156 [2021-05-03 00:24:09,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210445040] [2021-05-03 00:24:09,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 156 states [2021-05-03 00:24:09,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:24:09,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2021-05-03 00:24:09,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7281, Invalid=16899, Unknown=0, NotChecked=0, Total=24180 [2021-05-03 00:24:09,695 INFO L87 Difference]: Start difference. First operand 273 states and 276 transitions. Second operand has 156 states, 156 states have (on average 1.6474358974358974) internal successors, (257), 155 states have internal predecessors, (257), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:25:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:25:15,451 INFO L93 Difference]: Finished difference Result 531 states and 542 transitions. [2021-05-03 00:25:15,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2021-05-03 00:25:15,456 INFO L78 Accepts]: Start accepts. Automaton has has 156 states, 156 states have (on average 1.6474358974358974) internal successors, (257), 155 states have internal predecessors, (257), 2 states have call successors, (3), 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 272 [2021-05-03 00:25:15,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:25:15,457 INFO L225 Difference]: With dead ends: 531 [2021-05-03 00:25:15,457 INFO L226 Difference]: Without dead ends: 278 [2021-05-03 00:25:15,462 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27709 ImplicationChecksByTransitivity, 53056.1ms TimeCoverageRelationStatistics Valid=21837, Invalid=73335, Unknown=0, NotChecked=0, Total=95172 [2021-05-03 00:25:15,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-05-03 00:25:15,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2021-05-03 00:25:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 273 states have (on average 1.0146520146520146) internal successors, (277), 273 states have internal predecessors, (277), 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:25:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2021-05-03 00:25:15,493 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 272 [2021-05-03 00:25:15,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:25:15,493 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2021-05-03 00:25:15,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 156 states, 156 states have (on average 1.6474358974358974) internal successors, (257), 155 states have internal predecessors, (257), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:25:15,494 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2021-05-03 00:25:15,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2021-05-03 00:25:15,495 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:25:15,495 INFO L523 BasicCegarLoop]: trace histogram [105, 98, 55, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:25:15,495 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2021-05-03 00:25:15,495 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:25:15,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:25:15,495 INFO L82 PathProgramCache]: Analyzing trace with hash -12648883, now seen corresponding path program 55 times [2021-05-03 00:25:15,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:25:15,496 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1960808133] [2021-05-03 00:25:15,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:25:15,514 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 50000 v_main_~x~0_3132) (< v_main_~x~0_3132 999999)) InVars {main_~x~0=v_main_~x~0_3132} OutVars{main_~x~0=v_main_~x~0_3132} AuxVars[] AssignedVars[] [2021-05-03 00:25:15,517 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:25:15,564 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:15,567 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:15,593 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:15,599 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:15,641 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:25:15,705 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3134 999999) (< v_main_~x~0_3134 50000)) InVars {main_~x~0=v_main_~x~0_3134} OutVars{main_~x~0=v_main_~x~0_3134} AuxVars[] AssignedVars[] [2021-05-03 00:25:15,707 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:25:15,708 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:15,724 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:25:15,762 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:25:15,804 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:15,808 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3136 50000) InVars {main_~x~0=v_main_~x~0_3136} OutVars{main_~x~0=v_main_~x~0_3136} AuxVars[] AssignedVars[] [2021-05-03 00:25:15,814 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:25:15,835 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:15,849 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:25:15,865 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:25:15,911 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3138 1000000) (<= 50000 v_main_~x~0_3138)) InVars {main_~x~0=v_main_~x~0_3138} OutVars{main_~x~0=v_main_~x~0_3138} AuxVars[] AssignedVars[] [2021-05-03 00:25:15,913 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:25:15,958 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:15,966 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:25:15,988 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:25:15,994 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:25:16,048 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:25:16,130 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:25:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:19,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:25:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:25:19,102 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:25:19,104 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:25:19,107 WARN L159 QuantifierPusher]: Ignoring assumption.