/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_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:09:28,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:09:28,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:09:28,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:09:28,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:09:28,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:09:28,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:09:28,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:09:28,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:09:28,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:09:28,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:09:28,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:09:28,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:09:28,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:09:28,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:09:28,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:09:28,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:09:28,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:09:28,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:09:28,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:09:28,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:09:28,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:09:28,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:09:28,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:09:28,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:09:28,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:09:28,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:09:28,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:09:28,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:09:28,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:09:28,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:09:28,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:09:28,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:09:28,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:09:28,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:09:28,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:09:28,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:09:28,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:09:28,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:09:28,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:09:28,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:09:28,389 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:09:28,403 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:09:28,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:09:28,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:09:28,407 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:09:28,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:09:28,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:09:28,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:09:28,408 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:09:28,408 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:09:28,408 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:09:28,409 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:09:28,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:09:28,410 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:09:28,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:09:28,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:09:28,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:09:28,410 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:09:28,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:09:28,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:09:28,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:09:28,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:09:28,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:09:28,411 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:09:28,411 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:09:28,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:09:28,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:09:28,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:09:28,785 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:09:28,785 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:09:28,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_3.c [2021-05-03 00:09:28,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf41ab5b/1de3ae6fa5d44b958a89dd5e27e75bff/FLAGf803157ae [2021-05-03 00:09:29,358 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:09:29,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_3.c [2021-05-03 00:09:29,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf41ab5b/1de3ae6fa5d44b958a89dd5e27e75bff/FLAGf803157ae [2021-05-03 00:09:29,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbf41ab5b/1de3ae6fa5d44b958a89dd5e27e75bff [2021-05-03 00:09:29,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:09:29,862 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:09:29,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:09:29,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:09:29,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:09:29,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:09:29" (1/1) ... [2021-05-03 00:09:29,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a9b0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:09:29, skipping insertion in model container [2021-05-03 00:09:29,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:09:29" (1/1) ... [2021-05-03 00:09:29,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:09:29,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:09:30,016 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_3.c[318,331] [2021-05-03 00:09:30,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:09:30,040 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:09:30,050 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_3.c[318,331] [2021-05-03 00:09:30,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:09:30,065 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:09:30,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:09:30 WrapperNode [2021-05-03 00:09:30,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:09:30,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:09:30,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:09:30,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:09:30,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:09:30" (1/1) ... [2021-05-03 00:09:30,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:09:30" (1/1) ... [2021-05-03 00:09:30,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:09:30" (1/1) ... [2021-05-03 00:09:30,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:09:30" (1/1) ... [2021-05-03 00:09:30,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:09:30" (1/1) ... [2021-05-03 00:09:30,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:09:30" (1/1) ... [2021-05-03 00:09:30,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:09:30" (1/1) ... [2021-05-03 00:09:30,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:09:30,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:09:30,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:09:30,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:09:30,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:09:30" (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:09:30,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:09:30,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:09:30,237 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:09:30,237 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-03 00:09:30,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:09:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-03 00:09:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:09:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:09:30,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:09:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-03 00:09:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:09:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:09:30,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:09:30,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:09:30,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:09:30,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:09:30,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:09:30,476 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:09:30,476 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-03 00:09:30,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:09:30 BoogieIcfgContainer [2021-05-03 00:09:30,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:09:30,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:09:30,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:09:30,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:09:30,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:09:29" (1/3) ... [2021-05-03 00:09:30,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a75fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:09:30, skipping insertion in model container [2021-05-03 00:09:30,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:09:30" (2/3) ... [2021-05-03 00:09:30,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a75fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:09:30, skipping insertion in model container [2021-05-03 00:09:30,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:09:30" (3/3) ... [2021-05-03 00:09:30,507 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_3.c [2021-05-03 00:09:30,512 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:09:30,516 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:09:30,531 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:09:30,549 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:09:30,549 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:09:30,549 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:09:30,549 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:09:30,549 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:09:30,549 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:09:30,549 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:09:30,550 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:09:30,562 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:09:30,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-03 00:09:30,567 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:30,568 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:30,568 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:30,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:30,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 1 times [2021-05-03 00:09:30,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:30,580 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1743925387] [2021-05-03 00:09:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:30,648 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:09:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:30,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:30,843 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:09:30,844 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:30,845 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1743925387] [2021-05-03 00:09:30,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1743925387] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:30,847 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:30,847 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-03 00:09:30,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991727873] [2021-05-03 00:09:30,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-03 00:09:30,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:30,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-03 00:09:30,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:09:30,868 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:09:30,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:30,953 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2021-05-03 00:09:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-03 00:09:30,954 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:09:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:30,960 INFO L225 Difference]: With dead ends: 34 [2021-05-03 00:09:30,960 INFO L226 Difference]: Without dead ends: 14 [2021-05-03 00:09:30,963 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:09:30,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-05-03 00:09:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-05-03 00:09:30,990 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:09:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-05-03 00:09:30,992 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2021-05-03 00:09:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:30,993 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-05-03 00:09:30,993 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:09:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-05-03 00:09:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-03 00:09:30,994 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:30,994 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:30,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:09:30,994 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:30,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:30,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 1 times [2021-05-03 00:09:30,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:30,996 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1933451320] [2021-05-03 00:09:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:30,999 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:09:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:31,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:31,080 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:09:31,080 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:31,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1933451320] [2021-05-03 00:09:31,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1933451320] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:31,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:31,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-03 00:09:31,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132339993] [2021-05-03 00:09:31,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-03 00:09:31,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:31,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-03 00:09:31,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-03 00:09:31,084 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:09:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:31,145 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2021-05-03 00:09:31,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-03 00:09:31,145 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:09:31,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:31,146 INFO L225 Difference]: With dead ends: 24 [2021-05-03 00:09:31,146 INFO L226 Difference]: Without dead ends: 16 [2021-05-03 00:09:31,148 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:09:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-05-03 00:09:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-05-03 00:09:31,154 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:09:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2021-05-03 00:09:31,155 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2021-05-03 00:09:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:31,155 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-05-03 00:09:31,155 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:09:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2021-05-03 00:09:31,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-03 00:09:31,156 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:31,156 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:31,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:09:31,156 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:31,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:31,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1316432198, now seen corresponding path program 1 times [2021-05-03 00:09:31,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:31,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [647053536] [2021-05-03 00:09:31,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:31,190 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_14 500000) InVars {main_~x~0=v_main_~x~0_14} OutVars{main_~x~0=v_main_~x~0_14} AuxVars[] AssignedVars[] [2021-05-03 00:09:31,202 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:31,206 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:31,222 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:31,244 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:31,259 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:31,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:31,324 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:09:31,333 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:31,374 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:31,374 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [647053536] [2021-05-03 00:09:31,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [647053536] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:31,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:31,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-03 00:09:31,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955649563] [2021-05-03 00:09:31,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-03 00:09:31,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:31,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-03 00:09:31,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-05-03 00:09:31,376 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:09:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:31,558 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2021-05-03 00:09:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-03 00:09:31,559 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:09:31,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:31,561 INFO L225 Difference]: With dead ends: 26 [2021-05-03 00:09:31,561 INFO L226 Difference]: Without dead ends: 20 [2021-05-03 00:09:31,562 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 148.4ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:09:31,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-05-03 00:09:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-05-03 00:09:31,573 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:09:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-05-03 00:09:31,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2021-05-03 00:09:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:31,576 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-05-03 00:09:31,576 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:09:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-05-03 00:09:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-03 00:09:31,577 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:31,577 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:09:31,577 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-03 00:09:31,578 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:31,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:31,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1342594849, now seen corresponding path program 1 times [2021-05-03 00:09:31,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:31,580 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [739897706] [2021-05-03 00:09:31,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:31,608 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_18 999999) (<= 500000 v_main_~x~0_18)) InVars {main_~x~0=v_main_~x~0_18} OutVars{main_~x~0=v_main_~x~0_18} AuxVars[] AssignedVars[] [2021-05-03 00:09:31,654 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:31,665 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:31,679 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:31,698 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:31,703 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:31,750 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:31,787 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_20 999999) (< v_main_~x~0_20 500000)) InVars {main_~x~0=v_main_~x~0_20} OutVars{main_~x~0=v_main_~x~0_20} AuxVars[] AssignedVars[] [2021-05-03 00:09:31,794 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:31,808 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:31,817 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:31,831 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:31,847 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:31,850 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_22 500000) InVars {main_~x~0=v_main_~x~0_22} OutVars{main_~x~0=v_main_~x~0_22} AuxVars[] AssignedVars[] [2021-05-03 00:09:31,860 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:31,881 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:31,892 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:31,903 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:31,922 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_24 1000000) (<= 500000 v_main_~x~0_24)) InVars {main_~x~0=v_main_~x~0_24} OutVars{main_~x~0=v_main_~x~0_24} AuxVars[] AssignedVars[] [2021-05-03 00:09:31,933 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:31,978 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:31,988 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:32,006 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:32,009 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:32,030 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:32,053 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:32,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:32,183 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:09:32,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:32,193 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:32,276 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:32,277 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [739897706] [2021-05-03 00:09:32,277 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [739897706] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:32,277 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:32,277 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:09:32,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562941717] [2021-05-03 00:09:32,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:09:32,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:32,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:09:32,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:09:32,281 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:09:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:32,544 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2021-05-03 00:09:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-03 00:09:32,545 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:09:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:32,547 INFO L225 Difference]: With dead ends: 37 [2021-05-03 00:09:32,547 INFO L226 Difference]: Without dead ends: 25 [2021-05-03 00:09:32,548 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 244.8ms TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:09:32,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-03 00:09:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-05-03 00:09:32,555 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:09:32,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-05-03 00:09:32,557 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 19 [2021-05-03 00:09:32,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:32,557 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-05-03 00:09:32,558 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:09:32,558 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-05-03 00:09:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-03 00:09:32,559 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:32,559 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:09:32,559 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-03 00:09:32,559 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:32,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:32,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1246825262, now seen corresponding path program 2 times [2021-05-03 00:09:32,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:32,560 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1160543557] [2021-05-03 00:09:32,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:32,573 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 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:09:32,579 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:32,582 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:32,586 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:32,600 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:32,603 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:32,658 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:32,691 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_33 500000) (< 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:09:32,694 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:32,705 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:32,712 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:32,732 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:32,743 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:32,746 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_35 500000) InVars {main_~x~0=v_main_~x~0_35} OutVars{main_~x~0=v_main_~x~0_35} AuxVars[] AssignedVars[] [2021-05-03 00:09:32,748 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:32,758 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:32,764 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:32,774 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:32,794 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_37 1000000) (<= 500000 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:09:32,800 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:32,802 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:32,808 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:32,833 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:32,837 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:32,882 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:32,908 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:32,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:33,005 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:09:33,007 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:33,009 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:33,100 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:33,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1160543557] [2021-05-03 00:09:33,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1160543557] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:33,101 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:33,101 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-03 00:09:33,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327741239] [2021-05-03 00:09:33,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-03 00:09:33,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:33,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-03 00:09:33,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:09:33,102 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:09:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:33,487 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2021-05-03 00:09:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:09:33,488 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:09:33,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:33,491 INFO L225 Difference]: With dead ends: 47 [2021-05-03 00:09:33,492 INFO L226 Difference]: Without dead ends: 30 [2021-05-03 00:09:33,493 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 339.8ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:09:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-05-03 00:09:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-05-03 00:09:33,501 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:09:33,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2021-05-03 00:09:33,502 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 24 [2021-05-03 00:09:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:33,502 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-05-03 00:09:33,503 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:09:33,503 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2021-05-03 00:09:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-03 00:09:33,503 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:33,504 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:09:33,504 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-03 00:09:33,504 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:33,505 INFO L82 PathProgramCache]: Analyzing trace with hash -319242389, now seen corresponding path program 3 times [2021-05-03 00:09:33,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:33,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1210419477] [2021-05-03 00:09:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:33,516 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_46 999999) (<= 500000 v_main_~x~0_46)) InVars {main_~x~0=v_main_~x~0_46} OutVars{main_~x~0=v_main_~x~0_46} AuxVars[] AssignedVars[] [2021-05-03 00:09:33,520 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:33,523 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:33,526 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:33,541 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:33,545 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:33,586 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:33,614 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_48 500000) (< 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:09:33,620 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:33,629 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:33,635 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:33,644 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:33,656 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:33,660 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_50 500000) InVars {main_~x~0=v_main_~x~0_50} OutVars{main_~x~0=v_main_~x~0_50} AuxVars[] AssignedVars[] [2021-05-03 00:09:33,662 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:33,671 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:33,677 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:33,689 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:33,705 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_52 1000000) (<= 500000 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:09:33,708 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:33,710 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:33,717 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:33,734 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:33,737 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:33,769 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:33,794 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:33,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:33,899 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:09:33,901 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:33,904 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:34,031 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:34,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1210419477] [2021-05-03 00:09:34,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1210419477] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:34,031 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:34,031 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:09:34,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334727302] [2021-05-03 00:09:34,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:09:34,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:34,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:09:34,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:09:34,033 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:09:34,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:34,548 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2021-05-03 00:09:34,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:09:34,549 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:09:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:34,549 INFO L225 Difference]: With dead ends: 57 [2021-05-03 00:09:34,549 INFO L226 Difference]: Without dead ends: 35 [2021-05-03 00:09:34,550 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 471.3ms TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:09:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-03 00:09:34,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-05-03 00:09:34,558 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:09:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2021-05-03 00:09:34,559 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2021-05-03 00:09:34,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:34,560 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2021-05-03 00:09:34,560 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:09:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2021-05-03 00:09:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-03 00:09:34,560 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:34,561 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:09:34,561 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-03 00:09:34,561 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:34,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:34,561 INFO L82 PathProgramCache]: Analyzing trace with hash 951830946, now seen corresponding path program 4 times [2021-05-03 00:09:34,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:34,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1246223866] [2021-05-03 00:09:34,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:34,571 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_63 999999) (<= 500000 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:09:34,575 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:34,577 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:34,580 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:34,593 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:34,595 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:34,630 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:34,654 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_65 999999) (< v_main_~x~0_65 500000)) InVars {main_~x~0=v_main_~x~0_65} OutVars{main_~x~0=v_main_~x~0_65} AuxVars[] AssignedVars[] [2021-05-03 00:09:34,657 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:34,658 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:34,665 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:34,684 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:34,695 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:34,699 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_67 500000) InVars {main_~x~0=v_main_~x~0_67} OutVars{main_~x~0=v_main_~x~0_67} AuxVars[] AssignedVars[] [2021-05-03 00:09:34,701 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:34,702 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:34,708 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:34,724 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:34,741 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 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:09:34,744 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:34,767 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:34,771 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:34,783 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:34,786 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:34,813 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:34,835 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:34,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:34,945 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:09:34,946 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:34,949 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:35,104 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:35,104 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1246223866] [2021-05-03 00:09:35,105 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1246223866] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:35,105 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:35,105 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:09:35,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784694623] [2021-05-03 00:09:35,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:09:35,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:35,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:09:35,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:09:35,106 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:09:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:35,800 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2021-05-03 00:09:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:09:35,800 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:09:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:35,801 INFO L225 Difference]: With dead ends: 67 [2021-05-03 00:09:35,801 INFO L226 Difference]: Without dead ends: 40 [2021-05-03 00:09:35,802 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 609.2ms TimeCoverageRelationStatistics Valid=300, Invalid=756, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:09:35,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-03 00:09:35,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-05-03 00:09:35,808 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:09:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2021-05-03 00:09:35,809 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 34 [2021-05-03 00:09:35,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:35,809 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2021-05-03 00:09:35,809 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:09:35,809 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2021-05-03 00:09:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-03 00:09:35,810 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:35,810 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:09:35,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-03 00:09:35,810 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:35,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:35,811 INFO L82 PathProgramCache]: Analyzing trace with hash 601551863, now seen corresponding path program 5 times [2021-05-03 00:09:35,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:35,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [657231144] [2021-05-03 00:09:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:35,819 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 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:09:35,822 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:35,844 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:35,847 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:35,860 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:35,863 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:35,884 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:35,907 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_84 999999) (< v_main_~x~0_84 500000)) InVars {main_~x~0=v_main_~x~0_84} OutVars{main_~x~0=v_main_~x~0_84} AuxVars[] AssignedVars[] [2021-05-03 00:09:35,909 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:35,918 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:35,924 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:35,932 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:35,943 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:35,945 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_86 500000) InVars {main_~x~0=v_main_~x~0_86} OutVars{main_~x~0=v_main_~x~0_86} AuxVars[] AssignedVars[] [2021-05-03 00:09:35,947 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:35,949 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:35,954 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:35,971 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:35,985 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_88 1000000) (<= 500000 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:09:35,988 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:36,009 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:36,012 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:36,031 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:36,034 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:36,049 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:36,069 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:36,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:36,149 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:09:36,151 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:36,154 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:36,378 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:36,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [657231144] [2021-05-03 00:09:36,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [657231144] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:36,378 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:36,378 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:09:36,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374295206] [2021-05-03 00:09:36,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:09:36,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:36,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:09:36,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:09:36,381 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:09:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:37,126 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2021-05-03 00:09:37,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:09:37,130 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:09:37,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:37,131 INFO L225 Difference]: With dead ends: 77 [2021-05-03 00:09:37,131 INFO L226 Difference]: Without dead ends: 45 [2021-05-03 00:09:37,132 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 708.3ms TimeCoverageRelationStatistics Valid=405, Invalid=1077, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:09:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-05-03 00:09:37,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-05-03 00:09:37,139 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:09:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2021-05-03 00:09:37,139 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 39 [2021-05-03 00:09:37,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:37,140 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2021-05-03 00:09:37,140 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:09:37,140 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2021-05-03 00:09:37,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-03 00:09:37,141 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:37,141 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:09:37,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-03 00:09:37,141 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:37,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2144480746, now seen corresponding path program 6 times [2021-05-03 00:09:37,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:37,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1425435538] [2021-05-03 00:09:37,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:37,149 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_103 999999) (<= 500000 v_main_~x~0_103)) InVars {main_~x~0=v_main_~x~0_103} OutVars{main_~x~0=v_main_~x~0_103} AuxVars[] AssignedVars[] [2021-05-03 00:09:37,152 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:37,154 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:37,156 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:37,167 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:37,171 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:37,204 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:37,225 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_105 500000) (< v_main_~x~0_105 999999)) InVars {main_~x~0=v_main_~x~0_105} OutVars{main_~x~0=v_main_~x~0_105} AuxVars[] AssignedVars[] [2021-05-03 00:09:37,228 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:37,229 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:37,234 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:37,247 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:37,258 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:37,260 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_107 500000) InVars {main_~x~0=v_main_~x~0_107} OutVars{main_~x~0=v_main_~x~0_107} AuxVars[] AssignedVars[] [2021-05-03 00:09:37,262 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:37,269 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:37,274 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:37,285 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:37,299 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 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:09:37,303 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:37,307 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:37,310 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:37,329 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:37,332 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:37,369 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:37,390 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:37,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:37,510 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:09:37,513 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:37,515 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:37,766 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:37,766 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1425435538] [2021-05-03 00:09:37,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1425435538] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:37,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:37,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:09:37,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579261327] [2021-05-03 00:09:37,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:09:37,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:37,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:09:37,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:09:37,768 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:09:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:38,641 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2021-05-03 00:09:38,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:09:38,641 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:09:38,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:38,647 INFO L225 Difference]: With dead ends: 87 [2021-05-03 00:09:38,647 INFO L226 Difference]: Without dead ends: 50 [2021-05-03 00:09:38,648 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 843.1ms TimeCoverageRelationStatistics Valid=557, Invalid=1513, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:09:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-05-03 00:09:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-05-03 00:09:38,654 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:09:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2021-05-03 00:09:38,655 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 44 [2021-05-03 00:09:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:38,655 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2021-05-03 00:09:38,655 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:09:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2021-05-03 00:09:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-03 00:09:38,656 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:38,656 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:09:38,656 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-03 00:09:38,657 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:38,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:38,657 INFO L82 PathProgramCache]: Analyzing trace with hash 266043011, now seen corresponding path program 7 times [2021-05-03 00:09:38,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:38,657 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [768454608] [2021-05-03 00:09:38,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:38,680 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 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:09:38,684 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:38,703 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:38,706 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:38,717 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:38,719 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:38,736 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:38,760 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_128 500000) (< 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:09:38,762 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:38,763 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:38,769 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:38,784 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:38,795 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:38,797 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_130 500000) InVars {main_~x~0=v_main_~x~0_130} OutVars{main_~x~0=v_main_~x~0_130} AuxVars[] AssignedVars[] [2021-05-03 00:09:38,798 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:38,799 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:38,805 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:38,820 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:38,832 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_132 1000000) (<= 500000 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:09:38,839 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:38,841 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:38,843 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:38,854 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:38,856 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:38,888 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:38,909 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:39,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:39,017 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:09:39,018 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:39,020 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:39,278 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:39,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [768454608] [2021-05-03 00:09:39,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [768454608] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:39,279 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:39,279 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:09:39,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836602468] [2021-05-03 00:09:39,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:09:39,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:39,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:09:39,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=480, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:09:39,280 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:09:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:40,273 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2021-05-03 00:09:40,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:09:40,273 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:09:40,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:40,274 INFO L225 Difference]: With dead ends: 97 [2021-05-03 00:09:40,274 INFO L226 Difference]: Without dead ends: 55 [2021-05-03 00:09:40,275 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 914.8ms TimeCoverageRelationStatistics Valid=660, Invalid=1890, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:09:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-03 00:09:40,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-05-03 00:09:40,281 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:09:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2021-05-03 00:09:40,282 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2021-05-03 00:09:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:40,282 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2021-05-03 00:09:40,282 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:09:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2021-05-03 00:09:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-05-03 00:09:40,283 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:40,283 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:09:40,283 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-03 00:09:40,283 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:40,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:40,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2144068746, now seen corresponding path program 8 times [2021-05-03 00:09:40,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:40,284 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2029245055] [2021-05-03 00:09:40,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:40,292 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_151 999999) (<= 500000 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:09:40,294 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:40,312 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:40,315 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:40,324 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:40,326 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:40,342 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:40,364 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_153 500000) (< 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:09:40,365 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:40,373 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:40,380 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:40,386 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:40,395 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:40,397 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_155 500000) InVars {main_~x~0=v_main_~x~0_155} OutVars{main_~x~0=v_main_~x~0_155} AuxVars[] AssignedVars[] [2021-05-03 00:09:40,398 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:40,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:40,408 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:40,414 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:40,439 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_157) (< v_main_~x~0_157 1000000)) InVars {main_~x~0=v_main_~x~0_157} OutVars{main_~x~0=v_main_~x~0_157} AuxVars[] AssignedVars[] [2021-05-03 00:09:40,441 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:40,442 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:40,444 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:40,455 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:40,458 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:40,486 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:40,505 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:40,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:40,631 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:09:40,632 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:40,633 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:40,972 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:40,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2029245055] [2021-05-03 00:09:40,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2029245055] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:40,973 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:40,973 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:09:40,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094528074] [2021-05-03 00:09:40,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:09:40,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:40,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:09:40,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=598, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:09:40,975 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:42,148 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2021-05-03 00:09:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:09:42,149 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 2 states have call successors, (3), 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:09:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:42,149 INFO L225 Difference]: With dead ends: 107 [2021-05-03 00:09:42,150 INFO L226 Difference]: Without dead ends: 60 [2021-05-03 00:09:42,151 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 1160.5ms TimeCoverageRelationStatistics Valid=810, Invalid=2382, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:09:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-05-03 00:09:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-05-03 00:09:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 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:09:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2021-05-03 00:09:42,158 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 54 [2021-05-03 00:09:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:42,158 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-05-03 00:09:42,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2021-05-03 00:09:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-03 00:09:42,159 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:42,159 INFO L523 BasicCegarLoop]: trace histogram [19, 18, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:42,160 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-03 00:09:42,160 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:42,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1636458737, now seen corresponding path program 9 times [2021-05-03 00:09:42,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:42,160 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [771885665] [2021-05-03 00:09:42,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:42,175 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_178) (< v_main_~x~0_178 999999)) InVars {main_~x~0=v_main_~x~0_178} OutVars{main_~x~0=v_main_~x~0_178} AuxVars[] AssignedVars[] [2021-05-03 00:09:42,178 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:42,196 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:42,199 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:42,209 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:42,211 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:42,225 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:42,244 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_180 999999) (< v_main_~x~0_180 500000)) InVars {main_~x~0=v_main_~x~0_180} OutVars{main_~x~0=v_main_~x~0_180} AuxVars[] AssignedVars[] [2021-05-03 00:09:42,245 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:42,252 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:42,257 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:42,273 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:42,282 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:42,284 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_182 500000) InVars {main_~x~0=v_main_~x~0_182} OutVars{main_~x~0=v_main_~x~0_182} AuxVars[] AssignedVars[] [2021-05-03 00:09:42,285 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:42,286 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:42,290 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:42,302 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:42,325 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_184 1000000) (<= 500000 v_main_~x~0_184)) InVars {main_~x~0=v_main_~x~0_184} OutVars{main_~x~0=v_main_~x~0_184} AuxVars[] AssignedVars[] [2021-05-03 00:09:42,328 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:42,329 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:42,330 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:42,340 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:42,342 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:42,384 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:42,407 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:42,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:09:42,602 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:42,651 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:42,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [771885665] [2021-05-03 00:09:42,652 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [771885665] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:42,652 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:42,652 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:09:42,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522534373] [2021-05-03 00:09:42,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:09:42,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:42,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:09:42,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=179, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:09:42,653 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:43,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:43,023 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2021-05-03 00:09:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:09:43,024 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2021-05-03 00:09:43,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:43,025 INFO L225 Difference]: With dead ends: 115 [2021-05-03 00:09:43,025 INFO L226 Difference]: Without dead ends: 63 [2021-05-03 00:09:43,026 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 459.3ms TimeCoverageRelationStatistics Valid=310, Invalid=560, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:09:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-03 00:09:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-05-03 00:09:43,033 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:09:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2021-05-03 00:09:43,034 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 59 [2021-05-03 00:09:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:43,034 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2021-05-03 00:09:43,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2021-05-03 00:09:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-03 00:09:43,035 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:43,035 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:09:43,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-03 00:09:43,035 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:43,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:43,035 INFO L82 PathProgramCache]: Analyzing trace with hash 973125431, now seen corresponding path program 10 times [2021-05-03 00:09:43,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:43,036 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [306837511] [2021-05-03 00:09:43,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:43,042 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_190 999999) (<= 500000 v_main_~x~0_190)) InVars {main_~x~0=v_main_~x~0_190} OutVars{main_~x~0=v_main_~x~0_190} AuxVars[] AssignedVars[] [2021-05-03 00:09:43,045 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:43,046 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:43,048 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:43,058 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:43,061 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:43,091 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:43,114 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_192 999999) (< v_main_~x~0_192 500000)) InVars {main_~x~0=v_main_~x~0_192} OutVars{main_~x~0=v_main_~x~0_192} AuxVars[] AssignedVars[] [2021-05-03 00:09:43,116 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:43,124 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:43,129 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:43,136 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:43,147 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:43,149 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_194 500000) InVars {main_~x~0=v_main_~x~0_194} OutVars{main_~x~0=v_main_~x~0_194} AuxVars[] AssignedVars[] [2021-05-03 00:09:43,150 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:43,158 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:43,165 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:43,172 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:43,187 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_196 1000000) (<= 500000 v_main_~x~0_196)) InVars {main_~x~0=v_main_~x~0_196} OutVars{main_~x~0=v_main_~x~0_196} AuxVars[] AssignedVars[] [2021-05-03 00:09:43,191 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:43,192 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:43,194 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:43,205 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:43,208 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:43,237 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:43,259 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:43,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:43,411 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:09:43,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:43,415 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:43,840 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:43,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [306837511] [2021-05-03 00:09:43,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [306837511] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:43,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:43,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:09:43,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847133245] [2021-05-03 00:09:43,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:09:43,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:43,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:09:43,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=763, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:09:43,842 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:09:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:45,354 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-05-03 00:09:45,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:09:45,354 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:09:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:45,355 INFO L225 Difference]: With dead ends: 121 [2021-05-03 00:09:45,355 INFO L226 Difference]: Without dead ends: 68 [2021-05-03 00:09:45,357 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1503.5ms TimeCoverageRelationStatistics Valid=1071, Invalid=3089, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:09:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-03 00:09:45,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-05-03 00:09:45,372 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:09:45,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-05-03 00:09:45,376 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 62 [2021-05-03 00:09:45,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:45,376 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-05-03 00:09:45,376 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:09:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-05-03 00:09:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-03 00:09:45,377 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:45,377 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:09:45,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-03 00:09:45,378 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:45,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:45,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1013750530, now seen corresponding path program 11 times [2021-05-03 00:09:45,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:45,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1608493734] [2021-05-03 00:09:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:45,385 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_220 999999) (<= 500000 v_main_~x~0_220)) InVars {main_~x~0=v_main_~x~0_220} OutVars{main_~x~0=v_main_~x~0_220} AuxVars[] AssignedVars[] [2021-05-03 00:09:45,387 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:45,388 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:45,389 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:45,400 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:45,402 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:45,427 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:45,453 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_222 500000) (< v_main_~x~0_222 999999)) InVars {main_~x~0=v_main_~x~0_222} OutVars{main_~x~0=v_main_~x~0_222} AuxVars[] AssignedVars[] [2021-05-03 00:09:45,454 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:45,461 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:45,470 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:45,478 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:45,489 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:45,490 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_224 500000) InVars {main_~x~0=v_main_~x~0_224} OutVars{main_~x~0=v_main_~x~0_224} AuxVars[] AssignedVars[] [2021-05-03 00:09:45,491 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:45,492 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:45,497 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:45,510 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:45,523 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_226 1000000) (<= 500000 v_main_~x~0_226)) InVars {main_~x~0=v_main_~x~0_226} OutVars{main_~x~0=v_main_~x~0_226} AuxVars[] AssignedVars[] [2021-05-03 00:09:45,525 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:45,526 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:45,531 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:45,542 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:45,545 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:45,576 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:45,593 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:45,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:45,738 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:09:45,740 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:45,742 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:46,219 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:46,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1608493734] [2021-05-03 00:09:46,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1608493734] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:46,220 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:46,220 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:09:46,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080414934] [2021-05-03 00:09:46,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:09:46,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:46,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:09:46,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=910, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:09:46,221 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:09:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:47,884 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2021-05-03 00:09:47,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:09:47,885 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:09:47,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:47,885 INFO L225 Difference]: With dead ends: 131 [2021-05-03 00:09:47,886 INFO L226 Difference]: Without dead ends: 73 [2021-05-03 00:09:47,887 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 1630.5ms TimeCoverageRelationStatistics Valid=1260, Invalid=3710, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:09:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-03 00:09:47,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-05-03 00:09:47,894 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:09:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2021-05-03 00:09:47,895 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 67 [2021-05-03 00:09:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:47,895 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2021-05-03 00:09:47,895 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:09:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2021-05-03 00:09:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-05-03 00:09:47,896 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:47,896 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:09:47,896 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-03 00:09:47,896 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:47,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash 852847211, now seen corresponding path program 12 times [2021-05-03 00:09:47,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:47,897 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1790476310] [2021-05-03 00:09:47,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:47,903 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_252 999999) (<= 500000 v_main_~x~0_252)) InVars {main_~x~0=v_main_~x~0_252} OutVars{main_~x~0=v_main_~x~0_252} AuxVars[] AssignedVars[] [2021-05-03 00:09:47,905 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:47,906 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:47,908 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:47,918 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:47,920 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:47,944 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:47,961 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_254 999999) (< v_main_~x~0_254 500000)) InVars {main_~x~0=v_main_~x~0_254} OutVars{main_~x~0=v_main_~x~0_254} AuxVars[] AssignedVars[] [2021-05-03 00:09:47,963 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:47,969 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:47,977 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:47,990 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:48,003 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:48,005 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_256 500000) InVars {main_~x~0=v_main_~x~0_256} OutVars{main_~x~0=v_main_~x~0_256} AuxVars[] AssignedVars[] [2021-05-03 00:09:48,006 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:48,015 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:48,020 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:48,028 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:48,043 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_258 1000000) (<= 500000 v_main_~x~0_258)) InVars {main_~x~0=v_main_~x~0_258} OutVars{main_~x~0=v_main_~x~0_258} AuxVars[] AssignedVars[] [2021-05-03 00:09:48,045 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:48,046 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:48,050 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:48,061 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:48,063 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:48,100 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:48,117 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:48,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:48,254 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:09:48,255 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:48,257 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:48,748 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:48,749 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1790476310] [2021-05-03 00:09:48,749 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1790476310] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:48,749 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:48,749 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:09:48,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594926825] [2021-05-03 00:09:48,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:09:48,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:48,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:09:48,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=1070, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:09:48,750 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:09:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:50,654 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2021-05-03 00:09:50,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-03 00:09:50,655 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:09:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:50,655 INFO L225 Difference]: With dead ends: 141 [2021-05-03 00:09:50,655 INFO L226 Difference]: Without dead ends: 78 [2021-05-03 00:09:50,659 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 1802.9ms TimeCoverageRelationStatistics Valid=1464, Invalid=4388, Unknown=0, NotChecked=0, Total=5852 [2021-05-03 00:09:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-05-03 00:09:50,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-05-03 00:09:50,671 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:09:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-05-03 00:09:50,672 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 72 [2021-05-03 00:09:50,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:50,672 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-05-03 00:09:50,672 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:09:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-05-03 00:09:50,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-03 00:09:50,673 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:50,673 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:09:50,673 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-03 00:09:50,673 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:50,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:50,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1663914702, now seen corresponding path program 13 times [2021-05-03 00:09:50,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:50,674 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1138733261] [2021-05-03 00:09:50,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:50,680 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_286) (< v_main_~x~0_286 999999)) InVars {main_~x~0=v_main_~x~0_286} OutVars{main_~x~0=v_main_~x~0_286} AuxVars[] AssignedVars[] [2021-05-03 00:09:50,683 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:50,699 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:50,701 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:50,711 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:50,713 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:50,727 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:50,745 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_288 999999) (< v_main_~x~0_288 500000)) InVars {main_~x~0=v_main_~x~0_288} OutVars{main_~x~0=v_main_~x~0_288} AuxVars[] AssignedVars[] [2021-05-03 00:09:50,746 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:50,753 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:50,757 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:50,762 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:50,772 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:50,773 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_290 500000) InVars {main_~x~0=v_main_~x~0_290} OutVars{main_~x~0=v_main_~x~0_290} AuxVars[] AssignedVars[] [2021-05-03 00:09:50,777 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:50,777 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:50,791 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:50,806 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:50,818 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_292) (< v_main_~x~0_292 1000000)) InVars {main_~x~0=v_main_~x~0_292} OutVars{main_~x~0=v_main_~x~0_292} AuxVars[] AssignedVars[] [2021-05-03 00:09:50,820 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:50,822 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:50,827 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:50,838 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:50,841 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:50,871 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:50,891 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:51,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:51,062 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:09:51,063 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:51,066 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:51,645 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:51,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1138733261] [2021-05-03 00:09:51,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1138733261] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:51,645 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:51,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-03 00:09:51,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560361772] [2021-05-03 00:09:51,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-03 00:09:51,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:51,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-03 00:09:51,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=1243, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:09:51,647 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:09:53,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:53,597 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2021-05-03 00:09:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-03 00:09:53,598 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:09:53,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:53,598 INFO L225 Difference]: With dead ends: 151 [2021-05-03 00:09:53,598 INFO L226 Difference]: Without dead ends: 83 [2021-05-03 00:09:53,600 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 1944.7ms TimeCoverageRelationStatistics Valid=1683, Invalid=5123, Unknown=0, NotChecked=0, Total=6806 [2021-05-03 00:09:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-03 00:09:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-05-03 00:09:53,605 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:09:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2021-05-03 00:09:53,605 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 77 [2021-05-03 00:09:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:53,605 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2021-05-03 00:09:53,606 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:09:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2021-05-03 00:09:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-05-03 00:09:53,606 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:53,606 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:09:53,607 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-03 00:09:53,607 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:53,607 INFO L82 PathProgramCache]: Analyzing trace with hash -732203105, now seen corresponding path program 14 times [2021-05-03 00:09:53,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:53,607 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [133706957] [2021-05-03 00:09:53,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:53,624 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_322) (< v_main_~x~0_322 999999)) InVars {main_~x~0=v_main_~x~0_322} OutVars{main_~x~0=v_main_~x~0_322} AuxVars[] AssignedVars[] [2021-05-03 00:09:53,625 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:53,626 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:53,628 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:53,639 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:53,641 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:53,667 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:53,689 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_324 999999) (< v_main_~x~0_324 500000)) InVars {main_~x~0=v_main_~x~0_324} OutVars{main_~x~0=v_main_~x~0_324} AuxVars[] AssignedVars[] [2021-05-03 00:09:53,691 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:53,697 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:53,702 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:53,708 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:53,717 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:53,718 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_326 500000) InVars {main_~x~0=v_main_~x~0_326} OutVars{main_~x~0=v_main_~x~0_326} AuxVars[] AssignedVars[] [2021-05-03 00:09:53,721 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:53,728 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:53,732 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:53,738 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:53,762 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_328 1000000) (<= 500000 v_main_~x~0_328)) InVars {main_~x~0=v_main_~x~0_328} OutVars{main_~x~0=v_main_~x~0_328} AuxVars[] AssignedVars[] [2021-05-03 00:09:53,764 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:53,780 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:53,782 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:53,792 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:53,794 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:53,807 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:53,824 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:53,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:53,999 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:09:54,001 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:54,002 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:54,622 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:54,623 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [133706957] [2021-05-03 00:09:54,623 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [133706957] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:54,623 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:54,623 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-03 00:09:54,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442123588] [2021-05-03 00:09:54,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-03 00:09:54,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:54,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-03 00:09:54,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=1429, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:09:54,625 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:09:56,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:56,903 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2021-05-03 00:09:56,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-03 00:09:56,903 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:09:56,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:56,904 INFO L225 Difference]: With dead ends: 161 [2021-05-03 00:09:56,904 INFO L226 Difference]: Without dead ends: 88 [2021-05-03 00:09:56,906 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 2189.1ms TimeCoverageRelationStatistics Valid=1917, Invalid=5915, Unknown=0, NotChecked=0, Total=7832 [2021-05-03 00:09:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-05-03 00:09:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-05-03 00:09:56,911 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:09:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2021-05-03 00:09:56,911 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 82 [2021-05-03 00:09:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:56,911 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2021-05-03 00:09:56,912 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:09:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2021-05-03 00:09:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-03 00:09:56,912 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:56,912 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:09:56,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-03 00:09:56,912 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:56,913 INFO L82 PathProgramCache]: Analyzing trace with hash 164384922, now seen corresponding path program 15 times [2021-05-03 00:09:56,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:56,913 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2034598927] [2021-05-03 00:09:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:56,923 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_360) (< v_main_~x~0_360 999999)) InVars {main_~x~0=v_main_~x~0_360} OutVars{main_~x~0=v_main_~x~0_360} AuxVars[] AssignedVars[] [2021-05-03 00:09:56,925 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:56,940 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:56,947 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:56,956 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:56,958 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:56,972 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:56,990 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_362 999999) (< v_main_~x~0_362 500000)) InVars {main_~x~0=v_main_~x~0_362} OutVars{main_~x~0=v_main_~x~0_362} AuxVars[] AssignedVars[] [2021-05-03 00:09:57,002 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:09:57,011 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:57,016 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:57,023 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:09:57,035 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:57,037 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_364 500000) InVars {main_~x~0=v_main_~x~0_364} OutVars{main_~x~0=v_main_~x~0_364} AuxVars[] AssignedVars[] [2021-05-03 00:09:57,038 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:09:57,046 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:57,051 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:57,058 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:09:57,070 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_366 1000000) (<= 500000 v_main_~x~0_366)) InVars {main_~x~0=v_main_~x~0_366} OutVars{main_~x~0=v_main_~x~0_366} AuxVars[] AssignedVars[] [2021-05-03 00:09:57,072 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:09:57,073 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:57,076 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:57,087 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:09:57,090 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:09:57,119 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:09:57,138 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:09:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:57,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:57,351 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:09:57,352 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:57,354 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:09:58,163 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:58,163 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2034598927] [2021-05-03 00:09:58,163 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2034598927] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:58,164 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:58,164 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-03 00:09:58,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560378250] [2021-05-03 00:09:58,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-03 00:09:58,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-03 00:09:58,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=724, Invalid=1628, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:09:58,165 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:10:00,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:00,729 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2021-05-03 00:10:00,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-03 00:10:00,729 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:10:00,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:00,730 INFO L225 Difference]: With dead ends: 171 [2021-05-03 00:10:00,730 INFO L226 Difference]: Without dead ends: 93 [2021-05-03 00:10:00,732 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2444 ImplicationChecksByTransitivity, 2582.7ms TimeCoverageRelationStatistics Valid=2166, Invalid=6764, Unknown=0, NotChecked=0, Total=8930 [2021-05-03 00:10:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-03 00:10:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-05-03 00:10:00,738 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:10:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2021-05-03 00:10:00,739 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 87 [2021-05-03 00:10:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:00,739 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2021-05-03 00:10:00,739 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:10:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2021-05-03 00:10:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-05-03 00:10:00,740 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:00,740 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:10:00,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-05-03 00:10:00,741 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:00,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:00,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1893490989, now seen corresponding path program 16 times [2021-05-03 00:10:00,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:00,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1028692123] [2021-05-03 00:10:00,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:00,749 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_400 999999) (<= 500000 v_main_~x~0_400)) InVars {main_~x~0=v_main_~x~0_400} OutVars{main_~x~0=v_main_~x~0_400} AuxVars[] AssignedVars[] [2021-05-03 00:10:00,752 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:00,753 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:00,755 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:00,765 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:00,768 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:00,800 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:00,819 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_402 999999) (< v_main_~x~0_402 500000)) InVars {main_~x~0=v_main_~x~0_402} OutVars{main_~x~0=v_main_~x~0_402} AuxVars[] AssignedVars[] [2021-05-03 00:10:00,820 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:00,833 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:00,839 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:00,851 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:00,861 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:00,863 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_404 500000) InVars {main_~x~0=v_main_~x~0_404} OutVars{main_~x~0=v_main_~x~0_404} AuxVars[] AssignedVars[] [2021-05-03 00:10:00,864 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:00,865 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:00,871 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:00,887 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:00,901 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_406 1000000) (<= 500000 v_main_~x~0_406)) InVars {main_~x~0=v_main_~x~0_406} OutVars{main_~x~0=v_main_~x~0_406} AuxVars[] AssignedVars[] [2021-05-03 00:10:00,904 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:00,905 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:00,907 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:00,920 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:00,923 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:00,952 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:00,971 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:01,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:01,203 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:10:01,204 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:01,206 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:01,910 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:01,910 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1028692123] [2021-05-03 00:10:01,910 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1028692123] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:01,910 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:01,910 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-03 00:10:01,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652030325] [2021-05-03 00:10:01,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-03 00:10:01,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:01,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-03 00:10:01,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=1840, Unknown=0, NotChecked=0, Total=2652 [2021-05-03 00:10:01,912 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:10:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:04,775 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2021-05-03 00:10:04,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-03 00:10:04,776 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:10:04,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:04,776 INFO L225 Difference]: With dead ends: 181 [2021-05-03 00:10:04,777 INFO L226 Difference]: Without dead ends: 98 [2021-05-03 00:10:04,778 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 2674.1ms TimeCoverageRelationStatistics Valid=2430, Invalid=7670, Unknown=0, NotChecked=0, Total=10100 [2021-05-03 00:10:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-03 00:10:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-05-03 00:10:04,786 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:10:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2021-05-03 00:10:04,786 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 92 [2021-05-03 00:10:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:04,786 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2021-05-03 00:10:04,787 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:10:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2021-05-03 00:10:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-05-03 00:10:04,787 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:04,787 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:10:04,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-03 00:10:04,788 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:04,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:04,788 INFO L82 PathProgramCache]: Analyzing trace with hash -405220250, now seen corresponding path program 17 times [2021-05-03 00:10:04,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:04,788 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1110019481] [2021-05-03 00:10:04,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:04,799 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_442) (< v_main_~x~0_442 999999)) InVars {main_~x~0=v_main_~x~0_442} OutVars{main_~x~0=v_main_~x~0_442} AuxVars[] AssignedVars[] [2021-05-03 00:10:04,801 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:04,823 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:04,826 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:04,837 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:04,840 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:04,858 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:04,879 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_444 999999) (< v_main_~x~0_444 500000)) InVars {main_~x~0=v_main_~x~0_444} OutVars{main_~x~0=v_main_~x~0_444} AuxVars[] AssignedVars[] [2021-05-03 00:10:04,881 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:04,889 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:04,895 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:04,908 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:04,917 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:04,918 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_446 500000) InVars {main_~x~0=v_main_~x~0_446} OutVars{main_~x~0=v_main_~x~0_446} AuxVars[] AssignedVars[] [2021-05-03 00:10:04,925 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:04,925 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:04,930 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:04,941 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:04,953 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_448 1000000) (<= 500000 v_main_~x~0_448)) InVars {main_~x~0=v_main_~x~0_448} OutVars{main_~x~0=v_main_~x~0_448} AuxVars[] AssignedVars[] [2021-05-03 00:10:04,961 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:04,962 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:04,964 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:04,977 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:04,980 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:05,016 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:05,034 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:05,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:10:05,268 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:05,270 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:06,160 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:06,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1110019481] [2021-05-03 00:10:06,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1110019481] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:06,160 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:06,160 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-03 00:10:06,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827645320] [2021-05-03 00:10:06,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-03 00:10:06,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:06,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-03 00:10:06,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=2065, Unknown=0, NotChecked=0, Total=2970 [2021-05-03 00:10:06,162 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:10:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:09,264 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2021-05-03 00:10:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-03 00:10:09,264 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:10:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:09,265 INFO L225 Difference]: With dead ends: 191 [2021-05-03 00:10:09,265 INFO L226 Difference]: Without dead ends: 103 [2021-05-03 00:10:09,266 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3127 ImplicationChecksByTransitivity, 3053.4ms TimeCoverageRelationStatistics Valid=2709, Invalid=8633, Unknown=0, NotChecked=0, Total=11342 [2021-05-03 00:10:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-05-03 00:10:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-05-03 00:10:09,274 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:10:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2021-05-03 00:10:09,275 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 97 [2021-05-03 00:10:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:09,275 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2021-05-03 00:10:09,275 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:10:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2021-05-03 00:10:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-05-03 00:10:09,276 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:09,276 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:10:09,276 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-05-03 00:10:09,276 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:09,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:09,276 INFO L82 PathProgramCache]: Analyzing trace with hash 209625095, now seen corresponding path program 18 times [2021-05-03 00:10:09,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:09,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [167494035] [2021-05-03 00:10:09,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:09,294 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_486 999999) (<= 500000 v_main_~x~0_486)) InVars {main_~x~0=v_main_~x~0_486} OutVars{main_~x~0=v_main_~x~0_486} AuxVars[] AssignedVars[] [2021-05-03 00:10:09,297 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:09,315 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:09,318 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:09,328 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:09,330 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:09,347 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:09,372 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_488 500000) (< v_main_~x~0_488 999999)) InVars {main_~x~0=v_main_~x~0_488} OutVars{main_~x~0=v_main_~x~0_488} AuxVars[] AssignedVars[] [2021-05-03 00:10:09,374 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:09,382 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:09,388 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:09,395 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:09,405 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:09,407 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_490 500000) InVars {main_~x~0=v_main_~x~0_490} OutVars{main_~x~0=v_main_~x~0_490} AuxVars[] AssignedVars[] [2021-05-03 00:10:09,408 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:09,415 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:09,421 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:09,427 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:09,439 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_492) (< v_main_~x~0_492 1000000)) InVars {main_~x~0=v_main_~x~0_492} OutVars{main_~x~0=v_main_~x~0_492} AuxVars[] AssignedVars[] [2021-05-03 00:10:09,441 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:09,443 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:09,444 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:09,455 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:09,457 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:09,483 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:09,501 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:09,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:10:09,758 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:09,760 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:10,710 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:10,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [167494035] [2021-05-03 00:10:10,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [167494035] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:10,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:10,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-03 00:10:10,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509196505] [2021-05-03 00:10:10,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-03 00:10:10,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:10,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-03 00:10:10,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1003, Invalid=2303, Unknown=0, NotChecked=0, Total=3306 [2021-05-03 00:10:10,712 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:10:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:14,209 INFO L93 Difference]: Finished difference Result 201 states and 212 transitions. [2021-05-03 00:10:14,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-03 00:10:14,209 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:10:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:14,210 INFO L225 Difference]: With dead ends: 201 [2021-05-03 00:10:14,210 INFO L226 Difference]: Without dead ends: 108 [2021-05-03 00:10:14,211 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3500 ImplicationChecksByTransitivity, 3310.4ms TimeCoverageRelationStatistics Valid=3003, Invalid=9653, Unknown=0, NotChecked=0, Total=12656 [2021-05-03 00:10:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-05-03 00:10:14,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-05-03 00:10:14,219 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:10:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2021-05-03 00:10:14,219 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 102 [2021-05-03 00:10:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:14,220 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2021-05-03 00:10:14,220 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:10:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2021-05-03 00:10:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-03 00:10:14,221 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:14,221 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:10:14,221 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-05-03 00:10:14,221 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:14,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:14,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1440604622, now seen corresponding path program 19 times [2021-05-03 00:10:14,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:14,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1815713216] [2021-05-03 00:10:14,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:14,231 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_532 999999) (<= 500000 v_main_~x~0_532)) InVars {main_~x~0=v_main_~x~0_532} OutVars{main_~x~0=v_main_~x~0_532} AuxVars[] AssignedVars[] [2021-05-03 00:10:14,234 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:14,235 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:14,238 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:14,250 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:14,253 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:14,287 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:14,310 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_534 500000) (< v_main_~x~0_534 999999)) InVars {main_~x~0=v_main_~x~0_534} OutVars{main_~x~0=v_main_~x~0_534} AuxVars[] AssignedVars[] [2021-05-03 00:10:14,312 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:14,320 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:14,325 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:14,333 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:14,344 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:14,346 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_536 500000) InVars {main_~x~0=v_main_~x~0_536} OutVars{main_~x~0=v_main_~x~0_536} AuxVars[] AssignedVars[] [2021-05-03 00:10:14,347 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:14,355 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:14,360 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:14,368 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:14,381 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_538) (< v_main_~x~0_538 1000000)) InVars {main_~x~0=v_main_~x~0_538} OutVars{main_~x~0=v_main_~x~0_538} AuxVars[] AssignedVars[] [2021-05-03 00:10:14,383 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:14,403 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:14,405 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:14,416 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:14,419 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:14,435 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:14,456 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:14,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:10:14,759 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:14,760 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:15,723 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:15,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1815713216] [2021-05-03 00:10:15,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1815713216] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:15,723 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:15,723 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2021-05-03 00:10:15,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65799439] [2021-05-03 00:10:15,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-03 00:10:15,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:15,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-03 00:10:15,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1147, Invalid=2635, Unknown=0, NotChecked=0, Total=3782 [2021-05-03 00:10:15,725 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand has 61 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 60 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:19,548 INFO L93 Difference]: Finished difference Result 211 states and 222 transitions. [2021-05-03 00:10:19,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-05-03 00:10:19,550 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 60 states have internal predecessors, (102), 2 states have call successors, (3), 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:10:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:19,551 INFO L225 Difference]: With dead ends: 211 [2021-05-03 00:10:19,551 INFO L226 Difference]: Without dead ends: 113 [2021-05-03 00:10:19,552 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3952 ImplicationChecksByTransitivity, 3564.1ms TimeCoverageRelationStatistics Valid=3392, Invalid=10888, Unknown=0, NotChecked=0, Total=14280 [2021-05-03 00:10:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-03 00:10:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-05-03 00:10:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:19,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2021-05-03 00:10:19,561 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 107 [2021-05-03 00:10:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:19,561 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2021-05-03 00:10:19,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 61 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 60 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2021-05-03 00:10:19,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-05-03 00:10:19,562 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:19,562 INFO L523 BasicCegarLoop]: trace histogram [40, 38, 20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:10:19,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-05-03 00:10:19,562 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:19,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:19,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1383938875, now seen corresponding path program 20 times [2021-05-03 00:10:19,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:19,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [698099420] [2021-05-03 00:10:19,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:19,573 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_580 999999) (<= 500000 v_main_~x~0_580)) InVars {main_~x~0=v_main_~x~0_580} OutVars{main_~x~0=v_main_~x~0_580} AuxVars[] AssignedVars[] [2021-05-03 00:10:19,575 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:19,591 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:19,594 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:19,602 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:19,604 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:19,617 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:19,635 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_582 999999) (< v_main_~x~0_582 500000)) InVars {main_~x~0=v_main_~x~0_582} OutVars{main_~x~0=v_main_~x~0_582} AuxVars[] AssignedVars[] [2021-05-03 00:10:19,636 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:19,637 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:19,642 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:19,654 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:19,663 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:19,664 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_584 500000) InVars {main_~x~0=v_main_~x~0_584} OutVars{main_~x~0=v_main_~x~0_584} AuxVars[] AssignedVars[] [2021-05-03 00:10:19,667 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:19,667 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:19,678 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:19,690 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:19,701 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_586 1000000) (<= 500000 v_main_~x~0_586)) InVars {main_~x~0=v_main_~x~0_586} OutVars{main_~x~0=v_main_~x~0_586} AuxVars[] AssignedVars[] [2021-05-03 00:10:19,709 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:19,710 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:19,713 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:19,722 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:19,724 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:19,751 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:19,768 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:20,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:20,094 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:10:20,095 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:20,097 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:21,121 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:21,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [698099420] [2021-05-03 00:10:21,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [698099420] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:21,121 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:21,121 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2021-05-03 00:10:21,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221791984] [2021-05-03 00:10:21,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-03 00:10:21,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:21,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-03 00:10:21,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1214, Invalid=2818, Unknown=0, NotChecked=0, Total=4032 [2021-05-03 00:10:21,122 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand has 64 states, 64 states have (on average 1.671875) internal successors, (107), 63 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:25,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:25,225 INFO L93 Difference]: Finished difference Result 221 states and 232 transitions. [2021-05-03 00:10:25,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-05-03 00:10:25,226 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.671875) internal successors, (107), 63 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2021-05-03 00:10:25,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:25,229 INFO L225 Difference]: With dead ends: 221 [2021-05-03 00:10:25,229 INFO L226 Difference]: Without dead ends: 118 [2021-05-03 00:10:25,230 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4309 ImplicationChecksByTransitivity, 3909.1ms TimeCoverageRelationStatistics Valid=3636, Invalid=11864, Unknown=0, NotChecked=0, Total=15500 [2021-05-03 00:10:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-05-03 00:10:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-05-03 00:10:25,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.0353982300884956) internal successors, (117), 113 states have internal predecessors, (117), 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:10:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2021-05-03 00:10:25,242 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 112 [2021-05-03 00:10:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:25,242 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2021-05-03 00:10:25,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 64 states have (on average 1.671875) internal successors, (107), 63 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2021-05-03 00:10:25,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-05-03 00:10:25,243 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:25,243 INFO L523 BasicCegarLoop]: trace histogram [42, 40, 21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:10:25,243 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-05-03 00:10:25,244 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:25,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:25,244 INFO L82 PathProgramCache]: Analyzing trace with hash -826839554, now seen corresponding path program 21 times [2021-05-03 00:10:25,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:25,244 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1204636988] [2021-05-03 00:10:25,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:25,250 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_630 999999) (<= 500000 v_main_~x~0_630)) InVars {main_~x~0=v_main_~x~0_630} OutVars{main_~x~0=v_main_~x~0_630} AuxVars[] AssignedVars[] [2021-05-03 00:10:25,252 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:25,268 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:25,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:25,282 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:25,286 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:25,300 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:25,319 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_632 500000) (< v_main_~x~0_632 999999)) InVars {main_~x~0=v_main_~x~0_632} OutVars{main_~x~0=v_main_~x~0_632} AuxVars[] AssignedVars[] [2021-05-03 00:10:25,320 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:25,320 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:25,325 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:25,338 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:25,348 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:25,349 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_634 500000) InVars {main_~x~0=v_main_~x~0_634} OutVars{main_~x~0=v_main_~x~0_634} AuxVars[] AssignedVars[] [2021-05-03 00:10:25,350 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:25,350 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:25,370 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:25,388 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:25,403 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_636 1000000) (<= 500000 v_main_~x~0_636)) InVars {main_~x~0=v_main_~x~0_636} OutVars{main_~x~0=v_main_~x~0_636} AuxVars[] AssignedVars[] [2021-05-03 00:10:25,405 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:25,426 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:25,433 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:25,444 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:25,447 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:25,463 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:25,483 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:25,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:25,888 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:10:25,891 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:25,953 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:25,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1204636988] [2021-05-03 00:10:25,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1204636988] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:25,953 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:25,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:10:25,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731432774] [2021-05-03 00:10:25,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:10:25,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:25,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:10:25,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:10:25,954 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:26,808 INFO L93 Difference]: Finished difference Result 229 states and 237 transitions. [2021-05-03 00:10:26,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:10:26,808 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2021-05-03 00:10:26,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:26,809 INFO L225 Difference]: With dead ends: 229 [2021-05-03 00:10:26,809 INFO L226 Difference]: Without dead ends: 121 [2021-05-03 00:10:26,810 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1090.2ms TimeCoverageRelationStatistics Valid=1112, Invalid=1968, Unknown=0, NotChecked=0, Total=3080 [2021-05-03 00:10:26,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-05-03 00:10:26,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-05-03 00:10:26,820 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:10:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 124 transitions. [2021-05-03 00:10:26,821 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 124 transitions. Word has length 117 [2021-05-03 00:10:26,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:26,821 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 124 transitions. [2021-05-03 00:10:26,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2021-05-03 00:10:26,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-05-03 00:10:26,822 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:26,822 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:10:26,823 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-05-03 00:10:26,823 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:26,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:26,823 INFO L82 PathProgramCache]: Analyzing trace with hash 2068507752, now seen corresponding path program 22 times [2021-05-03 00:10:26,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:26,823 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [906569901] [2021-05-03 00:10:26,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:26,833 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_643 999999) (<= 500000 v_main_~x~0_643)) InVars {main_~x~0=v_main_~x~0_643} OutVars{main_~x~0=v_main_~x~0_643} AuxVars[] AssignedVars[] [2021-05-03 00:10:26,837 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:26,854 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:26,857 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:26,868 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:26,870 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:26,884 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:26,903 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_645 500000) (< v_main_~x~0_645 999999)) InVars {main_~x~0=v_main_~x~0_645} OutVars{main_~x~0=v_main_~x~0_645} AuxVars[] AssignedVars[] [2021-05-03 00:10:26,905 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:26,912 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:26,917 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:26,923 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:26,933 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:26,934 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_647 500000) InVars {main_~x~0=v_main_~x~0_647} OutVars{main_~x~0=v_main_~x~0_647} AuxVars[] AssignedVars[] [2021-05-03 00:10:26,935 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:26,936 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:26,940 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:26,952 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:26,964 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_649) (< v_main_~x~0_649 1000000)) InVars {main_~x~0=v_main_~x~0_649} OutVars{main_~x~0=v_main_~x~0_649} AuxVars[] AssignedVars[] [2021-05-03 00:10:26,966 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:26,966 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:26,968 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:26,977 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:26,979 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:27,005 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:27,023 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:27,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:27,368 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:10:27,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:27,386 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:28,573 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:28,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [906569901] [2021-05-03 00:10:28,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [906569901] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:28,574 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:28,574 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2021-05-03 00:10:28,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061339878] [2021-05-03 00:10:28,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2021-05-03 00:10:28,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:28,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-05-03 00:10:28,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=3254, Unknown=0, NotChecked=0, Total=4692 [2021-05-03 00:10:28,575 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:10:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:33,251 INFO L93 Difference]: Finished difference Result 235 states and 246 transitions. [2021-05-03 00:10:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-05-03 00:10:33,252 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:10:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:33,253 INFO L225 Difference]: With dead ends: 235 [2021-05-03 00:10:33,253 INFO L226 Difference]: Without dead ends: 126 [2021-05-03 00:10:33,254 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5000 ImplicationChecksByTransitivity, 4411.0ms TimeCoverageRelationStatistics Valid=4261, Invalid=13561, Unknown=0, NotChecked=0, Total=17822 [2021-05-03 00:10:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-05-03 00:10:33,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-05-03 00:10:33,265 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:10:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 129 transitions. [2021-05-03 00:10:33,266 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 129 transitions. Word has length 120 [2021-05-03 00:10:33,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:33,266 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 129 transitions. [2021-05-03 00:10:33,267 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:10:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2021-05-03 00:10:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-03 00:10:33,267 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:33,268 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:10:33,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-05-03 00:10:33,268 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:33,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1192174735, now seen corresponding path program 23 times [2021-05-03 00:10:33,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:33,268 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [174654052] [2021-05-03 00:10:33,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:33,276 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_696 999999) (<= 500000 v_main_~x~0_696)) InVars {main_~x~0=v_main_~x~0_696} OutVars{main_~x~0=v_main_~x~0_696} AuxVars[] AssignedVars[] [2021-05-03 00:10:33,279 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:33,280 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:33,282 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:33,293 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:33,296 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:33,325 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:33,345 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_698 500000) (< v_main_~x~0_698 999999)) InVars {main_~x~0=v_main_~x~0_698} OutVars{main_~x~0=v_main_~x~0_698} AuxVars[] AssignedVars[] [2021-05-03 00:10:33,347 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:33,357 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:33,361 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:33,368 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:33,378 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:33,379 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_700 500000) InVars {main_~x~0=v_main_~x~0_700} OutVars{main_~x~0=v_main_~x~0_700} AuxVars[] AssignedVars[] [2021-05-03 00:10:33,382 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:33,389 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:33,394 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:33,400 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:33,411 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_702 1000000) (<= 500000 v_main_~x~0_702)) InVars {main_~x~0=v_main_~x~0_702} OutVars{main_~x~0=v_main_~x~0_702} AuxVars[] AssignedVars[] [2021-05-03 00:10:33,414 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:33,415 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:33,417 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:33,428 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:33,431 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:33,458 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:33,477 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:33,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:33,839 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:10:33,840 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:33,841 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:35,141 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:35,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [174654052] [2021-05-03 00:10:35,141 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [174654052] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:35,141 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:35,142 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2021-05-03 00:10:35,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514939452] [2021-05-03 00:10:35,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2021-05-03 00:10:35,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:35,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-05-03 00:10:35,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1514, Invalid=3456, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:10:35,143 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:10:40,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:40,264 INFO L93 Difference]: Finished difference Result 245 states and 256 transitions. [2021-05-03 00:10:40,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-05-03 00:10:40,265 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:10:40,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:40,266 INFO L225 Difference]: With dead ends: 245 [2021-05-03 00:10:40,266 INFO L226 Difference]: Without dead ends: 131 [2021-05-03 00:10:40,268 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5403 ImplicationChecksByTransitivity, 4753.0ms TimeCoverageRelationStatistics Valid=4536, Invalid=14646, Unknown=0, NotChecked=0, Total=19182 [2021-05-03 00:10:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-03 00:10:40,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-05-03 00:10:40,279 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:10:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 134 transitions. [2021-05-03 00:10:40,280 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 134 transitions. Word has length 125 [2021-05-03 00:10:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:40,280 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 134 transitions. [2021-05-03 00:10:40,281 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:10:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2021-05-03 00:10:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-05-03 00:10:40,281 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:40,281 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:10:40,282 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-05-03 00:10:40,282 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:40,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:40,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2075715492, now seen corresponding path program 24 times [2021-05-03 00:10:40,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:40,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2048744277] [2021-05-03 00:10:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:40,289 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_751) (< v_main_~x~0_751 999999)) InVars {main_~x~0=v_main_~x~0_751} OutVars{main_~x~0=v_main_~x~0_751} AuxVars[] AssignedVars[] [2021-05-03 00:10:40,292 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:40,312 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:40,314 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:40,326 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:40,328 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:40,342 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:40,361 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_753 500000) (< v_main_~x~0_753 999999)) InVars {main_~x~0=v_main_~x~0_753} OutVars{main_~x~0=v_main_~x~0_753} AuxVars[] AssignedVars[] [2021-05-03 00:10:40,362 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:40,379 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:40,386 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:40,395 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:40,409 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:40,411 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_755 500000) InVars {main_~x~0=v_main_~x~0_755} OutVars{main_~x~0=v_main_~x~0_755} AuxVars[] AssignedVars[] [2021-05-03 00:10:40,413 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:40,422 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:40,428 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:40,437 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:40,452 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_757) (< v_main_~x~0_757 1000000)) InVars {main_~x~0=v_main_~x~0_757} OutVars{main_~x~0=v_main_~x~0_757} AuxVars[] AssignedVars[] [2021-05-03 00:10:40,454 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:40,455 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:40,457 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:40,473 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:40,476 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:40,508 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:40,526 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:40,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:40,905 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:10:40,907 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:40,908 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:42,233 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:42,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2048744277] [2021-05-03 00:10:42,234 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2048744277] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:42,234 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:42,234 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2021-05-03 00:10:42,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362787365] [2021-05-03 00:10:42,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2021-05-03 00:10:42,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:42,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-05-03 00:10:42,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1689, Invalid=3861, Unknown=0, NotChecked=0, Total=5550 [2021-05-03 00:10:42,236 INFO L87 Difference]: Start difference. First operand 131 states and 134 transitions. Second operand has 74 states, 74 states have (on average 1.662162162162162) internal successors, (123), 73 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:47,719 INFO L93 Difference]: Finished difference Result 255 states and 266 transitions. [2021-05-03 00:10:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-05-03 00:10:47,720 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.662162162162162) internal successors, (123), 73 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 130 [2021-05-03 00:10:47,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:47,720 INFO L225 Difference]: With dead ends: 255 [2021-05-03 00:10:47,720 INFO L226 Difference]: Without dead ends: 136 [2021-05-03 00:10:47,722 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5959 ImplicationChecksByTransitivity, 5067.7ms TimeCoverageRelationStatistics Valid=5010, Invalid=16160, Unknown=0, NotChecked=0, Total=21170 [2021-05-03 00:10:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-05-03 00:10:47,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2021-05-03 00:10:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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:10:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 139 transitions. [2021-05-03 00:10:47,732 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 139 transitions. Word has length 130 [2021-05-03 00:10:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:47,733 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 139 transitions. [2021-05-03 00:10:47,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 74 states, 74 states have (on average 1.662162162162162) internal successors, (123), 73 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 139 transitions. [2021-05-03 00:10:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-05-03 00:10:47,733 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:47,734 INFO L523 BasicCegarLoop]: trace histogram [49, 46, 25, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:10:47,734 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-05-03 00:10:47,734 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:47,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:47,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1989923453, now seen corresponding path program 25 times [2021-05-03 00:10:47,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:47,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [296222445] [2021-05-03 00:10:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:47,743 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_808) (< v_main_~x~0_808 999999)) InVars {main_~x~0=v_main_~x~0_808} OutVars{main_~x~0=v_main_~x~0_808} AuxVars[] AssignedVars[] [2021-05-03 00:10:47,748 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:47,769 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:47,771 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:47,784 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:47,786 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:47,802 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:47,824 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_810 999999) (< v_main_~x~0_810 500000)) InVars {main_~x~0=v_main_~x~0_810} OutVars{main_~x~0=v_main_~x~0_810} AuxVars[] AssignedVars[] [2021-05-03 00:10:47,826 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:47,834 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:47,840 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:47,848 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:47,860 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:47,861 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_812 500000) InVars {main_~x~0=v_main_~x~0_812} OutVars{main_~x~0=v_main_~x~0_812} AuxVars[] AssignedVars[] [2021-05-03 00:10:47,863 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:47,871 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:47,876 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:47,885 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:47,899 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_814 1000000) (<= 500000 v_main_~x~0_814)) InVars {main_~x~0=v_main_~x~0_814} OutVars{main_~x~0=v_main_~x~0_814} AuxVars[] AssignedVars[] [2021-05-03 00:10:47,901 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:47,922 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:47,924 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:47,938 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:47,941 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:47,957 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:47,975 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:48,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:48,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:10:48,520 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:48,598 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:48,598 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [296222445] [2021-05-03 00:10:48,598 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [296222445] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:48,598 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:48,598 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:10:48,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855670255] [2021-05-03 00:10:48,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:10:48,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:48,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:10:48,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=697, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:10:48,599 INFO L87 Difference]: Start difference. First operand 136 states and 139 transitions. Second operand has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:49,723 INFO L93 Difference]: Finished difference Result 263 states and 271 transitions. [2021-05-03 00:10:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:10:49,724 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2021-05-03 00:10:49,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:49,724 INFO L225 Difference]: With dead ends: 263 [2021-05-03 00:10:49,725 INFO L226 Difference]: Without dead ends: 139 [2021-05-03 00:10:49,725 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 1495.6ms TimeCoverageRelationStatistics Valid=1550, Invalid=2740, Unknown=0, NotChecked=0, Total=4290 [2021-05-03 00:10:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-03 00:10:49,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-05-03 00:10:49,734 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:10:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2021-05-03 00:10:49,735 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 135 [2021-05-03 00:10:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:49,735 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2021-05-03 00:10:49,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.303030303030303) internal successors, (43), 32 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2021-05-03 00:10:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-05-03 00:10:49,736 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:49,736 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:10:49,736 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-05-03 00:10:49,736 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:49,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:49,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2034429193, now seen corresponding path program 26 times [2021-05-03 00:10:49,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:49,737 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2105431621] [2021-05-03 00:10:49,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:49,743 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_822 999999) (<= 500000 v_main_~x~0_822)) InVars {main_~x~0=v_main_~x~0_822} OutVars{main_~x~0=v_main_~x~0_822} AuxVars[] AssignedVars[] [2021-05-03 00:10:49,746 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:49,747 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:49,749 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:49,758 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:49,760 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:49,795 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:49,816 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_824 500000) (< v_main_~x~0_824 999999)) InVars {main_~x~0=v_main_~x~0_824} OutVars{main_~x~0=v_main_~x~0_824} AuxVars[] AssignedVars[] [2021-05-03 00:10:49,821 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:49,822 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:49,827 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:49,841 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:49,851 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:49,853 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_826 500000) InVars {main_~x~0=v_main_~x~0_826} OutVars{main_~x~0=v_main_~x~0_826} AuxVars[] AssignedVars[] [2021-05-03 00:10:49,854 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:49,874 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:49,880 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:49,887 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:49,900 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_828) (< v_main_~x~0_828 1000000)) InVars {main_~x~0=v_main_~x~0_828} OutVars{main_~x~0=v_main_~x~0_828} AuxVars[] AssignedVars[] [2021-05-03 00:10:49,902 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:49,903 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:49,906 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:49,916 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:49,919 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:49,947 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:49,966 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:50,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:50,380 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:10:50,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:50,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:51,843 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:51,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2105431621] [2021-05-03 00:10:51,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2105431621] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:51,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:51,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2021-05-03 00:10:51,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997771398] [2021-05-03 00:10:51,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-03 00:10:51,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:51,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-03 00:10:51,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1847, Invalid=4159, Unknown=0, NotChecked=0, Total=6006 [2021-05-03 00:10:51,845 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:10:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:57,701 INFO L93 Difference]: Finished difference Result 269 states and 280 transitions. [2021-05-03 00:10:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-05-03 00:10:57,705 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:10:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:57,706 INFO L225 Difference]: With dead ends: 269 [2021-05-03 00:10:57,706 INFO L226 Difference]: Without dead ends: 144 [2021-05-03 00:10:57,709 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6618 ImplicationChecksByTransitivity, 5516.7ms TimeCoverageRelationStatistics Valid=5535, Invalid=17721, Unknown=0, NotChecked=0, Total=23256 [2021-05-03 00:10:57,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-05-03 00:10:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-05-03 00:10:57,735 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:10:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 147 transitions. [2021-05-03 00:10:57,736 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 147 transitions. Word has length 138 [2021-05-03 00:10:57,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:57,736 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 147 transitions. [2021-05-03 00:10:57,736 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:10:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 147 transitions. [2021-05-03 00:10:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-03 00:10:57,737 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:57,737 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:10:57,737 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-03 00:10:57,737 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:57,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1463290992, now seen corresponding path program 27 times [2021-05-03 00:10:57,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:57,738 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [824035770] [2021-05-03 00:10:57,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:57,744 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_882 999999) (<= 500000 v_main_~x~0_882)) InVars {main_~x~0=v_main_~x~0_882} OutVars{main_~x~0=v_main_~x~0_882} AuxVars[] AssignedVars[] [2021-05-03 00:10:57,746 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:57,747 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:57,749 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:57,759 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:57,761 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:57,792 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:57,814 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_884 999999) (< v_main_~x~0_884 500000)) InVars {main_~x~0=v_main_~x~0_884} OutVars{main_~x~0=v_main_~x~0_884} AuxVars[] AssignedVars[] [2021-05-03 00:10:57,815 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:10:57,816 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:57,821 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:57,835 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:10:57,846 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:57,847 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_886 500000) InVars {main_~x~0=v_main_~x~0_886} OutVars{main_~x~0=v_main_~x~0_886} AuxVars[] AssignedVars[] [2021-05-03 00:10:57,848 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:10:57,856 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:57,860 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:10:57,867 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:10:57,879 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_888 1000000) (<= 500000 v_main_~x~0_888)) InVars {main_~x~0=v_main_~x~0_888} OutVars{main_~x~0=v_main_~x~0_888} AuxVars[] AssignedVars[] [2021-05-03 00:10:57,881 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:10:57,899 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:57,901 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:57,911 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:10:57,913 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:10:57,928 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:10:57,948 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:10:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:58,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:58,379 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:10:58,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:58,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:10:59,929 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:59,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [824035770] [2021-05-03 00:10:59,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [824035770] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:59,929 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:59,929 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2021-05-03 00:10:59,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034460953] [2021-05-03 00:10:59,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2021-05-03 00:10:59,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:59,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2021-05-03 00:10:59,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1986, Invalid=4494, Unknown=0, NotChecked=0, Total=6480 [2021-05-03 00:10:59,931 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:11:06,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:06,308 INFO L93 Difference]: Finished difference Result 279 states and 290 transitions. [2021-05-03 00:11:06,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-05-03 00:11:06,308 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:11:06,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:06,309 INFO L225 Difference]: With dead ends: 279 [2021-05-03 00:11:06,309 INFO L226 Difference]: Without dead ends: 149 [2021-05-03 00:11:06,311 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7156 ImplicationChecksByTransitivity, 5836.7ms TimeCoverageRelationStatistics Valid=5952, Invalid=19170, Unknown=0, NotChecked=0, Total=25122 [2021-05-03 00:11:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-05-03 00:11:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-05-03 00:11:06,319 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:11:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 152 transitions. [2021-05-03 00:11:06,319 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 152 transitions. Word has length 143 [2021-05-03 00:11:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:06,319 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 152 transitions. [2021-05-03 00:11:06,319 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:11:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 152 transitions. [2021-05-03 00:11:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-05-03 00:11:06,320 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:06,320 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:11:06,320 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-05-03 00:11:06,321 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:06,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:06,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1745004099, now seen corresponding path program 28 times [2021-05-03 00:11:06,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:06,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [967784707] [2021-05-03 00:11:06,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:06,330 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_944) (< v_main_~x~0_944 999999)) InVars {main_~x~0=v_main_~x~0_944} OutVars{main_~x~0=v_main_~x~0_944} AuxVars[] AssignedVars[] [2021-05-03 00:11:06,331 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:06,332 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:06,333 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:06,344 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:06,346 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:06,371 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:06,395 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_946 999999) (< v_main_~x~0_946 500000)) InVars {main_~x~0=v_main_~x~0_946} OutVars{main_~x~0=v_main_~x~0_946} AuxVars[] AssignedVars[] [2021-05-03 00:11:06,396 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:06,397 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:06,401 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:06,413 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:06,422 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:06,424 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_948 500000) InVars {main_~x~0=v_main_~x~0_948} OutVars{main_~x~0=v_main_~x~0_948} AuxVars[] AssignedVars[] [2021-05-03 00:11:06,424 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:06,431 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:06,435 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:06,440 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:06,452 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_950) (< v_main_~x~0_950 1000000)) InVars {main_~x~0=v_main_~x~0_950} OutVars{main_~x~0=v_main_~x~0_950} AuxVars[] AssignedVars[] [2021-05-03 00:11:06,454 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:06,469 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:06,472 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:06,480 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:06,482 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:06,496 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:06,514 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:06,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:06,962 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:11:06,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:11:06,965 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:11:08,739 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:08,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [967784707] [2021-05-03 00:11:08,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [967784707] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:08,740 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:08,740 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2021-05-03 00:11:08,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714488168] [2021-05-03 00:11:08,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2021-05-03 00:11:08,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:08,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-05-03 00:11:08,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2130, Invalid=4842, Unknown=0, NotChecked=0, Total=6972 [2021-05-03 00:11:08,742 INFO L87 Difference]: Start difference. First operand 149 states and 152 transitions. Second operand has 84 states, 84 states have (on average 1.6547619047619047) internal successors, (139), 83 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:15,292 INFO L93 Difference]: Finished difference Result 289 states and 300 transitions. [2021-05-03 00:11:15,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-05-03 00:11:15,292 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 1.6547619047619047) internal successors, (139), 83 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 148 [2021-05-03 00:11:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:15,293 INFO L225 Difference]: With dead ends: 289 [2021-05-03 00:11:15,293 INFO L226 Difference]: Without dead ends: 154 [2021-05-03 00:11:15,294 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7687 ImplicationChecksByTransitivity, 6247.8ms TimeCoverageRelationStatistics Valid=6384, Invalid=20676, Unknown=0, NotChecked=0, Total=27060 [2021-05-03 00:11:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-05-03 00:11:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-05-03 00:11:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.0268456375838926) internal successors, (153), 149 states have internal predecessors, (153), 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:11:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 157 transitions. [2021-05-03 00:11:15,304 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 157 transitions. Word has length 148 [2021-05-03 00:11:15,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:15,305 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 157 transitions. [2021-05-03 00:11:15,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 84 states, 84 states have (on average 1.6547619047619047) internal successors, (139), 83 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:15,305 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 157 transitions. [2021-05-03 00:11:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-05-03 00:11:15,305 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:15,305 INFO L523 BasicCegarLoop]: trace histogram [56, 52, 29, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:15,306 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-03 00:11:15,306 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:15,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:15,306 INFO L82 PathProgramCache]: Analyzing trace with hash -825886020, now seen corresponding path program 29 times [2021-05-03 00:11:15,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:15,306 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [46872699] [2021-05-03 00:11:15,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:15,315 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1008) (< v_main_~x~0_1008 999999)) InVars {main_~x~0=v_main_~x~0_1008} OutVars{main_~x~0=v_main_~x~0_1008} AuxVars[] AssignedVars[] [2021-05-03 00:11:15,317 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:15,318 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:15,333 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:15,344 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:15,347 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:15,373 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:15,393 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1010 500000) (< v_main_~x~0_1010 999999)) InVars {main_~x~0=v_main_~x~0_1010} OutVars{main_~x~0=v_main_~x~0_1010} AuxVars[] AssignedVars[] [2021-05-03 00:11:15,394 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:15,394 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:15,398 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:15,410 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:15,420 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:15,421 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1012 500000) InVars {main_~x~0=v_main_~x~0_1012} OutVars{main_~x~0=v_main_~x~0_1012} AuxVars[] AssignedVars[] [2021-05-03 00:11:15,422 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:15,429 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:15,433 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:15,439 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:15,450 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1014 1000000) (<= 500000 v_main_~x~0_1014)) InVars {main_~x~0=v_main_~x~0_1014} OutVars{main_~x~0=v_main_~x~0_1014} AuxVars[] AssignedVars[] [2021-05-03 00:11:15,451 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:15,452 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:15,454 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:15,467 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:15,469 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:15,496 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:15,514 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:16,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:16,117 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:11:16,119 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:11:16,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:11:17,899 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:17,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [46872699] [2021-05-03 00:11:17,900 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [46872699] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:17,900 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:17,900 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [87] imperfect sequences [] total 87 [2021-05-03 00:11:17,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657199231] [2021-05-03 00:11:17,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2021-05-03 00:11:17,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:17,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2021-05-03 00:11:17,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2279, Invalid=5203, Unknown=0, NotChecked=0, Total=7482 [2021-05-03 00:11:17,902 INFO L87 Difference]: Start difference. First operand 154 states and 157 transitions. Second operand has 87 states, 87 states have (on average 1.6551724137931034) internal successors, (144), 86 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:25,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:25,098 INFO L93 Difference]: Finished difference Result 299 states and 310 transitions. [2021-05-03 00:11:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-05-03 00:11:25,099 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 1.6551724137931034) internal successors, (144), 86 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2021-05-03 00:11:25,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:25,099 INFO L225 Difference]: With dead ends: 299 [2021-05-03 00:11:25,099 INFO L226 Difference]: Without dead ends: 159 [2021-05-03 00:11:25,101 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8295 ImplicationChecksByTransitivity, 6700.2ms TimeCoverageRelationStatistics Valid=6831, Invalid=22239, Unknown=0, NotChecked=0, Total=29070 [2021-05-03 00:11:25,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-05-03 00:11:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-05-03 00:11:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.025974025974026) internal successors, (158), 154 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 162 transitions. [2021-05-03 00:11:25,113 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 162 transitions. Word has length 153 [2021-05-03 00:11:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:25,113 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 162 transitions. [2021-05-03 00:11:25,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 87 states, 87 states have (on average 1.6551724137931034) internal successors, (144), 86 states have internal predecessors, (144), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 162 transitions. [2021-05-03 00:11:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-05-03 00:11:25,114 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:25,114 INFO L523 BasicCegarLoop]: trace histogram [58, 54, 30, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:25,114 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-05-03 00:11:25,114 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:25,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:25,115 INFO L82 PathProgramCache]: Analyzing trace with hash -273072015, now seen corresponding path program 30 times [2021-05-03 00:11:25,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:25,115 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1253145401] [2021-05-03 00:11:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:25,124 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1074) (< v_main_~x~0_1074 999999)) InVars {main_~x~0=v_main_~x~0_1074} OutVars{main_~x~0=v_main_~x~0_1074} AuxVars[] AssignedVars[] [2021-05-03 00:11:25,126 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:25,127 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:25,129 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:25,137 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:25,139 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:25,170 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:25,189 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1076 500000) (< v_main_~x~0_1076 999999)) InVars {main_~x~0=v_main_~x~0_1076} OutVars{main_~x~0=v_main_~x~0_1076} AuxVars[] AssignedVars[] [2021-05-03 00:11:25,190 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:25,191 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:25,195 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:25,206 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:25,216 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:25,218 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1078 500000) InVars {main_~x~0=v_main_~x~0_1078} OutVars{main_~x~0=v_main_~x~0_1078} AuxVars[] AssignedVars[] [2021-05-03 00:11:25,218 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:25,219 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:25,223 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:25,235 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:25,247 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1080) (< v_main_~x~0_1080 1000000)) InVars {main_~x~0=v_main_~x~0_1080} OutVars{main_~x~0=v_main_~x~0_1080} AuxVars[] AssignedVars[] [2021-05-03 00:11:25,255 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:25,256 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:25,258 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:25,269 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:25,271 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:25,296 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:25,315 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:25,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:25,932 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:11:25,933 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:11:25,934 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:11:27,806 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:27,806 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1253145401] [2021-05-03 00:11:27,806 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1253145401] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:27,806 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:27,806 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [90] imperfect sequences [] total 90 [2021-05-03 00:11:27,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344287613] [2021-05-03 00:11:27,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2021-05-03 00:11:27,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:27,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2021-05-03 00:11:27,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2433, Invalid=5577, Unknown=0, NotChecked=0, Total=8010 [2021-05-03 00:11:27,808 INFO L87 Difference]: Start difference. First operand 159 states and 162 transitions. Second operand has 90 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 89 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:35,348 INFO L93 Difference]: Finished difference Result 309 states and 320 transitions. [2021-05-03 00:11:35,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-05-03 00:11:35,349 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 89 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 158 [2021-05-03 00:11:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:35,350 INFO L225 Difference]: With dead ends: 309 [2021-05-03 00:11:35,350 INFO L226 Difference]: Without dead ends: 164 [2021-05-03 00:11:35,352 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8896 ImplicationChecksByTransitivity, 7093.5ms TimeCoverageRelationStatistics Valid=7293, Invalid=23859, Unknown=0, NotChecked=0, Total=31152 [2021-05-03 00:11:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-05-03 00:11:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-05-03 00:11:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.0251572327044025) internal successors, (163), 159 states have internal predecessors, (163), 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:11:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 167 transitions. [2021-05-03 00:11:35,366 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 167 transitions. Word has length 158 [2021-05-03 00:11:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:35,367 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 167 transitions. [2021-05-03 00:11:35,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 90 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 89 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 167 transitions. [2021-05-03 00:11:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-05-03 00:11:35,368 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:35,368 INFO L523 BasicCegarLoop]: trace histogram [60, 56, 31, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:35,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-05-03 00:11:35,368 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:35,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:35,368 INFO L82 PathProgramCache]: Analyzing trace with hash -935981304, now seen corresponding path program 31 times [2021-05-03 00:11:35,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:35,369 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [40793909] [2021-05-03 00:11:35,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:35,376 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1142) (< v_main_~x~0_1142 999999)) InVars {main_~x~0=v_main_~x~0_1142} OutVars{main_~x~0=v_main_~x~0_1142} AuxVars[] AssignedVars[] [2021-05-03 00:11:35,378 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:35,379 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:35,381 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:35,391 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:35,393 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:35,421 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:35,455 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1144 999999) (< v_main_~x~0_1144 500000)) InVars {main_~x~0=v_main_~x~0_1144} OutVars{main_~x~0=v_main_~x~0_1144} AuxVars[] AssignedVars[] [2021-05-03 00:11:35,456 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:35,463 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:35,471 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:35,479 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:35,489 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:35,491 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1146 500000) InVars {main_~x~0=v_main_~x~0_1146} OutVars{main_~x~0=v_main_~x~0_1146} AuxVars[] AssignedVars[] [2021-05-03 00:11:35,493 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:35,494 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:35,498 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:35,512 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:35,524 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1148) (< v_main_~x~0_1148 1000000)) InVars {main_~x~0=v_main_~x~0_1148} OutVars{main_~x~0=v_main_~x~0_1148} AuxVars[] AssignedVars[] [2021-05-03 00:11:35,526 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:35,526 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:35,528 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:35,538 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:35,540 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:35,568 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:35,586 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:36,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:36,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:36,109 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:11:36,110 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:11:36,112 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:11:38,083 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:38,083 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [40793909] [2021-05-03 00:11:38,084 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [40793909] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:38,084 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:38,084 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [93] imperfect sequences [] total 93 [2021-05-03 00:11:38,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804461103] [2021-05-03 00:11:38,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2021-05-03 00:11:38,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:38,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2021-05-03 00:11:38,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2592, Invalid=5964, Unknown=0, NotChecked=0, Total=8556 [2021-05-03 00:11:38,085 INFO L87 Difference]: Start difference. First operand 164 states and 167 transitions. Second operand has 93 states, 93 states have (on average 1.6559139784946237) internal successors, (154), 92 states have internal predecessors, (154), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:46,184 INFO L93 Difference]: Finished difference Result 319 states and 330 transitions. [2021-05-03 00:11:46,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2021-05-03 00:11:46,184 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 93 states have (on average 1.6559139784946237) internal successors, (154), 92 states have internal predecessors, (154), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 163 [2021-05-03 00:11:46,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:46,185 INFO L225 Difference]: With dead ends: 319 [2021-05-03 00:11:46,185 INFO L226 Difference]: Without dead ends: 169 [2021-05-03 00:11:46,187 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9518 ImplicationChecksByTransitivity, 7386.9ms TimeCoverageRelationStatistics Valid=7770, Invalid=25536, Unknown=0, NotChecked=0, Total=33306 [2021-05-03 00:11:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-05-03 00:11:46,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-05-03 00:11:46,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.024390243902439) internal successors, (168), 164 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 172 transitions. [2021-05-03 00:11:46,201 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 172 transitions. Word has length 163 [2021-05-03 00:11:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:46,201 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 172 transitions. [2021-05-03 00:11:46,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 93 states, 93 states have (on average 1.6559139784946237) internal successors, (154), 92 states have internal predecessors, (154), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 172 transitions. [2021-05-03 00:11:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-05-03 00:11:46,202 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:46,202 INFO L523 BasicCegarLoop]: trace histogram [62, 58, 32, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:46,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-05-03 00:11:46,203 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:46,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:46,203 INFO L82 PathProgramCache]: Analyzing trace with hash -924884699, now seen corresponding path program 32 times [2021-05-03 00:11:46,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:46,203 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [320304491] [2021-05-03 00:11:46,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:46,210 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1212) (< v_main_~x~0_1212 999999)) InVars {main_~x~0=v_main_~x~0_1212} OutVars{main_~x~0=v_main_~x~0_1212} AuxVars[] AssignedVars[] [2021-05-03 00:11:46,212 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:46,214 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:46,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:46,226 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:46,229 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:46,257 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:46,279 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1214 999999) (< v_main_~x~0_1214 500000)) InVars {main_~x~0=v_main_~x~0_1214} OutVars{main_~x~0=v_main_~x~0_1214} AuxVars[] AssignedVars[] [2021-05-03 00:11:46,280 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:46,281 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:46,285 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:46,298 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:46,308 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:46,310 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1216 500000) InVars {main_~x~0=v_main_~x~0_1216} OutVars{main_~x~0=v_main_~x~0_1216} AuxVars[] AssignedVars[] [2021-05-03 00:11:46,316 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:46,323 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:46,327 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:46,333 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:46,345 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1218) (< v_main_~x~0_1218 1000000)) InVars {main_~x~0=v_main_~x~0_1218} OutVars{main_~x~0=v_main_~x~0_1218} AuxVars[] AssignedVars[] [2021-05-03 00:11:46,347 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:46,348 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:46,351 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:46,363 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:46,365 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:46,390 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:46,408 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:46,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:46,983 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:11:46,984 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:11:46,985 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:11:49,106 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:49,106 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [320304491] [2021-05-03 00:11:49,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [320304491] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:49,107 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:49,107 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2021-05-03 00:11:49,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139542141] [2021-05-03 00:11:49,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2021-05-03 00:11:49,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:49,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2021-05-03 00:11:49,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2819, Invalid=6493, Unknown=0, NotChecked=0, Total=9312 [2021-05-03 00:11:49,108 INFO L87 Difference]: Start difference. First operand 169 states and 172 transitions. Second operand has 96 states, 96 states have (on average 1.65625) internal successors, (159), 95 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:57,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:57,755 INFO L93 Difference]: Finished difference Result 329 states and 340 transitions. [2021-05-03 00:11:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-05-03 00:11:57,756 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.65625) internal successors, (159), 95 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 168 [2021-05-03 00:11:57,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:57,756 INFO L225 Difference]: With dead ends: 329 [2021-05-03 00:11:57,757 INFO L226 Difference]: Without dead ends: 174 [2021-05-03 00:11:57,758 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10250 ImplicationChecksByTransitivity, 7932.7ms TimeCoverageRelationStatistics Valid=8386, Invalid=27524, Unknown=0, NotChecked=0, Total=35910 [2021-05-03 00:11:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-05-03 00:11:57,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-05-03 00:11:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 169 states have (on average 1.0236686390532543) internal successors, (173), 169 states have internal predecessors, (173), 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:11:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 177 transitions. [2021-05-03 00:11:57,772 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 177 transitions. Word has length 168 [2021-05-03 00:11:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:57,772 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 177 transitions. [2021-05-03 00:11:57,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 96 states, 96 states have (on average 1.65625) internal successors, (159), 95 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:11:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 177 transitions. [2021-05-03 00:11:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-05-03 00:11:57,774 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:57,774 INFO L523 BasicCegarLoop]: trace histogram [64, 60, 33, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:57,774 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-05-03 00:11:57,774 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:57,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:57,774 INFO L82 PathProgramCache]: Analyzing trace with hash -96499372, now seen corresponding path program 33 times [2021-05-03 00:11:57,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:57,775 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [206333735] [2021-05-03 00:11:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:57,781 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1284 999999) (<= 500000 v_main_~x~0_1284)) InVars {main_~x~0=v_main_~x~0_1284} OutVars{main_~x~0=v_main_~x~0_1284} AuxVars[] AssignedVars[] [2021-05-03 00:11:57,783 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:57,802 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:57,804 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:57,812 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:57,815 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:57,828 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:57,848 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1286 999999) (< v_main_~x~0_1286 500000)) InVars {main_~x~0=v_main_~x~0_1286} OutVars{main_~x~0=v_main_~x~0_1286} AuxVars[] AssignedVars[] [2021-05-03 00:11:57,850 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:11:57,857 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:57,861 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:57,867 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:11:57,877 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:57,878 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1288 500000) InVars {main_~x~0=v_main_~x~0_1288} OutVars{main_~x~0=v_main_~x~0_1288} AuxVars[] AssignedVars[] [2021-05-03 00:11:57,880 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:11:57,887 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:57,891 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:11:57,897 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:11:57,909 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1290) (< v_main_~x~0_1290 1000000)) InVars {main_~x~0=v_main_~x~0_1290} OutVars{main_~x~0=v_main_~x~0_1290} AuxVars[] AssignedVars[] [2021-05-03 00:11:57,910 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:11:57,926 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:57,940 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:57,971 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:11:57,974 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:11:57,990 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:11:58,011 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:11:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:58,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:58,641 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:11:58,642 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:11:58,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:00,905 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:00,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [206333735] [2021-05-03 00:12:00,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [206333735] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:00,905 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:00,905 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [99] imperfect sequences [] total 99 [2021-05-03 00:12:00,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982759969] [2021-05-03 00:12:00,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2021-05-03 00:12:00,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:00,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2021-05-03 00:12:00,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=6777, Unknown=0, NotChecked=0, Total=9702 [2021-05-03 00:12:00,907 INFO L87 Difference]: Start difference. First operand 174 states and 177 transitions. Second operand has 99 states, 99 states have (on average 1.6565656565656566) internal successors, (164), 98 states have internal predecessors, (164), 2 states have call successors, (3), 3 states have call 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,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:10,166 INFO L93 Difference]: Finished difference Result 339 states and 350 transitions. [2021-05-03 00:12:10,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2021-05-03 00:12:10,167 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 99 states have (on average 1.6565656565656566) internal successors, (164), 98 states have internal predecessors, (164), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2021-05-03 00:12:10,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:10,168 INFO L225 Difference]: With dead ends: 339 [2021-05-03 00:12:10,168 INFO L226 Difference]: Without dead ends: 179 [2021-05-03 00:12:10,169 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10825 ImplicationChecksByTransitivity, 8453.4ms TimeCoverageRelationStatistics Valid=8769, Invalid=29061, Unknown=0, NotChecked=0, Total=37830 [2021-05-03 00:12:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-05-03 00:12:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2021-05-03 00:12:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.0229885057471264) internal successors, (178), 174 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 182 transitions. [2021-05-03 00:12:10,184 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 182 transitions. Word has length 173 [2021-05-03 00:12:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:10,184 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 182 transitions. [2021-05-03 00:12:10,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 99 states, 99 states have (on average 1.6565656565656566) internal successors, (164), 98 states have internal predecessors, (164), 2 states have call successors, (3), 3 states have call 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,184 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 182 transitions. [2021-05-03 00:12:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-05-03 00:12:10,185 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:10,185 INFO L523 BasicCegarLoop]: trace histogram [66, 62, 34, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:10,185 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-05-03 00:12:10,185 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:10,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:10,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1452833753, now seen corresponding path program 34 times [2021-05-03 00:12:10,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:10,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1369556240] [2021-05-03 00:12:10,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:10,193 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1358 999999) (<= 500000 v_main_~x~0_1358)) InVars {main_~x~0=v_main_~x~0_1358} OutVars{main_~x~0=v_main_~x~0_1358} AuxVars[] AssignedVars[] [2021-05-03 00:12:10,195 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:10,213 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:10,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:10,226 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:10,229 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:10,245 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:10,268 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1360 500000) (< v_main_~x~0_1360 999999)) InVars {main_~x~0=v_main_~x~0_1360} OutVars{main_~x~0=v_main_~x~0_1360} AuxVars[] AssignedVars[] [2021-05-03 00:12:10,270 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:10,270 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:10,275 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:10,290 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:10,301 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:10,303 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1362 500000) InVars {main_~x~0=v_main_~x~0_1362} OutVars{main_~x~0=v_main_~x~0_1362} AuxVars[] AssignedVars[] [2021-05-03 00:12:10,304 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:10,313 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:10,318 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:10,325 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:10,339 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1364) (< v_main_~x~0_1364 1000000)) InVars {main_~x~0=v_main_~x~0_1364} OutVars{main_~x~0=v_main_~x~0_1364} AuxVars[] AssignedVars[] [2021-05-03 00:12:10,341 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:10,342 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:10,344 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:10,355 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:10,357 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:10,389 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:10,411 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:11,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:11,086 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,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:11,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:13,627 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:13,627 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1369556240] [2021-05-03 00:12:13,628 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1369556240] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:13,628 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:13,628 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2021-05-03 00:12:13,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815727593] [2021-05-03 00:12:13,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2021-05-03 00:12:13,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:13,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2021-05-03 00:12:13,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3099, Invalid=7203, Unknown=0, NotChecked=0, Total=10302 [2021-05-03 00:12:13,629 INFO L87 Difference]: Start difference. First operand 179 states and 182 transitions. Second operand has 102 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 101 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:23,694 INFO L93 Difference]: Finished difference Result 349 states and 360 transitions. [2021-05-03 00:12:23,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2021-05-03 00:12:23,695 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 101 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 178 [2021-05-03 00:12:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:23,695 INFO L225 Difference]: With dead ends: 349 [2021-05-03 00:12:23,695 INFO L226 Difference]: Without dead ends: 184 [2021-05-03 00:12:23,698 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11510 ImplicationChecksByTransitivity, 9066.5ms TimeCoverageRelationStatistics Valid=9291, Invalid=30909, Unknown=0, NotChecked=0, Total=40200 [2021-05-03 00:12:23,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-05-03 00:12:23,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2021-05-03 00:12:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 179 states have (on average 1.0223463687150838) internal successors, (183), 179 states have internal predecessors, (183), 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:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 187 transitions. [2021-05-03 00:12:23,713 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 187 transitions. Word has length 178 [2021-05-03 00:12:23,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:23,713 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 187 transitions. [2021-05-03 00:12:23,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 102 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 101 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 187 transitions. [2021-05-03 00:12:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-05-03 00:12:23,714 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:23,714 INFO L523 BasicCegarLoop]: trace histogram [68, 64, 35, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:23,714 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-05-03 00:12:23,714 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:23,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:23,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1629902432, now seen corresponding path program 35 times [2021-05-03 00:12:23,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:23,715 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1796888987] [2021-05-03 00:12:23,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:23,723 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1434 999999) (<= 500000 v_main_~x~0_1434)) InVars {main_~x~0=v_main_~x~0_1434} OutVars{main_~x~0=v_main_~x~0_1434} AuxVars[] AssignedVars[] [2021-05-03 00:12:23,725 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:23,726 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:23,729 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:23,738 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:23,740 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:23,767 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:23,787 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1436 999999) (< v_main_~x~0_1436 500000)) InVars {main_~x~0=v_main_~x~0_1436} OutVars{main_~x~0=v_main_~x~0_1436} AuxVars[] AssignedVars[] [2021-05-03 00:12:23,788 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:23,789 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:23,793 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:23,805 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:23,815 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:23,817 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1438 500000) InVars {main_~x~0=v_main_~x~0_1438} OutVars{main_~x~0=v_main_~x~0_1438} AuxVars[] AssignedVars[] [2021-05-03 00:12:23,818 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:23,818 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:23,822 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:23,835 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:23,853 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1440) (< v_main_~x~0_1440 1000000)) InVars {main_~x~0=v_main_~x~0_1440} OutVars{main_~x~0=v_main_~x~0_1440} AuxVars[] AssignedVars[] [2021-05-03 00:12:23,854 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:23,858 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:23,859 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:23,868 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:23,870 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:23,897 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:23,916 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:24,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:24,598 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:24,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:27,211 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:27,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1796888987] [2021-05-03 00:12:27,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1796888987] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:27,211 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:27,211 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [105] imperfect sequences [] total 105 [2021-05-03 00:12:27,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818549182] [2021-05-03 00:12:27,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2021-05-03 00:12:27,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:27,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2021-05-03 00:12:27,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3278, Invalid=7642, Unknown=0, NotChecked=0, Total=10920 [2021-05-03 00:12:27,213 INFO L87 Difference]: Start difference. First operand 184 states and 187 transitions. Second operand has 105 states, 105 states have (on average 1.6571428571428573) internal successors, (174), 104 states have internal predecessors, (174), 2 states have call successors, (3), 3 states have call 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:37,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:37,794 INFO L93 Difference]: Finished difference Result 359 states and 370 transitions. [2021-05-03 00:12:37,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2021-05-03 00:12:37,795 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 1.6571428571428573) internal successors, (174), 104 states have internal predecessors, (174), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 183 [2021-05-03 00:12:37,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:37,796 INFO L225 Difference]: With dead ends: 359 [2021-05-03 00:12:37,796 INFO L226 Difference]: Without dead ends: 189 [2021-05-03 00:12:37,798 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12216 ImplicationChecksByTransitivity, 9576.3ms TimeCoverageRelationStatistics Valid=9828, Invalid=32814, Unknown=0, NotChecked=0, Total=42642 [2021-05-03 00:12:37,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-05-03 00:12:37,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-05-03 00:12:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 184 states have (on average 1.0217391304347827) internal successors, (188), 184 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 192 transitions. [2021-05-03 00:12:37,808 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 192 transitions. Word has length 183 [2021-05-03 00:12:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:37,809 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 192 transitions. [2021-05-03 00:12:37,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 105 states, 105 states have (on average 1.6571428571428573) internal successors, (174), 104 states have internal predecessors, (174), 2 states have call successors, (3), 3 states have call 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:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 192 transitions. [2021-05-03 00:12:37,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-05-03 00:12:37,810 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:37,810 INFO L523 BasicCegarLoop]: trace histogram [70, 66, 36, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:37,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-05-03 00:12:37,810 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:37,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:37,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1523404941, now seen corresponding path program 36 times [2021-05-03 00:12:37,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:37,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1383454983] [2021-05-03 00:12:37,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:37,818 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1512) (< v_main_~x~0_1512 999999)) InVars {main_~x~0=v_main_~x~0_1512} OutVars{main_~x~0=v_main_~x~0_1512} AuxVars[] AssignedVars[] [2021-05-03 00:12:37,820 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:37,840 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:37,842 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:37,853 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:37,856 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:37,874 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:37,901 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1514 500000) (< v_main_~x~0_1514 999999)) InVars {main_~x~0=v_main_~x~0_1514} OutVars{main_~x~0=v_main_~x~0_1514} AuxVars[] AssignedVars[] [2021-05-03 00:12:37,903 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:37,903 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:37,909 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:37,933 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:37,948 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:37,950 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1516 500000) InVars {main_~x~0=v_main_~x~0_1516} OutVars{main_~x~0=v_main_~x~0_1516} AuxVars[] AssignedVars[] [2021-05-03 00:12:37,951 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:37,952 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:37,958 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:37,974 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:37,991 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1518) (< v_main_~x~0_1518 1000000)) InVars {main_~x~0=v_main_~x~0_1518} OutVars{main_~x~0=v_main_~x~0_1518} AuxVars[] AssignedVars[] [2021-05-03 00:12:37,993 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:37,994 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:37,996 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:38,011 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:38,013 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:38,049 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:38,075 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:38,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:38,928 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:38,930 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:39,005 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:39,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1383454983] [2021-05-03 00:12:39,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1383454983] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:39,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:39,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-03 00:12:39,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866262573] [2021-05-03 00:12:39,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-03 00:12:39,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:39,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-03 00:12:39,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1033, Invalid=1223, Unknown=0, NotChecked=0, Total=2256 [2021-05-03 00:12:39,007 INFO L87 Difference]: Start difference. First operand 189 states and 192 transitions. Second operand has 45 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 44 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call 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,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:40,775 INFO L93 Difference]: Finished difference Result 367 states and 375 transitions. [2021-05-03 00:12:40,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-03 00:12:40,775 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 44 states have internal predecessors, (56), 2 states have call successors, (3), 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 188 [2021-05-03 00:12:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:40,776 INFO L225 Difference]: With dead ends: 367 [2021-05-03 00:12:40,776 INFO L226 Difference]: Without dead ends: 192 [2021-05-03 00:12:40,777 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 2428.1ms TimeCoverageRelationStatistics Valid=2914, Invalid=5096, Unknown=0, NotChecked=0, Total=8010 [2021-05-03 00:12:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-05-03 00:12:40,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2021-05-03 00:12:40,786 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:12:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 195 transitions. [2021-05-03 00:12:40,787 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 195 transitions. Word has length 188 [2021-05-03 00:12:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:40,787 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 195 transitions. [2021-05-03 00:12:40,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 44 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call 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,787 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 195 transitions. [2021-05-03 00:12:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-05-03 00:12:40,788 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:40,788 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:12:40,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-05-03 00:12:40,788 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:40,788 INFO L82 PathProgramCache]: Analyzing trace with hash -599120941, now seen corresponding path program 37 times [2021-05-03 00:12:40,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:40,788 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1467360678] [2021-05-03 00:12:40,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:40,801 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1527 999999) (<= 500000 v_main_~x~0_1527)) InVars {main_~x~0=v_main_~x~0_1527} OutVars{main_~x~0=v_main_~x~0_1527} AuxVars[] AssignedVars[] [2021-05-03 00:12:40,803 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:40,823 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:40,825 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:40,835 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:40,838 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:40,856 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:40,883 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1529 500000) (< v_main_~x~0_1529 999999)) InVars {main_~x~0=v_main_~x~0_1529} OutVars{main_~x~0=v_main_~x~0_1529} AuxVars[] AssignedVars[] [2021-05-03 00:12:40,884 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:40,885 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:40,891 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:40,908 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:40,923 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:40,924 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1531 500000) InVars {main_~x~0=v_main_~x~0_1531} OutVars{main_~x~0=v_main_~x~0_1531} AuxVars[] AssignedVars[] [2021-05-03 00:12:40,926 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:40,926 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:40,932 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:40,948 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:40,965 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1533) (< v_main_~x~0_1533 1000000)) InVars {main_~x~0=v_main_~x~0_1533} OutVars{main_~x~0=v_main_~x~0_1533} AuxVars[] AssignedVars[] [2021-05-03 00:12:40,969 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:40,991 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:40,996 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:41,007 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:41,010 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:41,030 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:41,057 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:41,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:41,833 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,834 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:41,836 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:44,644 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:44,644 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1467360678] [2021-05-03 00:12:44,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1467360678] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:44,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:44,644 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [109] imperfect sequences [] total 109 [2021-05-03 00:12:44,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762965727] [2021-05-03 00:12:44,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2021-05-03 00:12:44,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:44,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2021-05-03 00:12:44,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3569, Invalid=8203, Unknown=0, NotChecked=0, Total=11772 [2021-05-03 00:12:44,646 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:12:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:56,091 INFO L93 Difference]: Finished difference Result 373 states and 384 transitions. [2021-05-03 00:12:56,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-05-03 00:12:56,091 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:12:56,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:56,092 INFO L225 Difference]: With dead ends: 373 [2021-05-03 00:12:56,092 INFO L226 Difference]: Without dead ends: 197 [2021-05-03 00:12:56,095 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13254 ImplicationChecksByTransitivity, 10346.2ms TimeCoverageRelationStatistics Valid=10701, Invalid=35309, Unknown=0, NotChecked=0, Total=46010 [2021-05-03 00:12:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-05-03 00:12:56,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-05-03 00:12:56,110 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:12:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 200 transitions. [2021-05-03 00:12:56,110 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 200 transitions. Word has length 191 [2021-05-03 00:12:56,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:56,111 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 200 transitions. [2021-05-03 00:12:56,111 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:12:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 200 transitions. [2021-05-03 00:12:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-05-03 00:12:56,112 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:56,112 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:12:56,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-05-03 00:12:56,112 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2102887354, now seen corresponding path program 38 times [2021-05-03 00:12:56,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:56,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [170866313] [2021-05-03 00:12:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:56,120 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1608 999999) (<= 500000 v_main_~x~0_1608)) InVars {main_~x~0=v_main_~x~0_1608} OutVars{main_~x~0=v_main_~x~0_1608} AuxVars[] AssignedVars[] [2021-05-03 00:12:56,122 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:56,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:56,145 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:56,157 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:56,160 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:56,178 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:56,206 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1610 500000) (< v_main_~x~0_1610 999999)) InVars {main_~x~0=v_main_~x~0_1610} OutVars{main_~x~0=v_main_~x~0_1610} AuxVars[] AssignedVars[] [2021-05-03 00:12:56,208 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:56,209 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:56,215 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:56,229 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:56,240 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:56,241 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1612 500000) InVars {main_~x~0=v_main_~x~0_1612} OutVars{main_~x~0=v_main_~x~0_1612} AuxVars[] AssignedVars[] [2021-05-03 00:12:56,242 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:56,243 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:56,247 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:56,260 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:56,273 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1614 1000000) (<= 500000 v_main_~x~0_1614)) InVars {main_~x~0=v_main_~x~0_1614} OutVars{main_~x~0=v_main_~x~0_1614} AuxVars[] AssignedVars[] [2021-05-03 00:12:56,274 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:56,291 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:56,293 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:56,301 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:56,304 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:56,318 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:56,338 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:57,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:57,277 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:12:57,372 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:57,372 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [170866313] [2021-05-03 00:12:57,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [170866313] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:57,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:57,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-03 00:12:57,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821711518] [2021-05-03 00:12:57,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-03 00:12:57,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:57,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-03 00:12:57,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1169, Invalid=1381, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:12:57,373 INFO L87 Difference]: Start difference. First operand 197 states and 200 transitions. Second operand has 48 states, 48 states have (on average 1.25) internal successors, (60), 47 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:59,388 INFO L93 Difference]: Finished difference Result 381 states and 389 transitions. [2021-05-03 00:12:59,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-03 00:12:59,389 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.25) internal successors, (60), 47 states have internal predecessors, (60), 2 states have call successors, (3), 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:12:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:59,390 INFO L225 Difference]: With dead ends: 381 [2021-05-03 00:12:59,390 INFO L226 Difference]: Without dead ends: 200 [2021-05-03 00:12:59,391 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 2730.9ms TimeCoverageRelationStatistics Valid=3312, Invalid=5808, Unknown=0, NotChecked=0, Total=9120 [2021-05-03 00:12:59,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-05-03 00:12:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2021-05-03 00:12:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 195 states have (on average 1.0205128205128204) internal successors, (199), 195 states have internal predecessors, (199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 203 transitions. [2021-05-03 00:12:59,401 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 203 transitions. Word has length 196 [2021-05-03 00:12:59,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:59,401 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 203 transitions. [2021-05-03 00:12:59,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 48 states have (on average 1.25) internal successors, (60), 47 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:12:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 203 transitions. [2021-05-03 00:12:59,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-05-03 00:12:59,402 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:59,402 INFO L523 BasicCegarLoop]: trace histogram [74, 68, 39, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:59,402 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-05-03 00:12:59,402 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:59,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:59,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1918085446, now seen corresponding path program 39 times [2021-05-03 00:12:59,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:59,403 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1290693101] [2021-05-03 00:12:59,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:59,411 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1624) (< v_main_~x~0_1624 999999)) InVars {main_~x~0=v_main_~x~0_1624} OutVars{main_~x~0=v_main_~x~0_1624} AuxVars[] AssignedVars[] [2021-05-03 00:12:59,412 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:59,429 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:59,431 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:59,439 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:59,441 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:59,455 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:59,475 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1626 500000) (< v_main_~x~0_1626 999999)) InVars {main_~x~0=v_main_~x~0_1626} OutVars{main_~x~0=v_main_~x~0_1626} AuxVars[] AssignedVars[] [2021-05-03 00:12:59,477 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:12:59,477 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:59,482 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:59,494 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:12:59,506 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:59,507 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1628 500000) InVars {main_~x~0=v_main_~x~0_1628} OutVars{main_~x~0=v_main_~x~0_1628} AuxVars[] AssignedVars[] [2021-05-03 00:12:59,508 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:12:59,515 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:59,521 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:12:59,549 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:12:59,563 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1630) (< v_main_~x~0_1630 1000000)) InVars {main_~x~0=v_main_~x~0_1630} OutVars{main_~x~0=v_main_~x~0_1630} AuxVars[] AssignedVars[] [2021-05-03 00:12:59,565 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:12:59,565 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:59,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:59,585 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:12:59,588 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:12:59,626 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:12:59,658 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:12:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:00,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:00,635 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:00,637 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:03,686 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:03,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1290693101] [2021-05-03 00:13:03,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1290693101] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:03,687 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:03,687 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [113] imperfect sequences [] total 113 [2021-05-03 00:13:03,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495230588] [2021-05-03 00:13:03,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2021-05-03 00:13:03,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:03,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2021-05-03 00:13:03,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3872, Invalid=8784, Unknown=0, NotChecked=0, Total=12656 [2021-05-03 00:13:03,689 INFO L87 Difference]: Start difference. First operand 200 states and 203 transitions. Second operand has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 2 states have call successors, (3), 3 states have call 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:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:16,170 INFO L93 Difference]: Finished difference Result 387 states and 398 transitions. [2021-05-03 00:13:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2021-05-03 00:13:16,170 INFO L78 Accepts]: Start accepts. Automaton has has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 2 states have call successors, (3), 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 199 [2021-05-03 00:13:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:16,171 INFO L225 Difference]: With dead ends: 387 [2021-05-03 00:13:16,171 INFO L226 Difference]: Without dead ends: 205 [2021-05-03 00:13:16,173 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14332 ImplicationChecksByTransitivity, 11427.0ms TimeCoverageRelationStatistics Valid=11610, Invalid=37896, Unknown=0, NotChecked=0, Total=49506 [2021-05-03 00:13:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-05-03 00:13:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2021-05-03 00:13:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.02) internal successors, (204), 200 states have internal predecessors, (204), 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:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 208 transitions. [2021-05-03 00:13:16,183 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 208 transitions. Word has length 199 [2021-05-03 00:13:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:16,184 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 208 transitions. [2021-05-03 00:13:16,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 2 states have call successors, (3), 3 states have call 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:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 208 transitions. [2021-05-03 00:13:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-05-03 00:13:16,185 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:16,185 INFO L523 BasicCegarLoop]: trace histogram [76, 70, 40, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:16,185 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-05-03 00:13:16,185 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:16,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:16,185 INFO L82 PathProgramCache]: Analyzing trace with hash -525184089, now seen corresponding path program 40 times [2021-05-03 00:13:16,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:16,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1801881825] [2021-05-03 00:13:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:16,198 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1708) (< v_main_~x~0_1708 999999)) InVars {main_~x~0=v_main_~x~0_1708} OutVars{main_~x~0=v_main_~x~0_1708} AuxVars[] AssignedVars[] [2021-05-03 00:13:16,200 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:16,201 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:16,202 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:16,215 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:16,217 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:16,245 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:16,269 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1710 500000) (< v_main_~x~0_1710 999999)) InVars {main_~x~0=v_main_~x~0_1710} OutVars{main_~x~0=v_main_~x~0_1710} AuxVars[] AssignedVars[] [2021-05-03 00:13:16,271 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:16,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:16,284 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:16,298 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:16,309 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:16,311 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1712 500000) InVars {main_~x~0=v_main_~x~0_1712} OutVars{main_~x~0=v_main_~x~0_1712} AuxVars[] AssignedVars[] [2021-05-03 00:13:16,312 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:16,319 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:16,324 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:16,331 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:16,344 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_1714) (< v_main_~x~0_1714 1000000)) InVars {main_~x~0=v_main_~x~0_1714} OutVars{main_~x~0=v_main_~x~0_1714} AuxVars[] AssignedVars[] [2021-05-03 00:13:16,345 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:16,346 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:16,347 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:16,357 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:16,360 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:16,391 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:16,411 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:17,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:17,379 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:17,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:20,592 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:20,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1801881825] [2021-05-03 00:13:20,593 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1801881825] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:20,593 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:20,593 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [116] imperfect sequences [] total 116 [2021-05-03 00:13:20,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353673214] [2021-05-03 00:13:20,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states [2021-05-03 00:13:20,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:20,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2021-05-03 00:13:20,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4072, Invalid=9268, Unknown=0, NotChecked=0, Total=13340 [2021-05-03 00:13:20,594 INFO L87 Difference]: Start difference. First operand 205 states and 208 transitions. Second operand has 116 states, 116 states have (on average 1.646551724137931) internal successors, (191), 115 states have internal predecessors, (191), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:33,794 INFO L93 Difference]: Finished difference Result 397 states and 408 transitions. [2021-05-03 00:13:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2021-05-03 00:13:33,794 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 116 states have (on average 1.646551724137931) internal successors, (191), 115 states have internal predecessors, (191), 2 states have call successors, (3), 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 204 [2021-05-03 00:13:33,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:33,795 INFO L225 Difference]: With dead ends: 397 [2021-05-03 00:13:33,795 INFO L226 Difference]: Without dead ends: 210 [2021-05-03 00:13:33,798 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15119 ImplicationChecksByTransitivity, 12008.0ms TimeCoverageRelationStatistics Valid=12210, Invalid=40002, Unknown=0, NotChecked=0, Total=52212 [2021-05-03 00:13:33,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-05-03 00:13:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-05-03 00:13:33,809 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:13:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 213 transitions. [2021-05-03 00:13:33,809 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 213 transitions. Word has length 204 [2021-05-03 00:13:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:33,810 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 213 transitions. [2021-05-03 00:13:33,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 116 states, 116 states have (on average 1.646551724137931) internal successors, (191), 115 states have internal predecessors, (191), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:13:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 213 transitions. [2021-05-03 00:13:33,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-05-03 00:13:33,811 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:33,811 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:13:33,811 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-05-03 00:13:33,811 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:33,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:33,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2064695826, now seen corresponding path program 41 times [2021-05-03 00:13:33,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:33,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1477389345] [2021-05-03 00:13:33,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:33,819 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1794 999999) (<= 500000 v_main_~x~0_1794)) InVars {main_~x~0=v_main_~x~0_1794} OutVars{main_~x~0=v_main_~x~0_1794} AuxVars[] AssignedVars[] [2021-05-03 00:13:33,823 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:33,840 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:33,841 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:33,851 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:33,854 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:33,869 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:33,890 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1796 500000) (< v_main_~x~0_1796 999999)) InVars {main_~x~0=v_main_~x~0_1796} OutVars{main_~x~0=v_main_~x~0_1796} AuxVars[] AssignedVars[] [2021-05-03 00:13:33,892 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:33,892 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:33,897 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:33,910 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:33,922 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:33,925 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1798 500000) InVars {main_~x~0=v_main_~x~0_1798} OutVars{main_~x~0=v_main_~x~0_1798} AuxVars[] AssignedVars[] [2021-05-03 00:13:33,926 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:33,926 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:33,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:33,945 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:33,958 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1800 1000000) (<= 500000 v_main_~x~0_1800)) InVars {main_~x~0=v_main_~x~0_1800} OutVars{main_~x~0=v_main_~x~0_1800} AuxVars[] AssignedVars[] [2021-05-03 00:13:33,968 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:33,969 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:33,985 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:33,996 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:33,999 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:34,028 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:34,048 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:35,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:35,174 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:35,175 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:35,177 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:38,696 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:38,696 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1477389345] [2021-05-03 00:13:38,696 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1477389345] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:38,696 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:38,696 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [119] imperfect sequences [] total 119 [2021-05-03 00:13:38,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328366994] [2021-05-03 00:13:38,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2021-05-03 00:13:38,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:38,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2021-05-03 00:13:38,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4354, Invalid=9926, Unknown=0, NotChecked=0, Total=14280 [2021-05-03 00:13:38,698 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:13:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:53,033 INFO L93 Difference]: Finished difference Result 407 states and 418 transitions. [2021-05-03 00:13:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2021-05-03 00:13:53,034 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:13:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:53,035 INFO L225 Difference]: With dead ends: 407 [2021-05-03 00:13:53,035 INFO L226 Difference]: Without dead ends: 215 [2021-05-03 00:13:53,038 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16035 ImplicationChecksByTransitivity, 13080.4ms TimeCoverageRelationStatistics Valid=12977, Invalid=42483, Unknown=0, NotChecked=0, Total=55460 [2021-05-03 00:13:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-05-03 00:13:53,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2021-05-03 00:13:53,054 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:13:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 218 transitions. [2021-05-03 00:13:53,054 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 218 transitions. Word has length 209 [2021-05-03 00:13:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:53,055 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 218 transitions. [2021-05-03 00:13:53,055 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:13:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 218 transitions. [2021-05-03 00:13:53,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-05-03 00:13:53,056 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:53,056 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:13:53,056 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-05-03 00:13:53,056 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:53,057 INFO L82 PathProgramCache]: Analyzing trace with hash 706306011, now seen corresponding path program 42 times [2021-05-03 00:13:53,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:53,057 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1657590178] [2021-05-03 00:13:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:53,064 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1882 999999) (<= 500000 v_main_~x~0_1882)) InVars {main_~x~0=v_main_~x~0_1882} OutVars{main_~x~0=v_main_~x~0_1882} AuxVars[] AssignedVars[] [2021-05-03 00:13:53,066 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:53,088 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:53,091 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:53,101 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:53,103 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:53,119 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:53,141 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1884 500000) (< v_main_~x~0_1884 999999)) InVars {main_~x~0=v_main_~x~0_1884} OutVars{main_~x~0=v_main_~x~0_1884} AuxVars[] AssignedVars[] [2021-05-03 00:13:53,142 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:13:53,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:53,148 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:53,161 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:13:53,173 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:53,175 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1886 500000) InVars {main_~x~0=v_main_~x~0_1886} OutVars{main_~x~0=v_main_~x~0_1886} AuxVars[] AssignedVars[] [2021-05-03 00:13:53,176 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:13:53,183 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:53,188 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:13:53,195 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:13:53,208 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1888 1000000) (<= 500000 v_main_~x~0_1888)) InVars {main_~x~0=v_main_~x~0_1888} OutVars{main_~x~0=v_main_~x~0_1888} AuxVars[] AssignedVars[] [2021-05-03 00:13:53,209 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:13:53,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:53,229 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:53,240 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:13:53,242 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:13:53,259 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:13:53,280 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:13:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:54,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:54,269 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:54,270 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:54,272 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:13:58,066 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:58,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1657590178] [2021-05-03 00:13:58,066 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1657590178] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:58,066 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:58,067 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [122] imperfect sequences [] total 122 [2021-05-03 00:13:58,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576260379] [2021-05-03 00:13:58,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states [2021-05-03 00:13:58,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:58,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2021-05-03 00:13:58,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4487, Invalid=10275, Unknown=0, NotChecked=0, Total=14762 [2021-05-03 00:13:58,068 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:14:13,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:13,544 INFO L93 Difference]: Finished difference Result 417 states and 428 transitions. [2021-05-03 00:14:13,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2021-05-03 00:14:13,545 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:14:13,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:13,546 INFO L225 Difference]: With dead ends: 417 [2021-05-03 00:14:13,546 INFO L226 Difference]: Without dead ends: 220 [2021-05-03 00:14:13,548 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16756 ImplicationChecksByTransitivity, 13805.0ms TimeCoverageRelationStatistics Valid=13455, Invalid=44385, Unknown=0, NotChecked=0, Total=57840 [2021-05-03 00:14:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-05-03 00:14:13,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-05-03 00:14:13,563 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:14:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 223 transitions. [2021-05-03 00:14:13,564 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 223 transitions. Word has length 214 [2021-05-03 00:14:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:13,564 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 223 transitions. [2021-05-03 00:14:13,564 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:14:13,564 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 223 transitions. [2021-05-03 00:14:13,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-05-03 00:14:13,565 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:13,565 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:14:13,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-05-03 00:14:13,565 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:13,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:13,566 INFO L82 PathProgramCache]: Analyzing trace with hash 744841438, now seen corresponding path program 43 times [2021-05-03 00:14:13,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:13,566 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [14631399] [2021-05-03 00:14:13,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:13,575 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1972 999999) (<= 500000 v_main_~x~0_1972)) InVars {main_~x~0=v_main_~x~0_1972} OutVars{main_~x~0=v_main_~x~0_1972} AuxVars[] AssignedVars[] [2021-05-03 00:14:13,577 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:13,578 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:13,580 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:13,592 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:13,595 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:13,631 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:13,670 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1974 500000) (< v_main_~x~0_1974 999999)) InVars {main_~x~0=v_main_~x~0_1974} OutVars{main_~x~0=v_main_~x~0_1974} AuxVars[] AssignedVars[] [2021-05-03 00:14:13,672 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:14:13,673 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:13,685 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:13,703 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:14:13,719 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:13,722 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1976 500000) InVars {main_~x~0=v_main_~x~0_1976} OutVars{main_~x~0=v_main_~x~0_1976} AuxVars[] AssignedVars[] [2021-05-03 00:14:13,723 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:14:13,732 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:13,737 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:13,744 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:14:13,767 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1978 1000000) (<= 500000 v_main_~x~0_1978)) InVars {main_~x~0=v_main_~x~0_1978} OutVars{main_~x~0=v_main_~x~0_1978} AuxVars[] AssignedVars[] [2021-05-03 00:14:13,769 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:13,769 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:13,772 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:13,785 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:13,788 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:13,823 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:13,845 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:14,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:14,900 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:14:14,902 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:14:18,847 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:18,847 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [14631399] [2021-05-03 00:14:18,847 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [14631399] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:18,847 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:18,847 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [125] imperfect sequences [] total 125 [2021-05-03 00:14:18,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717142275] [2021-05-03 00:14:18,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2021-05-03 00:14:18,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:18,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2021-05-03 00:14:18,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4702, Invalid=10798, Unknown=0, NotChecked=0, Total=15500 [2021-05-03 00:14:18,849 INFO L87 Difference]: Start difference. First operand 220 states and 223 transitions. Second operand has 125 states, 125 states have (on average 1.648) internal successors, (206), 124 states have internal predecessors, (206), 2 states have call successors, (3), 3 states have call 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:35,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:35,699 INFO L93 Difference]: Finished difference Result 427 states and 438 transitions. [2021-05-03 00:14:35,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2021-05-03 00:14:35,700 INFO L78 Accepts]: Start accepts. Automaton has has 125 states, 125 states have (on average 1.648) internal successors, (206), 124 states have internal predecessors, (206), 2 states have call successors, (3), 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:14:35,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:35,701 INFO L225 Difference]: With dead ends: 427 [2021-05-03 00:14:35,701 INFO L226 Difference]: Without dead ends: 225 [2021-05-03 00:14:35,704 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17606 ImplicationChecksByTransitivity, 14846.1ms TimeCoverageRelationStatistics Valid=14100, Invalid=46662, Unknown=0, NotChecked=0, Total=60762 [2021-05-03 00:14:35,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-05-03 00:14:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2021-05-03 00:14:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 220 states have (on average 1.018181818181818) internal successors, (224), 220 states have internal predecessors, (224), 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:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 228 transitions. [2021-05-03 00:14:35,720 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 228 transitions. Word has length 219 [2021-05-03 00:14:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:35,720 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 228 transitions. [2021-05-03 00:14:35,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 125 states, 125 states have (on average 1.648) internal successors, (206), 124 states have internal predecessors, (206), 2 states have call successors, (3), 3 states have call 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:35,720 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 228 transitions. [2021-05-03 00:14:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2021-05-03 00:14:35,722 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:35,722 INFO L523 BasicCegarLoop]: trace histogram [84, 78, 44, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:35,722 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-05-03 00:14:35,722 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:35,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1230944753, now seen corresponding path program 44 times [2021-05-03 00:14:35,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:35,723 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1881757781] [2021-05-03 00:14:35,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:35,731 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_2064) (< v_main_~x~0_2064 999999)) InVars {main_~x~0=v_main_~x~0_2064} OutVars{main_~x~0=v_main_~x~0_2064} AuxVars[] AssignedVars[] [2021-05-03 00:14:35,734 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:35,755 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:35,757 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:35,768 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:35,770 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:35,788 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:35,812 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2066 500000) (< v_main_~x~0_2066 999999)) InVars {main_~x~0=v_main_~x~0_2066} OutVars{main_~x~0=v_main_~x~0_2066} AuxVars[] AssignedVars[] [2021-05-03 00:14:35,814 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:14:35,822 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:35,827 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:35,835 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:14:35,865 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:35,868 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2068 500000) InVars {main_~x~0=v_main_~x~0_2068} OutVars{main_~x~0=v_main_~x~0_2068} AuxVars[] AssignedVars[] [2021-05-03 00:14:35,869 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:14:35,878 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:35,883 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:14:35,891 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:14:35,907 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_2070) (< v_main_~x~0_2070 1000000)) InVars {main_~x~0=v_main_~x~0_2070} OutVars{main_~x~0=v_main_~x~0_2070} AuxVars[] AssignedVars[] [2021-05-03 00:14:35,908 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:14:35,927 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:35,929 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:35,940 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:14:35,944 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:14:35,966 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:14:35,996 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:14:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:37,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:37,174 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:37,175 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:14:37,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:14:41,781 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:41,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1881757781] [2021-05-03 00:14:41,782 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1881757781] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:41,782 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:41,782 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [128] imperfect sequences [] total 128 [2021-05-03 00:14:41,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560847689] [2021-05-03 00:14:41,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states [2021-05-03 00:14:41,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:41,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2021-05-03 00:14:41,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4922, Invalid=11334, Unknown=0, NotChecked=0, Total=16256 [2021-05-03 00:14:41,784 INFO L87 Difference]: Start difference. First operand 225 states and 228 transitions. Second operand has 128 states, 128 states have (on average 1.6484375) internal successors, (211), 127 states have internal predecessors, (211), 2 states have call successors, (3), 3 states have call 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:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:00,761 INFO L93 Difference]: Finished difference Result 437 states and 448 transitions. [2021-05-03 00:15:00,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2021-05-03 00:15:00,761 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 128 states have (on average 1.6484375) internal successors, (211), 127 states have internal predecessors, (211), 2 states have call successors, (3), 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 224 [2021-05-03 00:15:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:00,762 INFO L225 Difference]: With dead ends: 437 [2021-05-03 00:15:00,762 INFO L226 Difference]: Without dead ends: 230 [2021-05-03 00:15:00,765 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18477 ImplicationChecksByTransitivity, 16676.3ms TimeCoverageRelationStatistics Valid=14760, Invalid=48996, Unknown=0, NotChecked=0, Total=63756 [2021-05-03 00:15:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-05-03 00:15:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-05-03 00:15:00,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 225 states have (on average 1.0177777777777777) internal successors, (229), 225 states have internal predecessors, (229), 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:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 233 transitions. [2021-05-03 00:15:00,781 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 233 transitions. Word has length 224 [2021-05-03 00:15:00,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:00,782 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 233 transitions. [2021-05-03 00:15:00,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 128 states, 128 states have (on average 1.6484375) internal successors, (211), 127 states have internal predecessors, (211), 2 states have call successors, (3), 3 states have call 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:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 233 transitions. [2021-05-03 00:15:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2021-05-03 00:15:00,783 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:00,783 INFO L523 BasicCegarLoop]: trace histogram [86, 80, 45, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:00,783 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-05-03 00:15:00,783 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:00,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:00,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1850686038, now seen corresponding path program 45 times [2021-05-03 00:15:00,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:00,784 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1890560559] [2021-05-03 00:15:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:00,792 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2158 999999) (<= 500000 v_main_~x~0_2158)) InVars {main_~x~0=v_main_~x~0_2158} OutVars{main_~x~0=v_main_~x~0_2158} AuxVars[] AssignedVars[] [2021-05-03 00:15:00,794 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:00,814 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:00,816 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:00,826 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:00,829 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:00,847 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:00,874 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2160 500000) (< v_main_~x~0_2160 999999)) InVars {main_~x~0=v_main_~x~0_2160} OutVars{main_~x~0=v_main_~x~0_2160} AuxVars[] AssignedVars[] [2021-05-03 00:15:00,876 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:15:00,877 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:00,883 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:00,898 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:15:00,911 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:00,913 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2162 500000) InVars {main_~x~0=v_main_~x~0_2162} OutVars{main_~x~0=v_main_~x~0_2162} AuxVars[] AssignedVars[] [2021-05-03 00:15:00,914 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:15:00,915 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:00,920 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:00,936 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:15:00,953 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2164 1000000) (<= 500000 v_main_~x~0_2164)) InVars {main_~x~0=v_main_~x~0_2164} OutVars{main_~x~0=v_main_~x~0_2164} AuxVars[] AssignedVars[] [2021-05-03 00:15:00,955 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:00,977 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:00,979 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:00,991 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:00,994 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:01,013 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:01,038 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:02,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:02,403 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:02,404 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:02,406 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:07,790 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:07,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1890560559] [2021-05-03 00:15:07,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1890560559] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:07,790 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:07,790 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [131] imperfect sequences [] total 131 [2021-05-03 00:15:07,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731132660] [2021-05-03 00:15:07,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2021-05-03 00:15:07,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:07,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2021-05-03 00:15:07,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5147, Invalid=11883, Unknown=0, NotChecked=0, Total=17030 [2021-05-03 00:15:07,792 INFO L87 Difference]: Start difference. First operand 230 states and 233 transitions. Second operand has 131 states, 131 states have (on average 1.6488549618320612) internal successors, (216), 130 states have internal predecessors, (216), 2 states have call successors, (3), 3 states have call 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:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:29,862 INFO L93 Difference]: Finished difference Result 447 states and 458 transitions. [2021-05-03 00:15:29,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2021-05-03 00:15:29,863 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 1.6488549618320612) internal successors, (216), 130 states have internal predecessors, (216), 2 states have call successors, (3), 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 229 [2021-05-03 00:15:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:29,864 INFO L225 Difference]: With dead ends: 447 [2021-05-03 00:15:29,864 INFO L226 Difference]: Without dead ends: 235 [2021-05-03 00:15:29,867 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19369 ImplicationChecksByTransitivity, 19467.4ms TimeCoverageRelationStatistics Valid=15435, Invalid=51387, Unknown=0, NotChecked=0, Total=66822 [2021-05-03 00:15:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-05-03 00:15:29,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2021-05-03 00:15:29,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 230 states have (on average 1.017391304347826) internal successors, (234), 230 states have internal predecessors, (234), 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:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 238 transitions. [2021-05-03 00:15:29,880 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 238 transitions. Word has length 229 [2021-05-03 00:15:29,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:29,880 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 238 transitions. [2021-05-03 00:15:29,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 131 states, 131 states have (on average 1.6488549618320612) internal successors, (216), 130 states have internal predecessors, (216), 2 states have call successors, (3), 3 states have call 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:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 238 transitions. [2021-05-03 00:15:29,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2021-05-03 00:15:29,882 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:29,882 INFO L523 BasicCegarLoop]: trace histogram [88, 82, 46, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:29,882 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2021-05-03 00:15:29,882 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:29,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:29,882 INFO L82 PathProgramCache]: Analyzing trace with hash -909457853, now seen corresponding path program 46 times [2021-05-03 00:15:29,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:29,883 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1185205455] [2021-05-03 00:15:29,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:29,892 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2254 999999) (<= 500000 v_main_~x~0_2254)) InVars {main_~x~0=v_main_~x~0_2254} OutVars{main_~x~0=v_main_~x~0_2254} AuxVars[] AssignedVars[] [2021-05-03 00:15:29,895 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:29,896 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:29,899 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:29,916 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:29,921 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:29,977 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:30,019 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2256 500000) (< v_main_~x~0_2256 999999)) InVars {main_~x~0=v_main_~x~0_2256} OutVars{main_~x~0=v_main_~x~0_2256} AuxVars[] AssignedVars[] [2021-05-03 00:15:30,021 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:15:30,034 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:30,040 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:30,050 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:15:30,068 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:30,070 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2258 500000) InVars {main_~x~0=v_main_~x~0_2258} OutVars{main_~x~0=v_main_~x~0_2258} AuxVars[] AssignedVars[] [2021-05-03 00:15:30,071 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:15:30,072 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:30,079 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:15:30,098 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:15:30,116 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_2260) (< v_main_~x~0_2260 1000000)) InVars {main_~x~0=v_main_~x~0_2260} OutVars{main_~x~0=v_main_~x~0_2260} AuxVars[] AssignedVars[] [2021-05-03 00:15:30,118 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:15:30,120 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:30,123 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:30,141 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:15:30,145 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:15:30,192 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:15:30,222 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:15:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:31,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:31,904 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,905 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:31,907 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:15:38,165 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:38,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1185205455] [2021-05-03 00:15:38,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1185205455] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:38,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:38,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [134] imperfect sequences [] total 134 [2021-05-03 00:15:38,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698990440] [2021-05-03 00:15:38,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states [2021-05-03 00:15:38,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:38,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2021-05-03 00:15:38,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5464, Invalid=12626, Unknown=0, NotChecked=0, Total=18090 [2021-05-03 00:15:38,167 INFO L87 Difference]: Start difference. First operand 235 states and 238 transitions. Second operand has 134 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 133 states have internal predecessors, (221), 2 states have call successors, (3), 3 states have call 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:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:05,338 INFO L93 Difference]: Finished difference Result 457 states and 468 transitions. [2021-05-03 00:16:05,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2021-05-03 00:16:05,340 INFO L78 Accepts]: Start accepts. Automaton has has 134 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 133 states have internal predecessors, (221), 2 states have call successors, (3), 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 234 [2021-05-03 00:16:05,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:05,341 INFO L225 Difference]: With dead ends: 457 [2021-05-03 00:16:05,341 INFO L226 Difference]: Without dead ends: 240 [2021-05-03 00:16:05,344 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20405 ImplicationChecksByTransitivity, 23056.3ms TimeCoverageRelationStatistics Valid=16297, Invalid=54193, Unknown=0, NotChecked=0, Total=70490 [2021-05-03 00:16:05,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-05-03 00:16:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2021-05-03 00:16:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.0170212765957447) internal successors, (239), 235 states have internal predecessors, (239), 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:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 243 transitions. [2021-05-03 00:16:05,364 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 243 transitions. Word has length 234 [2021-05-03 00:16:05,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:05,364 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 243 transitions. [2021-05-03 00:16:05,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 134 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 133 states have internal predecessors, (221), 2 states have call successors, (3), 3 states have call 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:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 243 transitions. [2021-05-03 00:16:05,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2021-05-03 00:16:05,366 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:05,366 INFO L523 BasicCegarLoop]: trace histogram [90, 84, 47, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:05,366 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-05-03 00:16:05,366 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:05,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:05,367 INFO L82 PathProgramCache]: Analyzing trace with hash 261238902, now seen corresponding path program 47 times [2021-05-03 00:16:05,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:05,367 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [780225659] [2021-05-03 00:16:05,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:05,378 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2352 999999) (<= 500000 v_main_~x~0_2352)) InVars {main_~x~0=v_main_~x~0_2352} OutVars{main_~x~0=v_main_~x~0_2352} AuxVars[] AssignedVars[] [2021-05-03 00:16:05,381 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:16:05,383 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:05,386 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:05,404 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:05,409 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:05,458 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:16:05,496 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2354 999999) (< v_main_~x~0_2354 500000)) InVars {main_~x~0=v_main_~x~0_2354} OutVars{main_~x~0=v_main_~x~0_2354} AuxVars[] AssignedVars[] [2021-05-03 00:16:05,498 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:16:05,510 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:05,518 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:05,528 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:16:05,545 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:05,548 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2356 500000) InVars {main_~x~0=v_main_~x~0_2356} OutVars{main_~x~0=v_main_~x~0_2356} AuxVars[] AssignedVars[] [2021-05-03 00:16:05,549 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:16:05,550 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:05,557 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:05,578 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:16:05,600 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2358 1000000) (<= 500000 v_main_~x~0_2358)) InVars {main_~x~0=v_main_~x~0_2358} OutVars{main_~x~0=v_main_~x~0_2358} AuxVars[] AssignedVars[] [2021-05-03 00:16:05,602 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:16:05,629 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:05,632 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:05,646 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:05,650 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:05,673 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:16:05,705 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:07,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:07,538 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:07,539 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:07,542 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:14,701 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:14,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [780225659] [2021-05-03 00:16:14,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [780225659] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:14,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:14,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [137] imperfect sequences [] total 137 [2021-05-03 00:16:14,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652809905] [2021-05-03 00:16:14,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2021-05-03 00:16:14,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:14,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2021-05-03 00:16:14,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5612, Invalid=13020, Unknown=0, NotChecked=0, Total=18632 [2021-05-03 00:16:14,705 INFO L87 Difference]: Start difference. First operand 240 states and 243 transitions. Second operand has 137 states, 137 states have (on average 1.6496350364963503) internal successors, (226), 136 states have internal predecessors, (226), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:43,250 INFO L93 Difference]: Finished difference Result 467 states and 478 transitions. [2021-05-03 00:16:43,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2021-05-03 00:16:43,253 INFO L78 Accepts]: Start accepts. Automaton has has 137 states, 137 states have (on average 1.6496350364963503) internal successors, (226), 136 states have internal predecessors, (226), 2 states have call successors, (3), 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 239 [2021-05-03 00:16:43,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:43,253 INFO L225 Difference]: With dead ends: 467 [2021-05-03 00:16:43,253 INFO L226 Difference]: Without dead ends: 245 [2021-05-03 00:16:43,258 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21216 ImplicationChecksByTransitivity, 24644.0ms TimeCoverageRelationStatistics Valid=16830, Invalid=56340, Unknown=0, NotChecked=0, Total=73170 [2021-05-03 00:16:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-05-03 00:16:43,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2021-05-03 00:16:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 240 states have (on average 1.0166666666666666) internal successors, (244), 240 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 248 transitions. [2021-05-03 00:16:43,277 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 248 transitions. Word has length 239 [2021-05-03 00:16:43,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:43,277 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 248 transitions. [2021-05-03 00:16:43,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 137 states, 137 states have (on average 1.6496350364963503) internal successors, (226), 136 states have internal predecessors, (226), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:16:43,277 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 248 transitions. [2021-05-03 00:16:43,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2021-05-03 00:16:43,278 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:43,278 INFO L523 BasicCegarLoop]: trace histogram [92, 86, 48, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:43,279 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2021-05-03 00:16:43,279 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:43,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:43,279 INFO L82 PathProgramCache]: Analyzing trace with hash 534159479, now seen corresponding path program 48 times [2021-05-03 00:16:43,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:43,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1121414913] [2021-05-03 00:16:43,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:43,299 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_2452) (< v_main_~x~0_2452 999999)) InVars {main_~x~0=v_main_~x~0_2452} OutVars{main_~x~0=v_main_~x~0_2452} AuxVars[] AssignedVars[] [2021-05-03 00:16:43,301 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:16:43,303 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:43,306 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:43,324 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:43,329 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:43,380 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:16:43,419 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2454 999999) (< v_main_~x~0_2454 500000)) InVars {main_~x~0=v_main_~x~0_2454} OutVars{main_~x~0=v_main_~x~0_2454} AuxVars[] AssignedVars[] [2021-05-03 00:16:43,421 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:16:43,433 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:43,440 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:43,451 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:16:43,476 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:43,479 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2456 500000) InVars {main_~x~0=v_main_~x~0_2456} OutVars{main_~x~0=v_main_~x~0_2456} AuxVars[] AssignedVars[] [2021-05-03 00:16:43,483 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:16:43,484 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:43,491 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:16:43,513 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:16:43,538 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_2458) (< v_main_~x~0_2458 1000000)) InVars {main_~x~0=v_main_~x~0_2458} OutVars{main_~x~0=v_main_~x~0_2458} AuxVars[] AssignedVars[] [2021-05-03 00:16:43,540 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:16:43,541 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:43,543 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:43,556 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:16:43,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:16:43,603 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:16:43,640 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:16:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:45,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:45,502 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:45,504 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:45,507 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:16:53,355 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:53,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1121414913] [2021-05-03 00:16:53,355 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1121414913] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:53,355 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:53,355 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [140] imperfect sequences [] total 140 [2021-05-03 00:16:53,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376113609] [2021-05-03 00:16:53,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 140 states [2021-05-03 00:16:53,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:53,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2021-05-03 00:16:53,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5852, Invalid=13608, Unknown=0, NotChecked=0, Total=19460 [2021-05-03 00:16:53,357 INFO L87 Difference]: Start difference. First operand 245 states and 248 transitions. Second operand has 140 states, 140 states have (on average 1.65) internal successors, (231), 139 states have internal predecessors, (231), 2 states have call successors, (3), 3 states have call 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:28,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:28,108 INFO L93 Difference]: Finished difference Result 477 states and 488 transitions. [2021-05-03 00:17:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2021-05-03 00:17:28,110 INFO L78 Accepts]: Start accepts. Automaton has has 140 states, 140 states have (on average 1.65) internal successors, (231), 139 states have internal predecessors, (231), 2 states have call successors, (3), 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 244 [2021-05-03 00:17:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:28,111 INFO L225 Difference]: With dead ends: 477 [2021-05-03 00:17:28,111 INFO L226 Difference]: Without dead ends: 250 [2021-05-03 00:17:28,115 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22171 ImplicationChecksByTransitivity, 28199.3ms TimeCoverageRelationStatistics Valid=17550, Invalid=58902, Unknown=0, NotChecked=0, Total=76452 [2021-05-03 00:17:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-05-03 00:17:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2021-05-03 00:17:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.0163265306122449) internal successors, (249), 245 states have internal predecessors, (249), 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:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 253 transitions. [2021-05-03 00:17:28,135 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 253 transitions. Word has length 244 [2021-05-03 00:17:28,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:28,135 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 253 transitions. [2021-05-03 00:17:28,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 140 states, 140 states have (on average 1.65) internal successors, (231), 139 states have internal predecessors, (231), 2 states have call successors, (3), 3 states have call 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:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 253 transitions. [2021-05-03 00:17:28,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2021-05-03 00:17:28,137 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:28,137 INFO L523 BasicCegarLoop]: trace histogram [94, 88, 49, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:28,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-05-03 00:17:28,137 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:28,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:28,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1072226626, now seen corresponding path program 49 times [2021-05-03 00:17:28,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:28,138 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1736085344] [2021-05-03 00:17:28,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:28,149 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2554 999999) (<= 500000 v_main_~x~0_2554)) InVars {main_~x~0=v_main_~x~0_2554} OutVars{main_~x~0=v_main_~x~0_2554} AuxVars[] AssignedVars[] [2021-05-03 00:17:28,152 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:17:28,190 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:28,193 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:28,215 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:28,220 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:28,256 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:17:28,310 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2556 500000) (< v_main_~x~0_2556 999999)) InVars {main_~x~0=v_main_~x~0_2556} OutVars{main_~x~0=v_main_~x~0_2556} AuxVars[] AssignedVars[] [2021-05-03 00:17:28,313 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:17:28,329 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:28,339 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:28,356 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:17:28,382 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:28,385 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2558 500000) InVars {main_~x~0=v_main_~x~0_2558} OutVars{main_~x~0=v_main_~x~0_2558} AuxVars[] AssignedVars[] [2021-05-03 00:17:28,387 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:17:28,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:28,416 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:17:28,432 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:17:28,467 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2560 1000000) (<= 500000 v_main_~x~0_2560)) InVars {main_~x~0=v_main_~x~0_2560} OutVars{main_~x~0=v_main_~x~0_2560} AuxVars[] AssignedVars[] [2021-05-03 00:17:28,470 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:17:28,471 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:28,475 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:28,496 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:17:28,505 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:17:28,570 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:17:28,622 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:17:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:30,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:30,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:30,719 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:30,722 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:17:40,898 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:17:40,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1736085344] [2021-05-03 00:17:40,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1736085344] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:17:40,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:17:40,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [143] imperfect sequences [] total 143 [2021-05-03 00:17:40,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389474947] [2021-05-03 00:17:40,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2021-05-03 00:17:40,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:17:40,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2021-05-03 00:17:40,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6097, Invalid=14209, Unknown=0, NotChecked=0, Total=20306 [2021-05-03 00:17:40,900 INFO L87 Difference]: Start difference. First operand 250 states and 253 transitions. Second operand has 143 states, 143 states have (on average 1.6503496503496504) internal successors, (236), 142 states have internal predecessors, (236), 2 states have call successors, (3), 3 states have call 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:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:18:29,826 INFO L93 Difference]: Finished difference Result 487 states and 498 transitions. [2021-05-03 00:18:29,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-05-03 00:18:29,829 INFO L78 Accepts]: Start accepts. Automaton has has 143 states, 143 states have (on average 1.6503496503496504) internal successors, (236), 142 states have internal predecessors, (236), 2 states have call successors, (3), 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 249 [2021-05-03 00:18:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:18:29,830 INFO L225 Difference]: With dead ends: 487 [2021-05-03 00:18:29,830 INFO L226 Difference]: Without dead ends: 255 [2021-05-03 00:18:29,834 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23147 ImplicationChecksByTransitivity, 37903.0ms TimeCoverageRelationStatistics Valid=18285, Invalid=61521, Unknown=0, NotChecked=0, Total=79806 [2021-05-03 00:18:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-05-03 00:18:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2021-05-03 00:18:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 250 states have (on average 1.016) internal successors, (254), 250 states have internal predecessors, (254), 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:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 258 transitions. [2021-05-03 00:18:29,847 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 258 transitions. Word has length 249 [2021-05-03 00:18:29,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:18:29,847 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 258 transitions. [2021-05-03 00:18:29,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 143 states, 143 states have (on average 1.6503496503496504) internal successors, (236), 142 states have internal predecessors, (236), 2 states have call successors, (3), 3 states have call 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:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 258 transitions. [2021-05-03 00:18:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2021-05-03 00:18:29,849 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:18:29,849 INFO L523 BasicCegarLoop]: trace histogram [96, 90, 50, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:18:29,849 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-05-03 00:18:29,849 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:18:29,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:18:29,850 INFO L82 PathProgramCache]: Analyzing trace with hash 298161323, now seen corresponding path program 50 times [2021-05-03 00:18:29,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:18:29,850 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [144751533] [2021-05-03 00:18:29,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:18:29,870 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2658 999999) (<= 500000 v_main_~x~0_2658)) InVars {main_~x~0=v_main_~x~0_2658} OutVars{main_~x~0=v_main_~x~0_2658} AuxVars[] AssignedVars[] [2021-05-03 00:18:29,886 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:18:29,888 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,893 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:29,926 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:29,933 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:30,013 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:18:30,080 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2660 500000) (< v_main_~x~0_2660 999999)) InVars {main_~x~0=v_main_~x~0_2660} OutVars{main_~x~0=v_main_~x~0_2660} AuxVars[] AssignedVars[] [2021-05-03 00:18:30,082 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:18:30,083 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:30,094 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:30,126 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:18:30,161 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:30,164 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2662 500000) InVars {main_~x~0=v_main_~x~0_2662} OutVars{main_~x~0=v_main_~x~0_2662} AuxVars[] AssignedVars[] [2021-05-03 00:18:30,166 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:18:30,168 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:30,180 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:18:30,213 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:18:30,260 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2664 1000000) (<= 500000 v_main_~x~0_2664)) InVars {main_~x~0=v_main_~x~0_2664} OutVars{main_~x~0=v_main_~x~0_2664} AuxVars[] AssignedVars[] [2021-05-03 00:18:30,263 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:18:30,264 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:30,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:18:30,294 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:18:30,299 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:18:30,366 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:18:30,424 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:18:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:33,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:18:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:18:33,161 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:33,163 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:33,167 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:18:47,990 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:47,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [144751533] [2021-05-03 00:18:47,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [144751533] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:47,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:47,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [146] imperfect sequences [] total 146 [2021-05-03 00:18:47,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543098969] [2021-05-03 00:18:47,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 146 states [2021-05-03 00:18:47,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:47,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2021-05-03 00:18:47,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6347, Invalid=14823, Unknown=0, NotChecked=0, Total=21170 [2021-05-03 00:18:47,994 INFO L87 Difference]: Start difference. First operand 255 states and 258 transitions. Second operand has 146 states, 146 states have (on average 1.6506849315068493) internal successors, (241), 145 states have internal predecessors, (241), 2 states have call successors, (3), 3 states have call 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:50,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:19:50,081 INFO L93 Difference]: Finished difference Result 497 states and 508 transitions. [2021-05-03 00:19:50,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2021-05-03 00:19:50,084 INFO L78 Accepts]: Start accepts. Automaton has has 146 states, 146 states have (on average 1.6506849315068493) internal successors, (241), 145 states have internal predecessors, (241), 2 states have call successors, (3), 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 254 [2021-05-03 00:19:50,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:19:50,085 INFO L225 Difference]: With dead ends: 497 [2021-05-03 00:19:50,085 INFO L226 Difference]: Without dead ends: 260 [2021-05-03 00:19:50,089 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24144 ImplicationChecksByTransitivity, 49112.6ms TimeCoverageRelationStatistics Valid=19035, Invalid=64197, Unknown=0, NotChecked=0, Total=83232 [2021-05-03 00:19:50,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-05-03 00:19:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2021-05-03 00:19:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 255 states have (on average 1.0156862745098039) internal successors, (259), 255 states have internal predecessors, (259), 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:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 263 transitions. [2021-05-03 00:19:50,101 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 263 transitions. Word has length 254 [2021-05-03 00:19:50,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:19:50,101 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 263 transitions. [2021-05-03 00:19:50,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 146 states, 146 states have (on average 1.6506849315068493) internal successors, (241), 145 states have internal predecessors, (241), 2 states have call successors, (3), 3 states have call 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:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 263 transitions. [2021-05-03 00:19:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2021-05-03 00:19:50,103 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:19:50,103 INFO L523 BasicCegarLoop]: trace histogram [98, 92, 51, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:19:50,103 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-05-03 00:19:50,103 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:19:50,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:19:50,103 INFO L82 PathProgramCache]: Analyzing trace with hash -841738226, now seen corresponding path program 51 times [2021-05-03 00:19:50,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:19:50,103 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1762529569] [2021-05-03 00:19:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:19:50,114 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2764 999999) (<= 500000 v_main_~x~0_2764)) InVars {main_~x~0=v_main_~x~0_2764} OutVars{main_~x~0=v_main_~x~0_2764} AuxVars[] AssignedVars[] [2021-05-03 00:19:50,116 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:19:50,117 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:50,121 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:50,142 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:50,147 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:50,206 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:19:50,254 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2766 500000) (< v_main_~x~0_2766 999999)) InVars {main_~x~0=v_main_~x~0_2766} OutVars{main_~x~0=v_main_~x~0_2766} AuxVars[] AssignedVars[] [2021-05-03 00:19:50,256 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:19:50,257 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:50,266 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:19:50,296 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:19:50,326 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:50,329 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2768 500000) InVars {main_~x~0=v_main_~x~0_2768} OutVars{main_~x~0=v_main_~x~0_2768} AuxVars[] AssignedVars[] [2021-05-03 00:19:50,331 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:19:50,347 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:50,357 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:19:50,376 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:19:50,415 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2770 1000000) (<= 500000 v_main_~x~0_2770)) InVars {main_~x~0=v_main_~x~0_2770} OutVars{main_~x~0=v_main_~x~0_2770} AuxVars[] AssignedVars[] [2021-05-03 00:19:50,417 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:19:50,418 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:50,422 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:19:50,440 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:19:50,445 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:19:50,506 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:19:50,559 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:19:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:54,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:19:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:19:54,235 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:54,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:19:54,243 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:20:11,361 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:20:11,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1762529569] [2021-05-03 00:20:11,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1762529569] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:20:11,362 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:20:11,362 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [149] imperfect sequences [] total 149 [2021-05-03 00:20:11,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699117026] [2021-05-03 00:20:11,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2021-05-03 00:20:11,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:20:11,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2021-05-03 00:20:11,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6602, Invalid=15450, Unknown=0, NotChecked=0, Total=22052 [2021-05-03 00:20:11,365 INFO L87 Difference]: Start difference. First operand 260 states and 263 transitions. Second operand has 149 states, 149 states have (on average 1.651006711409396) internal successors, (246), 148 states have internal predecessors, (246), 2 states have call successors, (3), 3 states have call 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:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:21:32,246 INFO L93 Difference]: Finished difference Result 507 states and 518 transitions. [2021-05-03 00:21:32,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2021-05-03 00:21:32,248 INFO L78 Accepts]: Start accepts. Automaton has has 149 states, 149 states have (on average 1.651006711409396) internal successors, (246), 148 states have internal predecessors, (246), 2 states have call successors, (3), 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 259 [2021-05-03 00:21:32,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:21:32,249 INFO L225 Difference]: With dead ends: 507 [2021-05-03 00:21:32,249 INFO L226 Difference]: Without dead ends: 265 [2021-05-03 00:21:32,254 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25162 ImplicationChecksByTransitivity, 59058.0ms TimeCoverageRelationStatistics Valid=19800, Invalid=66930, Unknown=0, NotChecked=0, Total=86730 [2021-05-03 00:21:32,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-05-03 00:21:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2021-05-03 00:21:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 260 states have (on average 1.0153846153846153) internal successors, (264), 260 states have internal predecessors, (264), 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:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 268 transitions. [2021-05-03 00:21:32,269 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 268 transitions. Word has length 259 [2021-05-03 00:21:32,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:21:32,269 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 268 transitions. [2021-05-03 00:21:32,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 149 states, 149 states have (on average 1.651006711409396) internal successors, (246), 148 states have internal predecessors, (246), 2 states have call successors, (3), 3 states have call 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:32,269 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 268 transitions. [2021-05-03 00:21:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-05-03 00:21:32,270 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:21:32,270 INFO L523 BasicCegarLoop]: trace histogram [100, 94, 52, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:21:32,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-05-03 00:21:32,271 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:21:32,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:21:32,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1185389857, now seen corresponding path program 52 times [2021-05-03 00:21:32,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:21:32,271 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [471741039] [2021-05-03 00:21:32,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:21:32,284 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2872 999999) (<= 500000 v_main_~x~0_2872)) InVars {main_~x~0=v_main_~x~0_2872} OutVars{main_~x~0=v_main_~x~0_2872} AuxVars[] AssignedVars[] [2021-05-03 00:21:32,287 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:21:32,289 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:32,292 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:32,314 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:32,319 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:32,387 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:21:32,455 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2874 500000) (< v_main_~x~0_2874 999999)) InVars {main_~x~0=v_main_~x~0_2874} OutVars{main_~x~0=v_main_~x~0_2874} AuxVars[] AssignedVars[] [2021-05-03 00:21:32,457 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size [2021-05-03 00:21:32,483 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:32,499 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:21:32,523 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 65.3 percent of original size 47 [2021-05-03 00:21:32,576 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:32,581 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2876 500000) InVars {main_~x~0=v_main_~x~0_2876} OutVars{main_~x~0=v_main_~x~0_2876} AuxVars[] AssignedVars[] [2021-05-03 00:21:32,583 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size [2021-05-03 00:21:32,608 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:32,623 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:21:32,649 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 92.2 percent of original size 47 [2021-05-03 00:21:32,708 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= 500000 v_main_~x~0_2878) (< v_main_~x~0_2878 1000000)) InVars {main_~x~0=v_main_~x~0_2878} OutVars{main_~x~0=v_main_~x~0_2878} AuxVars[] AssignedVars[] [2021-05-03 00:21:32,711 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size [2021-05-03 00:21:32,713 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:32,717 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:21:32,745 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-03 00:21:32,751 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-03 00:21:32,837 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 92.8 percent of original size 77 [2021-05-03 00:21:32,901 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-03 00:21:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:37,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:21:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:21:37,584 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:37,587 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:37,593 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-03 00:21:56,761 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:21:56,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [471741039] [2021-05-03 00:21:56,761 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [471741039] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:21:56,761 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:21:56,762 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [152] imperfect sequences [] total 152 [2021-05-03 00:21:56,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180825111] [2021-05-03 00:21:56,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 152 states [2021-05-03 00:21:56,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:21:56,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2021-05-03 00:21:56,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6862, Invalid=16090, Unknown=0, NotChecked=0, Total=22952 [2021-05-03 00:21:56,764 INFO L87 Difference]: Start difference. First operand 265 states and 268 transitions. Second operand has 152 states, 152 states have (on average 1.6513157894736843) internal successors, (251), 151 states have internal predecessors, (251), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)