/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/Mono4_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:57:21,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:57:21,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:57:21,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:57:21,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:57:21,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:57:21,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:57:21,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:57:21,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:57:21,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:57:21,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:57:21,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:57:21,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:57:21,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:57:21,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:57:21,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:57:21,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:57:21,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:57:21,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:57:21,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:57:21,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:57:21,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:57:21,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:57:21,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:57:21,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:57:21,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:57:21,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:57:21,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:57:21,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:57:21,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:57:21,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:57:21,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:57:21,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:57:21,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:57:21,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:57:21,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:57:21,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:57:21,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:57:21,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:57:21,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:57:21,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:57:21,586 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:57:21,598 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:57:21,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:57:21,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:57:21,601 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:57:21,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:57:21,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:57:21,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:57:21,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:57:21,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:57:21,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:57:21,602 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:57:21,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:57:21,602 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:57:21,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:57:21,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:57:21,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:57:21,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:57:21,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:57:21,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:57:21,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:57:21,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:57:21,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:57:21,604 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:57:21,604 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-02 23:57:21,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:57:21,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:57:21,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:57:21,970 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:57:21,971 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:57:21,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono4_1.c [2021-05-02 23:57:22,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa1865ef/ad8c720292074c11a41054fa3734f623/FLAGbd75967b8 [2021-05-02 23:57:22,576 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:57:22,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono4_1.c [2021-05-02 23:57:22,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa1865ef/ad8c720292074c11a41054fa3734f623/FLAGbd75967b8 [2021-05-02 23:57:22,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa1865ef/ad8c720292074c11a41054fa3734f623 [2021-05-02 23:57:22,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:57:22,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:57:22,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:57:22,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:57:22,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:57:22,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:57:22" (1/1) ... [2021-05-02 23:57:22,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1281f48d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:57:22, skipping insertion in model container [2021-05-02 23:57:22,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:57:22" (1/1) ... [2021-05-02 23:57:22,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:57:23,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:57:23,194 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/Mono4_1.c[311,324] [2021-05-02 23:57:23,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:57:23,215 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:57:23,227 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/Mono4_1.c[311,324] [2021-05-02 23:57:23,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:57:23,247 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:57:23,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:57:23 WrapperNode [2021-05-02 23:57:23,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:57:23,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:57:23,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:57:23,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:57:23,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:57:23" (1/1) ... [2021-05-02 23:57:23,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:57:23" (1/1) ... [2021-05-02 23:57:23,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:57:23" (1/1) ... [2021-05-02 23:57:23,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:57:23" (1/1) ... [2021-05-02 23:57:23,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:57:23" (1/1) ... [2021-05-02 23:57:23,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:57:23" (1/1) ... [2021-05-02 23:57:23,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:57:23" (1/1) ... [2021-05-02 23:57:23,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:57:23,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:57:23,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:57:23,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:57:23,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:57:23" (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-02 23:57:23,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:57:23,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:57:23,452 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:57:23,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:57:23,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:57:23,453 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:57:23,453 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:57:23,453 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:57:23,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:57:23,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:57:23,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:57:23,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:57:23,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:57:23,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:57:23,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:57:23,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:57:23,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:57:23,778 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:57:23,778 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 23:57:23,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:57:23 BoogieIcfgContainer [2021-05-02 23:57:23,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:57:23,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:57:23,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:57:23,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:57:23,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:57:22" (1/3) ... [2021-05-02 23:57:23,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137aae12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:57:23, skipping insertion in model container [2021-05-02 23:57:23,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:57:23" (2/3) ... [2021-05-02 23:57:23,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137aae12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:57:23, skipping insertion in model container [2021-05-02 23:57:23,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:57:23" (3/3) ... [2021-05-02 23:57:23,789 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono4_1.c [2021-05-02 23:57:23,795 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:57:23,817 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:57:23,853 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:57:23,876 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:57:23,877 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:57:23,877 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:57:23,877 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:57:23,877 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:57:23,877 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:57:23,877 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:57:23,878 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:57:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:57:23,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:57:23,908 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:23,910 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:23,910 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:23,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:23,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1325153485, now seen corresponding path program 1 times [2021-05-02 23:57:23,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:23,933 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2104825056] [2021-05-02 23:57:23,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:24,015 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:57:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:24,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:24,335 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-02 23:57:24,338 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:24,340 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2104825056] [2021-05-02 23:57:24,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2104825056] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:24,343 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:24,343 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 23:57:24,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281398029] [2021-05-02 23:57:24,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 23:57:24,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:24,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 23:57:24,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:57:24,368 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:24,479 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-05-02 23:57:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 23:57:24,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-02 23:57:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:24,488 INFO L225 Difference]: With dead ends: 32 [2021-05-02 23:57:24,489 INFO L226 Difference]: Without dead ends: 13 [2021-05-02 23:57:24,492 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 100.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:57:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-05-02 23:57:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-05-02 23:57:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-05-02 23:57:24,562 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2021-05-02 23:57:24,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:24,562 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-05-02 23:57:24,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:24,564 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-05-02 23:57:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:57:24,565 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:24,566 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:24,566 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:57:24,566 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:24,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:24,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2021-05-02 23:57:24,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:24,568 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1274108334] [2021-05-02 23:57:24,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:24,581 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:57:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:24,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:24,731 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-02 23:57:24,732 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:24,732 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1274108334] [2021-05-02 23:57:24,732 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1274108334] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:24,732 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:24,732 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 23:57:24,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427917370] [2021-05-02 23:57:24,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 23:57:24,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:24,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 23:57:24,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:57:24,736 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:24,869 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-05-02 23:57:24,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 23:57:24,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-02 23:57:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:24,871 INFO L225 Difference]: With dead ends: 22 [2021-05-02 23:57:24,871 INFO L226 Difference]: Without dead ends: 15 [2021-05-02 23:57:24,877 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:57:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-05-02 23:57:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-05-02 23:57:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-05-02 23:57:24,885 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2021-05-02 23:57:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:24,885 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-05-02 23:57:24,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-05-02 23:57:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-02 23:57:24,886 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:24,886 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:24,887 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:57:24,887 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:24,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1372110560, now seen corresponding path program 1 times [2021-05-02 23:57:24,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:24,888 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1154368419] [2021-05-02 23:57:24,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:24,939 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_11 500000) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] [2021-05-02 23:57:24,976 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:24,984 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:25,023 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:25,064 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:25,087 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:25,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:25,204 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-02 23:57:25,252 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:25,253 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1154368419] [2021-05-02 23:57:25,253 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1154368419] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:25,253 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:25,253 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:57:25,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724804317] [2021-05-02 23:57:25,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:57:25,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:25,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:57:25,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:57:25,255 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:25,400 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2021-05-02 23:57:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:57:25,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-02 23:57:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:25,403 INFO L225 Difference]: With dead ends: 24 [2021-05-02 23:57:25,404 INFO L226 Difference]: Without dead ends: 17 [2021-05-02 23:57:25,405 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 140.7ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:57:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-02 23:57:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-05-02 23:57:25,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-05-02 23:57:25,424 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2021-05-02 23:57:25,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:25,425 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-05-02 23:57:25,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-05-02 23:57:25,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:57:25,426 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:25,426 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:25,426 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:57:25,426 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:25,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:25,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1002491197, now seen corresponding path program 2 times [2021-05-02 23:57:25,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:25,428 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1584647766] [2021-05-02 23:57:25,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:25,441 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_15 500000) InVars {main_~x~0=v_main_~x~0_15} OutVars{main_~x~0=v_main_~x~0_15} AuxVars[] AssignedVars[] [2021-05-02 23:57:25,449 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:25,452 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:25,461 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:25,494 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:25,519 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:25,526 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_17 999999) (< v_main_~x~0_17 500000)) InVars {main_~x~0=v_main_~x~0_17} OutVars{main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[] [2021-05-02 23:57:25,532 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:25,534 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:25,543 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:25,567 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:25,587 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:25,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:25,694 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-02 23:57:25,778 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:25,778 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1584647766] [2021-05-02 23:57:25,779 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1584647766] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:25,779 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:25,779 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:57:25,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320466120] [2021-05-02 23:57:25,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:57:25,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:25,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:57:25,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:57:25,781 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:25,969 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2021-05-02 23:57:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:57:25,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-02 23:57:25,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:25,971 INFO L225 Difference]: With dead ends: 26 [2021-05-02 23:57:25,971 INFO L226 Difference]: Without dead ends: 19 [2021-05-02 23:57:25,972 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 198.7ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:57:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-02 23:57:25,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-05-02 23:57:25,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-05-02 23:57:25,978 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2021-05-02 23:57:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:25,978 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-05-02 23:57:25,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2021-05-02 23:57:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:57:25,979 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:25,979 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:25,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:57:25,980 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:25,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1927821798, now seen corresponding path program 3 times [2021-05-02 23:57:25,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:25,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [735347718] [2021-05-02 23:57:25,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:26,003 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-02 23:57:26,007 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:26,010 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:26,018 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:26,037 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:26,052 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:26,056 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_24 500000) (< v_main_~x~0_24 999999)) InVars {main_~x~0=v_main_~x~0_24} OutVars{main_~x~0=v_main_~x~0_24} AuxVars[] AssignedVars[] [2021-05-02 23:57:26,060 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:26,062 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:26,071 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:26,090 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:26,104 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:26,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:26,199 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-02 23:57:26,280 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:26,283 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [735347718] [2021-05-02 23:57:26,283 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [735347718] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:26,283 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:26,284 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:57:26,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286299694] [2021-05-02 23:57:26,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:57:26,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:26,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:57:26,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:57:26,286 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:26,507 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-05-02 23:57:26,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:57:26,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 23:57:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:26,515 INFO L225 Difference]: With dead ends: 28 [2021-05-02 23:57:26,516 INFO L226 Difference]: Without dead ends: 21 [2021-05-02 23:57:26,516 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 199.5ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:57:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-05-02 23:57:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-05-02 23:57:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-05-02 23:57:26,532 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2021-05-02 23:57:26,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:26,532 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-05-02 23:57:26,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:26,533 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-05-02 23:57:26,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 23:57:26,533 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:26,533 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:26,533 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:57:26,534 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:26,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:26,534 INFO L82 PathProgramCache]: Analyzing trace with hash -460063817, now seen corresponding path program 4 times [2021-05-02 23:57:26,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:26,535 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1667377183] [2021-05-02 23:57:26,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:26,542 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_30 500000) InVars {main_~x~0=v_main_~x~0_30} OutVars{main_~x~0=v_main_~x~0_30} AuxVars[] AssignedVars[] [2021-05-02 23:57:26,546 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:26,562 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:26,579 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:26,592 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:26,611 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:26,623 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_32 500000) (< v_main_~x~0_32 999999)) InVars {main_~x~0=v_main_~x~0_32} OutVars{main_~x~0=v_main_~x~0_32} AuxVars[] AssignedVars[] [2021-05-02 23:57:26,634 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:26,654 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:26,661 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:26,678 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:26,719 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:26,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:26,777 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-02 23:57:26,849 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:26,849 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1667377183] [2021-05-02 23:57:26,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1667377183] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:26,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:26,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:57:26,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650652161] [2021-05-02 23:57:26,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:57:26,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:26,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:57:26,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:57:26,852 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:27,103 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-05-02 23:57:27,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:57:27,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-02 23:57:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:27,108 INFO L225 Difference]: With dead ends: 30 [2021-05-02 23:57:27,108 INFO L226 Difference]: Without dead ends: 23 [2021-05-02 23:57:27,109 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 221.9ms TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:57:27,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-02 23:57:27,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-05-02 23:57:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-05-02 23:57:27,125 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2021-05-02 23:57:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:27,125 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-05-02 23:57:27,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:27,125 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-05-02 23:57:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 23:57:27,126 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:27,126 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:27,126 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:57:27,127 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:27,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:27,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1306082836, now seen corresponding path program 5 times [2021-05-02 23:57:27,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:27,128 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1814231699] [2021-05-02 23:57:27,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:27,137 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_39 500000) InVars {main_~x~0=v_main_~x~0_39} OutVars{main_~x~0=v_main_~x~0_39} AuxVars[] AssignedVars[] [2021-05-02 23:57:27,145 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:27,156 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:27,164 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:27,179 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:27,191 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:27,198 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_41 999999) (< v_main_~x~0_41 500000)) InVars {main_~x~0=v_main_~x~0_41} OutVars{main_~x~0=v_main_~x~0_41} AuxVars[] AssignedVars[] [2021-05-02 23:57:27,210 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:27,223 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:27,234 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:27,259 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:27,273 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:27,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:27,348 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-02 23:57:27,448 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:27,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1814231699] [2021-05-02 23:57:27,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1814231699] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:27,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:27,449 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:57:27,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538245259] [2021-05-02 23:57:27,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:57:27,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:27,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:57:27,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:57:27,453 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:27,739 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-05-02 23:57:27,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:57:27,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-02 23:57:27,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:27,744 INFO L225 Difference]: With dead ends: 32 [2021-05-02 23:57:27,744 INFO L226 Difference]: Without dead ends: 25 [2021-05-02 23:57:27,744 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 237.0ms TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:57:27,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-02 23:57:27,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-05-02 23:57:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-05-02 23:57:27,751 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2021-05-02 23:57:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:27,751 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-05-02 23:57:27,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-05-02 23:57:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 23:57:27,752 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:27,752 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:27,753 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:57:27,753 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:27,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:27,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2060934449, now seen corresponding path program 6 times [2021-05-02 23:57:27,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:27,754 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [105793801] [2021-05-02 23:57:27,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:27,761 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_49 500000) InVars {main_~x~0=v_main_~x~0_49} OutVars{main_~x~0=v_main_~x~0_49} AuxVars[] AssignedVars[] [2021-05-02 23:57:27,764 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:27,766 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:27,773 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:27,790 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:27,807 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:27,814 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_51 500000) (< v_main_~x~0_51 999999)) InVars {main_~x~0=v_main_~x~0_51} OutVars{main_~x~0=v_main_~x~0_51} AuxVars[] AssignedVars[] [2021-05-02 23:57:27,822 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:27,833 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:27,840 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:27,851 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:27,863 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:27,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:27,949 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-02 23:57:28,050 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:28,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [105793801] [2021-05-02 23:57:28,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [105793801] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:28,050 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:28,051 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:57:28,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395585379] [2021-05-02 23:57:28,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:57:28,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:28,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:57:28,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:57:28,055 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:28,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:28,361 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-05-02 23:57:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:57:28,361 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-02 23:57:28,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:28,364 INFO L225 Difference]: With dead ends: 34 [2021-05-02 23:57:28,364 INFO L226 Difference]: Without dead ends: 27 [2021-05-02 23:57:28,365 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 256.6ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:57:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-02 23:57:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-05-02 23:57:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-05-02 23:57:28,374 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2021-05-02 23:57:28,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:28,375 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-05-02 23:57:28,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2021-05-02 23:57:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-02 23:57:28,376 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:28,376 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:28,376 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 23:57:28,376 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:28,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:28,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1623861518, now seen corresponding path program 7 times [2021-05-02 23:57:28,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:28,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [322936103] [2021-05-02 23:57:28,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:28,386 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_60 500000) InVars {main_~x~0=v_main_~x~0_60} OutVars{main_~x~0=v_main_~x~0_60} AuxVars[] AssignedVars[] [2021-05-02 23:57:28,390 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:28,405 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:28,414 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:28,421 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:28,430 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:28,435 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_62 999999) (< v_main_~x~0_62 500000)) InVars {main_~x~0=v_main_~x~0_62} OutVars{main_~x~0=v_main_~x~0_62} AuxVars[] AssignedVars[] [2021-05-02 23:57:28,439 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:28,447 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:28,454 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:28,462 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:28,473 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:28,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:28,530 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-02 23:57:28,662 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:28,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [322936103] [2021-05-02 23:57:28,662 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [322936103] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:28,662 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:28,662 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 23:57:28,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422158226] [2021-05-02 23:57:28,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 23:57:28,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:28,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 23:57:28,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:57:28,664 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:29,009 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-05-02 23:57:29,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:57:29,010 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-05-02 23:57:29,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:29,011 INFO L225 Difference]: With dead ends: 36 [2021-05-02 23:57:29,011 INFO L226 Difference]: Without dead ends: 29 [2021-05-02 23:57:29,011 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 307.3ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:57:29,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-02 23:57:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-05-02 23:57:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-05-02 23:57:29,017 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2021-05-02 23:57:29,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:29,017 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-05-02 23:57:29,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-05-02 23:57:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 23:57:29,018 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:29,019 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:29,019 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 23:57:29,019 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:29,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1791397461, now seen corresponding path program 8 times [2021-05-02 23:57:29,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:29,020 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [967836297] [2021-05-02 23:57:29,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:29,025 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_72 500000) InVars {main_~x~0=v_main_~x~0_72} OutVars{main_~x~0=v_main_~x~0_72} AuxVars[] AssignedVars[] [2021-05-02 23:57:29,028 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:29,037 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:29,045 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:29,054 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:29,065 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:29,068 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_74 500000) (< v_main_~x~0_74 999999)) InVars {main_~x~0=v_main_~x~0_74} OutVars{main_~x~0=v_main_~x~0_74} AuxVars[] AssignedVars[] [2021-05-02 23:57:29,070 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:29,071 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:29,078 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:29,093 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:29,108 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:29,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:29,169 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-02 23:57:29,314 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:29,315 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [967836297] [2021-05-02 23:57:29,315 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [967836297] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:29,315 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:29,315 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-02 23:57:29,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113798992] [2021-05-02 23:57:29,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 23:57:29,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:29,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 23:57:29,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:57:29,317 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:29,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:29,749 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2021-05-02 23:57:29,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 23:57:29,750 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-05-02 23:57:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:29,751 INFO L225 Difference]: With dead ends: 38 [2021-05-02 23:57:29,751 INFO L226 Difference]: Without dead ends: 31 [2021-05-02 23:57:29,751 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 395.0ms TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:57:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-02 23:57:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-05-02 23:57:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-05-02 23:57:29,757 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2021-05-02 23:57:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:29,758 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-05-02 23:57:29,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-05-02 23:57:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 23:57:29,759 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:29,759 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:29,759 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 23:57:29,759 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:29,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1794705160, now seen corresponding path program 9 times [2021-05-02 23:57:29,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:29,760 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1056338576] [2021-05-02 23:57:29,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:29,767 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_85 500000) InVars {main_~x~0=v_main_~x~0_85} OutVars{main_~x~0=v_main_~x~0_85} AuxVars[] AssignedVars[] [2021-05-02 23:57:29,770 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:29,785 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:29,791 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:29,800 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:29,811 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:29,813 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_87 999999) (< v_main_~x~0_87 500000)) InVars {main_~x~0=v_main_~x~0_87} OutVars{main_~x~0=v_main_~x~0_87} AuxVars[] AssignedVars[] [2021-05-02 23:57:29,816 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:29,817 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:29,823 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:29,841 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:29,851 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:29,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:29,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-02 23:57:30,053 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:30,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1056338576] [2021-05-02 23:57:30,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1056338576] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:30,054 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:30,054 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 23:57:30,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288792730] [2021-05-02 23:57:30,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 23:57:30,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:30,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 23:57:30,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:57:30,056 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:30,514 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-05-02 23:57:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 23:57:30,515 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-05-02 23:57:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:30,515 INFO L225 Difference]: With dead ends: 40 [2021-05-02 23:57:30,516 INFO L226 Difference]: Without dead ends: 33 [2021-05-02 23:57:30,516 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 413.8ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:57:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-02 23:57:30,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-05-02 23:57:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:30,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-05-02 23:57:30,523 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2021-05-02 23:57:30,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:30,523 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-05-02 23:57:30,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:30,523 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-05-02 23:57:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-02 23:57:30,524 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:30,524 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:30,524 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 23:57:30,524 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:30,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:30,525 INFO L82 PathProgramCache]: Analyzing trace with hash -819414747, now seen corresponding path program 10 times [2021-05-02 23:57:30,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:30,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1707365988] [2021-05-02 23:57:30,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:30,531 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_99 500000) InVars {main_~x~0=v_main_~x~0_99} OutVars{main_~x~0=v_main_~x~0_99} AuxVars[] AssignedVars[] [2021-05-02 23:57:30,532 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:30,539 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:30,546 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:30,554 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:30,565 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:30,569 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_101 999999) (< v_main_~x~0_101 500000)) InVars {main_~x~0=v_main_~x~0_101} OutVars{main_~x~0=v_main_~x~0_101} AuxVars[] AssignedVars[] [2021-05-02 23:57:30,571 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:30,572 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:30,585 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:30,600 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:30,610 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:30,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:57:30,800 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:30,800 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1707365988] [2021-05-02 23:57:30,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1707365988] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:30,801 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:30,801 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-02 23:57:30,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448069633] [2021-05-02 23:57:30,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 23:57:30,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:30,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 23:57:30,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:57:30,802 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:31,339 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2021-05-02 23:57:31,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 23:57:31,339 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-05-02 23:57:31,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:31,340 INFO L225 Difference]: With dead ends: 42 [2021-05-02 23:57:31,340 INFO L226 Difference]: Without dead ends: 35 [2021-05-02 23:57:31,341 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 463.1ms TimeCoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:57:31,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-02 23:57:31,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-05-02 23:57:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2021-05-02 23:57:31,357 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2021-05-02 23:57:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:31,357 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-05-02 23:57:31,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2021-05-02 23:57:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 23:57:31,358 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:31,358 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:31,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 23:57:31,359 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:31,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:31,359 INFO L82 PathProgramCache]: Analyzing trace with hash -432777214, now seen corresponding path program 11 times [2021-05-02 23:57:31,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:31,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1935549830] [2021-05-02 23:57:31,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:31,366 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_114 500000) InVars {main_~x~0=v_main_~x~0_114} OutVars{main_~x~0=v_main_~x~0_114} AuxVars[] AssignedVars[] [2021-05-02 23:57:31,371 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:31,378 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:31,385 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:31,393 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:31,403 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:31,408 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_116 500000) (< v_main_~x~0_116 999999)) InVars {main_~x~0=v_main_~x~0_116} OutVars{main_~x~0=v_main_~x~0_116} AuxVars[] AssignedVars[] [2021-05-02 23:57:31,410 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:31,422 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:31,428 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:31,436 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:31,447 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:31,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:31,497 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-02 23:57:31,658 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:31,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1935549830] [2021-05-02 23:57:31,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1935549830] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:31,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:31,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-02 23:57:31,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880768796] [2021-05-02 23:57:31,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-02 23:57:31,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:31,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-02 23:57:31,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:57:31,660 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:32,203 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-05-02 23:57:32,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 23:57:32,210 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-05-02 23:57:32,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:32,211 INFO L225 Difference]: With dead ends: 44 [2021-05-02 23:57:32,211 INFO L226 Difference]: Without dead ends: 37 [2021-05-02 23:57:32,212 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 466.0ms TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:57:32,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-05-02 23:57:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-05-02 23:57:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-05-02 23:57:32,218 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2021-05-02 23:57:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:32,218 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-05-02 23:57:32,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:32,219 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-05-02 23:57:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 23:57:32,219 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:32,219 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:32,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:57:32,220 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:32,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1758704543, now seen corresponding path program 12 times [2021-05-02 23:57:32,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:32,221 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [504809371] [2021-05-02 23:57:32,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:32,236 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-02 23:57:32,238 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:32,246 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:32,252 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:32,260 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:32,270 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:32,273 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_132 999999) (< v_main_~x~0_132 500000)) InVars {main_~x~0=v_main_~x~0_132} OutVars{main_~x~0=v_main_~x~0_132} AuxVars[] AssignedVars[] [2021-05-02 23:57:32,275 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:32,277 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:32,283 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:32,298 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:32,308 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:32,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:32,355 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-02 23:57:32,513 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:32,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [504809371] [2021-05-02 23:57:32,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [504809371] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:32,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:32,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-02 23:57:32,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633177975] [2021-05-02 23:57:32,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 23:57:32,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:32,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 23:57:32,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:57:32,516 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:33,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:33,097 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-05-02 23:57:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:57:33,098 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-05-02 23:57:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:33,100 INFO L225 Difference]: With dead ends: 46 [2021-05-02 23:57:33,100 INFO L226 Difference]: Without dead ends: 39 [2021-05-02 23:57:33,103 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 487.4ms TimeCoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:57:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-02 23:57:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-05-02 23:57:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2021-05-02 23:57:33,113 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 35 [2021-05-02 23:57:33,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:33,113 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-05-02 23:57:33,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2021-05-02 23:57:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-02 23:57:33,116 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:33,116 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:33,116 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 23:57:33,117 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:33,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:33,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1056269316, now seen corresponding path program 13 times [2021-05-02 23:57:33,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:33,117 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [520952186] [2021-05-02 23:57:33,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:33,123 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_147 500000) InVars {main_~x~0=v_main_~x~0_147} OutVars{main_~x~0=v_main_~x~0_147} AuxVars[] AssignedVars[] [2021-05-02 23:57:33,125 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:33,133 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:33,140 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:33,148 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:33,159 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:33,162 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_149 500000) (< v_main_~x~0_149 999999)) InVars {main_~x~0=v_main_~x~0_149} OutVars{main_~x~0=v_main_~x~0_149} AuxVars[] AssignedVars[] [2021-05-02 23:57:33,165 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:33,166 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:33,172 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:33,186 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:33,196 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:33,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:33,247 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-02 23:57:33,469 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:33,470 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [520952186] [2021-05-02 23:57:33,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [520952186] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:33,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:33,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-02 23:57:33,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548151748] [2021-05-02 23:57:33,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-02 23:57:33,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:33,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-02 23:57:33,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:57:33,471 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:34,196 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2021-05-02 23:57:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-02 23:57:34,197 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-05-02 23:57:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:34,198 INFO L225 Difference]: With dead ends: 48 [2021-05-02 23:57:34,198 INFO L226 Difference]: Without dead ends: 41 [2021-05-02 23:57:34,198 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 589.8ms TimeCoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:57:34,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-02 23:57:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-05-02 23:57:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-05-02 23:57:34,205 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 37 [2021-05-02 23:57:34,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:34,206 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-05-02 23:57:34,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:34,206 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-05-02 23:57:34,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-02 23:57:34,206 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:34,207 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:34,207 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 23:57:34,207 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:34,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:34,208 INFO L82 PathProgramCache]: Analyzing trace with hash -416751335, now seen corresponding path program 14 times [2021-05-02 23:57:34,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:34,208 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1001470775] [2021-05-02 23:57:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:34,213 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_165 500000) InVars {main_~x~0=v_main_~x~0_165} OutVars{main_~x~0=v_main_~x~0_165} AuxVars[] AssignedVars[] [2021-05-02 23:57:34,216 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:34,217 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:34,225 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:34,238 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:34,248 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:34,250 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_167 500000) (< v_main_~x~0_167 999999)) InVars {main_~x~0=v_main_~x~0_167} OutVars{main_~x~0=v_main_~x~0_167} AuxVars[] AssignedVars[] [2021-05-02 23:57:34,252 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:34,253 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:34,259 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:34,273 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:34,282 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:34,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:34,349 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-02 23:57:34,587 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:34,587 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1001470775] [2021-05-02 23:57:34,587 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1001470775] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:34,587 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:34,588 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-02 23:57:34,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213870090] [2021-05-02 23:57:34,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-02 23:57:34,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:34,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-02 23:57:34,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-05-02 23:57:34,589 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:35,315 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2021-05-02 23:57:35,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-02 23:57:35,316 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-05-02 23:57:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:35,316 INFO L225 Difference]: With dead ends: 50 [2021-05-02 23:57:35,316 INFO L226 Difference]: Without dead ends: 43 [2021-05-02 23:57:35,317 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 612.6ms TimeCoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:57:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-02 23:57:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-05-02 23:57:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-05-02 23:57:35,323 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 39 [2021-05-02 23:57:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:35,324 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-05-02 23:57:35,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-05-02 23:57:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-02 23:57:35,325 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:35,325 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:35,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 23:57:35,325 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:35,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:35,326 INFO L82 PathProgramCache]: Analyzing trace with hash -20294922, now seen corresponding path program 15 times [2021-05-02 23:57:35,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:35,326 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1084705392] [2021-05-02 23:57:35,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:35,343 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_184 500000) InVars {main_~x~0=v_main_~x~0_184} OutVars{main_~x~0=v_main_~x~0_184} AuxVars[] AssignedVars[] [2021-05-02 23:57:35,345 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:35,356 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:35,362 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:35,370 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:35,380 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:35,387 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_186 500000) (< v_main_~x~0_186 999999)) InVars {main_~x~0=v_main_~x~0_186} OutVars{main_~x~0=v_main_~x~0_186} AuxVars[] AssignedVars[] [2021-05-02 23:57:35,389 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:35,398 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:35,404 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:35,410 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:35,420 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:35,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:35,468 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-02 23:57:35,664 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:35,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1084705392] [2021-05-02 23:57:35,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1084705392] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:35,665 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:35,665 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-02 23:57:35,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408255197] [2021-05-02 23:57:35,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-02 23:57:35,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:35,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-02 23:57:35,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:57:35,666 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:36,406 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-05-02 23:57:36,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 23:57:36,407 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-05-02 23:57:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:36,408 INFO L225 Difference]: With dead ends: 52 [2021-05-02 23:57:36,408 INFO L226 Difference]: Without dead ends: 45 [2021-05-02 23:57:36,409 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 617.9ms TimeCoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:57:36,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-05-02 23:57:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-05-02 23:57:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-05-02 23:57:36,414 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 41 [2021-05-02 23:57:36,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:36,414 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-05-02 23:57:36,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-05-02 23:57:36,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-02 23:57:36,415 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:36,416 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:36,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 23:57:36,416 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:36,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:36,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1277771373, now seen corresponding path program 16 times [2021-05-02 23:57:36,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:36,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1514898820] [2021-05-02 23:57:36,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:36,421 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_204 500000) InVars {main_~x~0=v_main_~x~0_204} OutVars{main_~x~0=v_main_~x~0_204} AuxVars[] AssignedVars[] [2021-05-02 23:57:36,423 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:36,424 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:36,430 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:36,444 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:36,454 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:36,466 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_206 999999) (< v_main_~x~0_206 500000)) InVars {main_~x~0=v_main_~x~0_206} OutVars{main_~x~0=v_main_~x~0_206} AuxVars[] AssignedVars[] [2021-05-02 23:57:36,468 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:36,475 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:36,480 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:36,487 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:36,499 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:36,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:36,555 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-02 23:57:36,802 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:36,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1514898820] [2021-05-02 23:57:36,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1514898820] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:36,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:36,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-02 23:57:36,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700476531] [2021-05-02 23:57:36,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 23:57:36,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:36,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 23:57:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:57:36,804 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:37,621 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2021-05-02 23:57:37,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-02 23:57:37,622 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-05-02 23:57:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:37,622 INFO L225 Difference]: With dead ends: 54 [2021-05-02 23:57:37,622 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 23:57:37,623 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 703.5ms TimeCoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:57:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 23:57:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-05-02 23:57:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2021-05-02 23:57:37,641 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 43 [2021-05-02 23:57:37,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:37,642 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2021-05-02 23:57:37,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:37,642 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2021-05-02 23:57:37,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 23:57:37,647 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:37,647 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:37,647 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-02 23:57:37,647 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:37,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1468136688, now seen corresponding path program 17 times [2021-05-02 23:57:37,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:37,648 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1548080032] [2021-05-02 23:57:37,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:37,654 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_225 500000) InVars {main_~x~0=v_main_~x~0_225} OutVars{main_~x~0=v_main_~x~0_225} AuxVars[] AssignedVars[] [2021-05-02 23:57:37,657 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:37,666 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:37,673 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:37,683 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:37,694 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:37,697 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_227 999999) (< v_main_~x~0_227 500000)) InVars {main_~x~0=v_main_~x~0_227} OutVars{main_~x~0=v_main_~x~0_227} AuxVars[] AssignedVars[] [2021-05-02 23:57:37,706 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:37,713 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:37,719 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:37,726 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:37,737 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:37,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:37,801 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-02 23:57:38,087 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:38,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1548080032] [2021-05-02 23:57:38,087 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1548080032] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:38,087 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:38,087 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-02 23:57:38,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351085061] [2021-05-02 23:57:38,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-02 23:57:38,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:38,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-02 23:57:38,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:57:38,090 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:39,016 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2021-05-02 23:57:39,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-02 23:57:39,017 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-05-02 23:57:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:39,018 INFO L225 Difference]: With dead ends: 56 [2021-05-02 23:57:39,018 INFO L226 Difference]: Without dead ends: 49 [2021-05-02 23:57:39,019 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 795.5ms TimeCoverageRelationStatistics Valid=153, Invalid=1487, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:57:39,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-05-02 23:57:39,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-05-02 23:57:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2021-05-02 23:57:39,026 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 45 [2021-05-02 23:57:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:39,026 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2021-05-02 23:57:39,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2021-05-02 23:57:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 23:57:39,027 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:39,027 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:39,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 23:57:39,028 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:39,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1119103731, now seen corresponding path program 18 times [2021-05-02 23:57:39,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:39,029 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [592991514] [2021-05-02 23:57:39,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:39,041 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_247 500000) InVars {main_~x~0=v_main_~x~0_247} OutVars{main_~x~0=v_main_~x~0_247} AuxVars[] AssignedVars[] [2021-05-02 23:57:39,043 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:39,053 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:39,060 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:39,067 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:39,077 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:39,079 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_249 500000) (< v_main_~x~0_249 999999)) InVars {main_~x~0=v_main_~x~0_249} OutVars{main_~x~0=v_main_~x~0_249} AuxVars[] AssignedVars[] [2021-05-02 23:57:39,081 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:39,088 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:39,095 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:39,102 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:39,113 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:39,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:39,176 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-02 23:57:39,476 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:39,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [592991514] [2021-05-02 23:57:39,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [592991514] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:39,476 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:39,477 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-02 23:57:39,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572112599] [2021-05-02 23:57:39,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 23:57:39,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:39,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 23:57:39,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-05-02 23:57:39,478 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:40,404 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-05-02 23:57:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-02 23:57:40,407 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2021-05-02 23:57:40,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:40,407 INFO L225 Difference]: With dead ends: 58 [2021-05-02 23:57:40,407 INFO L226 Difference]: Without dead ends: 51 [2021-05-02 23:57:40,408 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 806.0ms TimeCoverageRelationStatistics Valid=161, Invalid=1645, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:57:40,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-02 23:57:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-05-02 23:57:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2021-05-02 23:57:40,414 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 47 [2021-05-02 23:57:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:40,415 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2021-05-02 23:57:40,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2021-05-02 23:57:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-02 23:57:40,415 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:40,415 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:40,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-02 23:57:40,416 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:40,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:40,416 INFO L82 PathProgramCache]: Analyzing trace with hash -671082006, now seen corresponding path program 19 times [2021-05-02 23:57:40,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:40,416 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1059366806] [2021-05-02 23:57:40,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:40,424 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_270 500000) InVars {main_~x~0=v_main_~x~0_270} OutVars{main_~x~0=v_main_~x~0_270} AuxVars[] AssignedVars[] [2021-05-02 23:57:40,426 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:40,426 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:40,431 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:40,444 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:40,452 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:40,454 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_272 999999) (< v_main_~x~0_272 500000)) InVars {main_~x~0=v_main_~x~0_272} OutVars{main_~x~0=v_main_~x~0_272} AuxVars[] AssignedVars[] [2021-05-02 23:57:40,466 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:40,474 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:40,481 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:40,488 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:40,496 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:40,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:40,557 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-02 23:57:40,847 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:40,847 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1059366806] [2021-05-02 23:57:40,847 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1059366806] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:40,847 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:40,847 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-02 23:57:40,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605821348] [2021-05-02 23:57:40,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-02 23:57:40,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:40,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-02 23:57:40,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:57:40,850 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:41,818 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-05-02 23:57:41,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-02 23:57:41,819 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-05-02 23:57:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:41,820 INFO L225 Difference]: With dead ends: 60 [2021-05-02 23:57:41,820 INFO L226 Difference]: Without dead ends: 53 [2021-05-02 23:57:41,821 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 816.6ms TimeCoverageRelationStatistics Valid=169, Invalid=1811, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:57:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-02 23:57:41,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-05-02 23:57:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2021-05-02 23:57:41,827 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 49 [2021-05-02 23:57:41,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:41,827 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-05-02 23:57:41,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2021-05-02 23:57:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-05-02 23:57:41,828 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:41,828 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:41,828 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 23:57:41,828 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:41,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:41,829 INFO L82 PathProgramCache]: Analyzing trace with hash 381066119, now seen corresponding path program 20 times [2021-05-02 23:57:41,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:41,829 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2050456090] [2021-05-02 23:57:41,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:41,835 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_294 500000) InVars {main_~x~0=v_main_~x~0_294} OutVars{main_~x~0=v_main_~x~0_294} AuxVars[] AssignedVars[] [2021-05-02 23:57:41,837 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:41,838 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:41,843 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:41,857 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:41,867 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:41,869 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_296 999999) (< v_main_~x~0_296 500000)) InVars {main_~x~0=v_main_~x~0_296} OutVars{main_~x~0=v_main_~x~0_296} AuxVars[] AssignedVars[] [2021-05-02 23:57:41,870 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:41,877 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:41,883 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:41,890 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:41,899 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:41,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:41,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:41,940 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-02 23:57:42,238 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:42,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2050456090] [2021-05-02 23:57:42,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2050456090] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:42,238 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:42,238 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-02 23:57:42,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255371009] [2021-05-02 23:57:42,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 23:57:42,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:42,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 23:57:42,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2021-05-02 23:57:42,239 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:43,241 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2021-05-02 23:57:43,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-02 23:57:43,244 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2021-05-02 23:57:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:43,245 INFO L225 Difference]: With dead ends: 62 [2021-05-02 23:57:43,245 INFO L226 Difference]: Without dead ends: 55 [2021-05-02 23:57:43,246 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 873.4ms TimeCoverageRelationStatistics Valid=177, Invalid=1985, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:57:43,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-02 23:57:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-05-02 23:57:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-05-02 23:57:43,251 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 51 [2021-05-02 23:57:43,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:43,252 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-05-02 23:57:43,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-05-02 23:57:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-02 23:57:43,252 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:43,252 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:43,253 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-02 23:57:43,253 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:43,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:43,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2116867612, now seen corresponding path program 21 times [2021-05-02 23:57:43,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:43,253 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1350761710] [2021-05-02 23:57:43,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:43,258 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_319 500000) InVars {main_~x~0=v_main_~x~0_319} OutVars{main_~x~0=v_main_~x~0_319} AuxVars[] AssignedVars[] [2021-05-02 23:57:43,261 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:43,262 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:43,267 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:43,278 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:43,286 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:43,290 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_321 500000) (< v_main_~x~0_321 999999)) InVars {main_~x~0=v_main_~x~0_321} OutVars{main_~x~0=v_main_~x~0_321} AuxVars[] AssignedVars[] [2021-05-02 23:57:43,305 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:43,306 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:43,311 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:43,325 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:43,335 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:43,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:43,401 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-02 23:57:43,726 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:43,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1350761710] [2021-05-02 23:57:43,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1350761710] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:43,727 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:43,727 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-02 23:57:43,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516419241] [2021-05-02 23:57:43,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-02 23:57:43,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:43,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-02 23:57:43,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:57:43,728 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:44,781 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-05-02 23:57:44,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-02 23:57:44,781 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2021-05-02 23:57:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:44,782 INFO L225 Difference]: With dead ends: 64 [2021-05-02 23:57:44,782 INFO L226 Difference]: Without dead ends: 57 [2021-05-02 23:57:44,783 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 902.0ms TimeCoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:57:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-02 23:57:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-05-02 23:57:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2021-05-02 23:57:44,789 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 53 [2021-05-02 23:57:44,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:44,789 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2021-05-02 23:57:44,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2021-05-02 23:57:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-02 23:57:44,790 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:44,790 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:44,790 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 23:57:44,790 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:44,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:44,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1744464639, now seen corresponding path program 22 times [2021-05-02 23:57:44,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:44,790 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1091063217] [2021-05-02 23:57:44,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:44,796 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_345 500000) InVars {main_~x~0=v_main_~x~0_345} OutVars{main_~x~0=v_main_~x~0_345} AuxVars[] AssignedVars[] [2021-05-02 23:57:44,797 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:44,804 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:44,814 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:44,821 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:44,830 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:44,832 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_347 500000) (< v_main_~x~0_347 999999)) InVars {main_~x~0=v_main_~x~0_347} OutVars{main_~x~0=v_main_~x~0_347} AuxVars[] AssignedVars[] [2021-05-02 23:57:44,835 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:44,842 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:44,850 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:44,857 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:44,866 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:44,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:44,912 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-02 23:57:45,270 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:45,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1091063217] [2021-05-02 23:57:45,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1091063217] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:45,270 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:45,270 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-02 23:57:45,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751116097] [2021-05-02 23:57:45,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 23:57:45,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:45,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 23:57:45,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2021-05-02 23:57:45,272 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:46,394 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2021-05-02 23:57:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-02 23:57:46,394 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2021-05-02 23:57:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:46,395 INFO L225 Difference]: With dead ends: 66 [2021-05-02 23:57:46,395 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 23:57:46,396 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 961.9ms TimeCoverageRelationStatistics Valid=193, Invalid=2357, Unknown=0, NotChecked=0, Total=2550 [2021-05-02 23:57:46,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 23:57:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-02 23:57:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2021-05-02 23:57:46,402 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 55 [2021-05-02 23:57:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:46,402 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2021-05-02 23:57:46,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2021-05-02 23:57:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-02 23:57:46,403 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:46,403 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:46,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-05-02 23:57:46,403 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:46,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:46,404 INFO L82 PathProgramCache]: Analyzing trace with hash -347493154, now seen corresponding path program 23 times [2021-05-02 23:57:46,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:46,404 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1522843897] [2021-05-02 23:57:46,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:46,411 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_372 500000) InVars {main_~x~0=v_main_~x~0_372} OutVars{main_~x~0=v_main_~x~0_372} AuxVars[] AssignedVars[] [2021-05-02 23:57:46,413 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:46,414 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:46,420 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:46,434 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:46,444 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:46,447 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_374 999999) (< v_main_~x~0_374 500000)) InVars {main_~x~0=v_main_~x~0_374} OutVars{main_~x~0=v_main_~x~0_374} AuxVars[] AssignedVars[] [2021-05-02 23:57:46,448 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:46,455 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:46,460 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:46,469 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:46,479 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:46,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:46,539 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-02 23:57:46,919 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:46,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1522843897] [2021-05-02 23:57:46,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1522843897] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:46,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:46,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-02 23:57:46,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759122659] [2021-05-02 23:57:46,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-02 23:57:46,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:46,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-02 23:57:46,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:57:46,921 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:48,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:48,137 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2021-05-02 23:57:48,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-02 23:57:48,137 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2021-05-02 23:57:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:48,138 INFO L225 Difference]: With dead ends: 68 [2021-05-02 23:57:48,138 INFO L226 Difference]: Without dead ends: 61 [2021-05-02 23:57:48,139 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1028.1ms TimeCoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:57:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-02 23:57:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-02 23:57:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2021-05-02 23:57:48,147 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 57 [2021-05-02 23:57:48,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:48,147 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2021-05-02 23:57:48,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2021-05-02 23:57:48,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-02 23:57:48,155 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:48,155 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:48,155 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-02 23:57:48,156 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:48,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:48,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2112307579, now seen corresponding path program 24 times [2021-05-02 23:57:48,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:48,156 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1603085558] [2021-05-02 23:57:48,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:48,162 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_400 500000) InVars {main_~x~0=v_main_~x~0_400} OutVars{main_~x~0=v_main_~x~0_400} AuxVars[] AssignedVars[] [2021-05-02 23:57:48,163 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:48,174 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:48,180 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:48,187 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:48,197 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:48,198 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-02 23:57:48,200 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:48,207 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:48,212 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:48,219 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:48,230 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:48,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:48,271 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-02 23:57:48,737 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:48,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1603085558] [2021-05-02 23:57:48,738 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1603085558] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:48,738 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:48,738 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-02 23:57:48,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291030639] [2021-05-02 23:57:48,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 23:57:48,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:48,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 23:57:48,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:57:48,740 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:50,052 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-05-02 23:57:50,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-02 23:57:50,052 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2021-05-02 23:57:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:50,053 INFO L225 Difference]: With dead ends: 70 [2021-05-02 23:57:50,053 INFO L226 Difference]: Without dead ends: 63 [2021-05-02 23:57:50,054 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1187.2ms TimeCoverageRelationStatistics Valid=209, Invalid=2761, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:57:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-02 23:57:50,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-05-02 23:57:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2021-05-02 23:57:50,058 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 59 [2021-05-02 23:57:50,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:50,058 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2021-05-02 23:57:50,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2021-05-02 23:57:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-02 23:57:50,059 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:50,059 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:50,059 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-02 23:57:50,059 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:50,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:50,060 INFO L82 PathProgramCache]: Analyzing trace with hash -546168104, now seen corresponding path program 25 times [2021-05-02 23:57:50,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:50,060 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2118661531] [2021-05-02 23:57:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:50,072 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_429 500000) InVars {main_~x~0=v_main_~x~0_429} OutVars{main_~x~0=v_main_~x~0_429} AuxVars[] AssignedVars[] [2021-05-02 23:57:50,073 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:50,079 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:50,083 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:50,089 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:50,097 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:50,098 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_431 500000) (< v_main_~x~0_431 999999)) InVars {main_~x~0=v_main_~x~0_431} OutVars{main_~x~0=v_main_~x~0_431} AuxVars[] AssignedVars[] [2021-05-02 23:57:50,100 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:50,105 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:50,109 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:50,114 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:50,125 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:50,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:57:50,613 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:50,613 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2118661531] [2021-05-02 23:57:50,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2118661531] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:50,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:50,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-02 23:57:50,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012961850] [2021-05-02 23:57:50,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-02 23:57:50,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:50,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-02 23:57:50,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:57:50,614 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:51,989 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2021-05-02 23:57:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-02 23:57:51,990 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2021-05-02 23:57:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:51,990 INFO L225 Difference]: With dead ends: 72 [2021-05-02 23:57:51,990 INFO L226 Difference]: Without dead ends: 65 [2021-05-02 23:57:51,991 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1160.2ms TimeCoverageRelationStatistics Valid=217, Invalid=2975, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:57:51,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-02 23:57:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-05-02 23:57:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:51,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2021-05-02 23:57:51,996 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 61 [2021-05-02 23:57:51,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:51,997 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2021-05-02 23:57:51,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:51,997 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2021-05-02 23:57:51,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-02 23:57:51,997 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:51,997 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:51,997 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-02 23:57:51,997 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:51,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:51,998 INFO L82 PathProgramCache]: Analyzing trace with hash 164241653, now seen corresponding path program 26 times [2021-05-02 23:57:51,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:51,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1774391545] [2021-05-02 23:57:51,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:52,003 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_459 500000) InVars {main_~x~0=v_main_~x~0_459} OutVars{main_~x~0=v_main_~x~0_459} AuxVars[] AssignedVars[] [2021-05-02 23:57:52,004 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:52,011 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:52,016 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:52,022 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:52,032 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:52,033 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_461 999999) (< v_main_~x~0_461 500000)) InVars {main_~x~0=v_main_~x~0_461} OutVars{main_~x~0=v_main_~x~0_461} AuxVars[] AssignedVars[] [2021-05-02 23:57:52,035 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:52,041 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:52,045 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:52,051 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:52,059 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:52,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:52,103 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-02 23:57:52,584 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:52,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1774391545] [2021-05-02 23:57:52,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1774391545] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:52,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:52,585 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-02 23:57:52,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764461963] [2021-05-02 23:57:52,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-02 23:57:52,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:52,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-02 23:57:52,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-05-02 23:57:52,586 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:54,064 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2021-05-02 23:57:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-02 23:57:54,064 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-05-02 23:57:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:54,065 INFO L225 Difference]: With dead ends: 74 [2021-05-02 23:57:54,065 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 23:57:54,066 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1291.6ms TimeCoverageRelationStatistics Valid=225, Invalid=3197, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 23:57:54,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 23:57:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-05-02 23:57:54,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2021-05-02 23:57:54,070 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 63 [2021-05-02 23:57:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:54,070 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2021-05-02 23:57:54,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2021-05-02 23:57:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-02 23:57:54,071 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:54,071 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:54,071 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-02 23:57:54,071 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:54,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:54,071 INFO L82 PathProgramCache]: Analyzing trace with hash -31781934, now seen corresponding path program 27 times [2021-05-02 23:57:54,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:54,071 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1055790718] [2021-05-02 23:57:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:54,086 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-02 23:57:54,087 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:54,093 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:54,098 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:54,105 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:54,114 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:54,116 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_492 999999) (< v_main_~x~0_492 500000)) InVars {main_~x~0=v_main_~x~0_492} OutVars{main_~x~0=v_main_~x~0_492} AuxVars[] AssignedVars[] [2021-05-02 23:57:54,117 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:54,123 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:54,128 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:54,135 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:54,145 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:54,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:57:54,689 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:54,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1055790718] [2021-05-02 23:57:54,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1055790718] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:54,690 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:54,690 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-02 23:57:54,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346981068] [2021-05-02 23:57:54,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-02 23:57:54,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:54,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-02 23:57:54,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:57:54,691 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:56,245 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-05-02 23:57:56,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-02 23:57:56,245 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-05-02 23:57:56,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:56,246 INFO L225 Difference]: With dead ends: 76 [2021-05-02 23:57:56,246 INFO L226 Difference]: Without dead ends: 69 [2021-05-02 23:57:56,247 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1327.7ms TimeCoverageRelationStatistics Valid=233, Invalid=3427, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 23:57:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-02 23:57:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-05-02 23:57:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:56,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2021-05-02 23:57:56,253 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 65 [2021-05-02 23:57:56,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:56,253 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2021-05-02 23:57:56,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:56,253 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2021-05-02 23:57:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-02 23:57:56,254 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:56,254 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:56,254 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-02 23:57:56,254 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:56,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash 568111983, now seen corresponding path program 28 times [2021-05-02 23:57:56,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:56,254 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2016962208] [2021-05-02 23:57:56,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:56,259 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_522 500000) InVars {main_~x~0=v_main_~x~0_522} OutVars{main_~x~0=v_main_~x~0_522} AuxVars[] AssignedVars[] [2021-05-02 23:57:56,261 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:56,261 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:56,266 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:56,276 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:56,285 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:56,287 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_524 999999) (< v_main_~x~0_524 500000)) InVars {main_~x~0=v_main_~x~0_524} OutVars{main_~x~0=v_main_~x~0_524} AuxVars[] AssignedVars[] [2021-05-02 23:57:56,288 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:56,293 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:56,298 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:56,305 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:56,316 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:56,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:56,350 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-02 23:57:56,812 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:56,812 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2016962208] [2021-05-02 23:57:56,812 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2016962208] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:56,812 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:56,812 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-02 23:57:56,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316445697] [2021-05-02 23:57:56,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 23:57:56,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:56,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 23:57:56,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 23:57:56,813 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:58,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:58,447 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2021-05-02 23:57:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-02 23:57:58,447 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2021-05-02 23:57:58,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:58,448 INFO L225 Difference]: With dead ends: 78 [2021-05-02 23:57:58,448 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 23:57:58,449 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1336.1ms TimeCoverageRelationStatistics Valid=241, Invalid=3665, Unknown=0, NotChecked=0, Total=3906 [2021-05-02 23:57:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 23:57:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-05-02 23:57:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2021-05-02 23:57:58,453 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 67 [2021-05-02 23:57:58,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:58,453 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2021-05-02 23:57:58,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:58,453 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2021-05-02 23:57:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-05-02 23:57:58,453 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:58,453 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:58,453 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-05-02 23:57:58,454 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:58,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:58,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1540548556, now seen corresponding path program 29 times [2021-05-02 23:57:58,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:58,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1290292377] [2021-05-02 23:57:58,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:58,458 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_555 500000) InVars {main_~x~0=v_main_~x~0_555} OutVars{main_~x~0=v_main_~x~0_555} AuxVars[] AssignedVars[] [2021-05-02 23:57:58,459 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:57:58,460 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:58,464 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:58,474 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:57:58,482 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:58,483 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_557 999999) (< v_main_~x~0_557 500000)) InVars {main_~x~0=v_main_~x~0_557} OutVars{main_~x~0=v_main_~x~0_557} AuxVars[] AssignedVars[] [2021-05-02 23:57:58,484 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:57:58,489 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:58,492 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:57:58,498 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:57:58,506 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:58,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:58,547 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-02 23:57:59,013 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:59,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1290292377] [2021-05-02 23:57:59,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1290292377] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:59,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:59,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-02 23:57:59,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476101462] [2021-05-02 23:57:59,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-02 23:57:59,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:59,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-02 23:57:59,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:57:59,015 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:00,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:00,714 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-05-02 23:58:00,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-02 23:58:00,714 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2021-05-02 23:58:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:00,715 INFO L225 Difference]: With dead ends: 80 [2021-05-02 23:58:00,715 INFO L226 Difference]: Without dead ends: 73 [2021-05-02 23:58:00,716 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1388.3ms TimeCoverageRelationStatistics Valid=249, Invalid=3911, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 23:58:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-02 23:58:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-05-02 23:58:00,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2021-05-02 23:58:00,722 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 69 [2021-05-02 23:58:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:00,722 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2021-05-02 23:58:00,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2021-05-02 23:58:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-02 23:58:00,723 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:00,723 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:00,723 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-02 23:58:00,723 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:00,723 INFO L82 PathProgramCache]: Analyzing trace with hash -250775319, now seen corresponding path program 30 times [2021-05-02 23:58:00,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:00,724 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1146240488] [2021-05-02 23:58:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:00,727 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_589 500000) InVars {main_~x~0=v_main_~x~0_589} OutVars{main_~x~0=v_main_~x~0_589} AuxVars[] AssignedVars[] [2021-05-02 23:58:00,728 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:00,729 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:00,733 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:00,742 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:00,751 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:00,752 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_591 999999) (< v_main_~x~0_591 500000)) InVars {main_~x~0=v_main_~x~0_591} OutVars{main_~x~0=v_main_~x~0_591} AuxVars[] AssignedVars[] [2021-05-02 23:58:00,754 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:00,759 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:00,762 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:00,768 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:00,776 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:00,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:00,822 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-02 23:58:01,320 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:01,320 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1146240488] [2021-05-02 23:58:01,320 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1146240488] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:01,321 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:01,321 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-02 23:58:01,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309757664] [2021-05-02 23:58:01,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-02 23:58:01,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:01,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-02 23:58:01,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 23:58:01,322 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:03,073 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2021-05-02 23:58:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-02 23:58:03,073 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2021-05-02 23:58:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:03,074 INFO L225 Difference]: With dead ends: 82 [2021-05-02 23:58:03,074 INFO L226 Difference]: Without dead ends: 75 [2021-05-02 23:58:03,075 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1434.6ms TimeCoverageRelationStatistics Valid=257, Invalid=4165, Unknown=0, NotChecked=0, Total=4422 [2021-05-02 23:58:03,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-02 23:58:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-02 23:58:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2021-05-02 23:58:03,080 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 71 [2021-05-02 23:58:03,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:03,081 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2021-05-02 23:58:03,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:03,081 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2021-05-02 23:58:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-02 23:58:03,081 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:03,081 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:03,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-05-02 23:58:03,082 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:03,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:03,082 INFO L82 PathProgramCache]: Analyzing trace with hash 568866502, now seen corresponding path program 31 times [2021-05-02 23:58:03,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:03,082 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [284280035] [2021-05-02 23:58:03,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:03,087 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_624 500000) InVars {main_~x~0=v_main_~x~0_624} OutVars{main_~x~0=v_main_~x~0_624} AuxVars[] AssignedVars[] [2021-05-02 23:58:03,088 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:03,088 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:03,092 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:03,102 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:03,110 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:03,113 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_626 500000) (< v_main_~x~0_626 999999)) InVars {main_~x~0=v_main_~x~0_626} OutVars{main_~x~0=v_main_~x~0_626} AuxVars[] AssignedVars[] [2021-05-02 23:58:03,114 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:03,119 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:03,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:03,128 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:03,136 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:03,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:03,177 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-02 23:58:03,775 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:03,775 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [284280035] [2021-05-02 23:58:03,775 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [284280035] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:03,775 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:03,775 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-02 23:58:03,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807340956] [2021-05-02 23:58:03,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-02 23:58:03,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:03,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-02 23:58:03,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:58:03,776 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:05,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:05,643 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2021-05-02 23:58:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-02 23:58:05,644 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2021-05-02 23:58:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:05,644 INFO L225 Difference]: With dead ends: 84 [2021-05-02 23:58:05,644 INFO L226 Difference]: Without dead ends: 77 [2021-05-02 23:58:05,645 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1574.4ms TimeCoverageRelationStatistics Valid=265, Invalid=4427, Unknown=0, NotChecked=0, Total=4692 [2021-05-02 23:58:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-02 23:58:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-05-02 23:58:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2021-05-02 23:58:05,649 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 73 [2021-05-02 23:58:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:05,650 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2021-05-02 23:58:05,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2021-05-02 23:58:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-05-02 23:58:05,650 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:05,650 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:05,650 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-02 23:58:05,650 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:05,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2029325981, now seen corresponding path program 32 times [2021-05-02 23:58:05,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:05,651 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [978850586] [2021-05-02 23:58:05,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:05,654 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_660 500000) InVars {main_~x~0=v_main_~x~0_660} OutVars{main_~x~0=v_main_~x~0_660} AuxVars[] AssignedVars[] [2021-05-02 23:58:05,655 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:05,660 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:05,664 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:05,669 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:05,677 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:05,678 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_662 500000) (< v_main_~x~0_662 999999)) InVars {main_~x~0=v_main_~x~0_662} OutVars{main_~x~0=v_main_~x~0_662} AuxVars[] AssignedVars[] [2021-05-02 23:58:05,679 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:05,684 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:05,687 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:05,692 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:05,701 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:05,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:05,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-02 23:58:06,371 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:06,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [978850586] [2021-05-02 23:58:06,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [978850586] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:06,371 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:06,371 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-02 23:58:06,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025162735] [2021-05-02 23:58:06,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-02 23:58:06,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:06,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-02 23:58:06,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 23:58:06,372 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:08,314 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2021-05-02 23:58:08,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-02 23:58:08,315 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2021-05-02 23:58:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:08,316 INFO L225 Difference]: With dead ends: 86 [2021-05-02 23:58:08,316 INFO L226 Difference]: Without dead ends: 79 [2021-05-02 23:58:08,316 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1664.4ms TimeCoverageRelationStatistics Valid=273, Invalid=4697, Unknown=0, NotChecked=0, Total=4970 [2021-05-02 23:58:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-05-02 23:58:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-05-02 23:58:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2021-05-02 23:58:08,322 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 75 [2021-05-02 23:58:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:08,322 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2021-05-02 23:58:08,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2021-05-02 23:58:08,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-02 23:58:08,322 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:08,323 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:08,323 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-02 23:58:08,323 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:08,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:08,323 INFO L82 PathProgramCache]: Analyzing trace with hash 778664128, now seen corresponding path program 33 times [2021-05-02 23:58:08,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:08,323 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1166210218] [2021-05-02 23:58:08,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:08,328 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_697 500000) InVars {main_~x~0=v_main_~x~0_697} OutVars{main_~x~0=v_main_~x~0_697} AuxVars[] AssignedVars[] [2021-05-02 23:58:08,332 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:08,337 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:08,342 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:08,352 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:08,361 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:08,362 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_699 500000) (< v_main_~x~0_699 999999)) InVars {main_~x~0=v_main_~x~0_699} OutVars{main_~x~0=v_main_~x~0_699} AuxVars[] AssignedVars[] [2021-05-02 23:58:08,377 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:08,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:08,390 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:08,396 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:08,404 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:08,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:08,452 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-02 23:58:09,118 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:09,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1166210218] [2021-05-02 23:58:09,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1166210218] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:09,118 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:09,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-02 23:58:09,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34610671] [2021-05-02 23:58:09,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-02 23:58:09,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:09,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-02 23:58:09,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:58:09,120 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:11,186 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2021-05-02 23:58:11,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-02 23:58:11,187 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2021-05-02 23:58:11,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:11,188 INFO L225 Difference]: With dead ends: 88 [2021-05-02 23:58:11,188 INFO L226 Difference]: Without dead ends: 81 [2021-05-02 23:58:11,188 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 1740.8ms TimeCoverageRelationStatistics Valid=281, Invalid=4975, Unknown=0, NotChecked=0, Total=5256 [2021-05-02 23:58:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-05-02 23:58:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-05-02 23:58:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2021-05-02 23:58:11,195 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 77 [2021-05-02 23:58:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:11,195 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2021-05-02 23:58:11,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2021-05-02 23:58:11,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 23:58:11,196 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:11,196 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:11,196 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-02 23:58:11,197 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:11,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:11,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2017696989, now seen corresponding path program 34 times [2021-05-02 23:58:11,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:11,197 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [396612042] [2021-05-02 23:58:11,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:11,202 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_735 500000) InVars {main_~x~0=v_main_~x~0_735} OutVars{main_~x~0=v_main_~x~0_735} AuxVars[] AssignedVars[] [2021-05-02 23:58:11,203 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:11,209 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:11,213 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:11,219 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:11,227 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:11,228 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_737 999999) (< v_main_~x~0_737 500000)) InVars {main_~x~0=v_main_~x~0_737} OutVars{main_~x~0=v_main_~x~0_737} AuxVars[] AssignedVars[] [2021-05-02 23:58:11,229 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:11,230 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:11,245 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:11,255 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:11,264 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:11,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:11,302 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-02 23:58:12,053 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:12,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [396612042] [2021-05-02 23:58:12,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [396612042] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:12,054 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:12,054 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-02 23:58:12,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196010674] [2021-05-02 23:58:12,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-02 23:58:12,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:12,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-02 23:58:12,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2021-05-02 23:58:12,055 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:14,193 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2021-05-02 23:58:14,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-02 23:58:14,194 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-02 23:58:14,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:14,194 INFO L225 Difference]: With dead ends: 90 [2021-05-02 23:58:14,194 INFO L226 Difference]: Without dead ends: 83 [2021-05-02 23:58:14,195 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1858.8ms TimeCoverageRelationStatistics Valid=289, Invalid=5261, Unknown=0, NotChecked=0, Total=5550 [2021-05-02 23:58:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-02 23:58:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-05-02 23:58:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2021-05-02 23:58:14,201 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 79 [2021-05-02 23:58:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:14,201 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2021-05-02 23:58:14,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2021-05-02 23:58:14,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-02 23:58:14,202 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:14,202 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:14,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-02 23:58:14,202 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:14,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:14,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1272631878, now seen corresponding path program 35 times [2021-05-02 23:58:14,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:14,203 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [860877039] [2021-05-02 23:58:14,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:14,207 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_774 500000) InVars {main_~x~0=v_main_~x~0_774} OutVars{main_~x~0=v_main_~x~0_774} AuxVars[] AssignedVars[] [2021-05-02 23:58:14,209 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:14,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:14,221 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:14,227 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:14,236 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:14,238 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_776 500000) (< v_main_~x~0_776 999999)) InVars {main_~x~0=v_main_~x~0_776} OutVars{main_~x~0=v_main_~x~0_776} AuxVars[] AssignedVars[] [2021-05-02 23:58:14,240 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:14,245 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:14,249 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:14,255 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:14,263 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:14,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:14,304 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-02 23:58:15,006 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:15,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [860877039] [2021-05-02 23:58:15,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [860877039] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:15,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:15,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-02 23:58:15,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633076126] [2021-05-02 23:58:15,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-02 23:58:15,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:15,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-02 23:58:15,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:58:15,014 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:17,249 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2021-05-02 23:58:17,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-02 23:58:17,249 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-02 23:58:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:17,250 INFO L225 Difference]: With dead ends: 92 [2021-05-02 23:58:17,250 INFO L226 Difference]: Without dead ends: 85 [2021-05-02 23:58:17,251 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1860.1ms TimeCoverageRelationStatistics Valid=297, Invalid=5555, Unknown=0, NotChecked=0, Total=5852 [2021-05-02 23:58:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-02 23:58:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-05-02 23:58:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2021-05-02 23:58:17,257 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 81 [2021-05-02 23:58:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:17,257 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2021-05-02 23:58:17,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2021-05-02 23:58:17,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-02 23:58:17,258 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:17,258 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:17,258 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-02 23:58:17,258 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:17,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:17,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2112224087, now seen corresponding path program 36 times [2021-05-02 23:58:17,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:17,259 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [814920401] [2021-05-02 23:58:17,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:17,263 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_814 500000) InVars {main_~x~0=v_main_~x~0_814} OutVars{main_~x~0=v_main_~x~0_814} AuxVars[] AssignedVars[] [2021-05-02 23:58:17,269 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:17,270 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:17,275 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:17,285 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:17,294 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:17,296 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_816 500000) (< v_main_~x~0_816 999999)) InVars {main_~x~0=v_main_~x~0_816} OutVars{main_~x~0=v_main_~x~0_816} AuxVars[] AssignedVars[] [2021-05-02 23:58:17,297 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:17,297 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:17,301 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:17,322 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:17,332 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:17,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:17,370 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-02 23:58:18,241 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:18,241 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [814920401] [2021-05-02 23:58:18,241 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [814920401] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:18,241 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:18,243 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-02 23:58:18,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523214625] [2021-05-02 23:58:18,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-02 23:58:18,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:18,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-02 23:58:18,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 23:58:18,245 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:20,681 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-05-02 23:58:20,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-02 23:58:20,681 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2021-05-02 23:58:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:20,682 INFO L225 Difference]: With dead ends: 94 [2021-05-02 23:58:20,682 INFO L226 Difference]: Without dead ends: 87 [2021-05-02 23:58:20,683 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 2136.6ms TimeCoverageRelationStatistics Valid=305, Invalid=5857, Unknown=0, NotChecked=0, Total=6162 [2021-05-02 23:58:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-05-02 23:58:20,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-05-02 23:58:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2021-05-02 23:58:20,689 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 83 [2021-05-02 23:58:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:20,690 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2021-05-02 23:58:20,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2021-05-02 23:58:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-05-02 23:58:20,690 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:20,691 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:20,691 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-05-02 23:58:20,691 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:20,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:20,691 INFO L82 PathProgramCache]: Analyzing trace with hash -626403916, now seen corresponding path program 37 times [2021-05-02 23:58:20,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:20,691 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [864008796] [2021-05-02 23:58:20,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:20,695 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_855 500000) InVars {main_~x~0=v_main_~x~0_855} OutVars{main_~x~0=v_main_~x~0_855} AuxVars[] AssignedVars[] [2021-05-02 23:58:20,696 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:20,701 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:20,704 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:20,710 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:20,719 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:20,720 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_857 999999) (< v_main_~x~0_857 500000)) InVars {main_~x~0=v_main_~x~0_857} OutVars{main_~x~0=v_main_~x~0_857} AuxVars[] AssignedVars[] [2021-05-02 23:58:20,721 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:20,734 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:20,741 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:20,748 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:20,757 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:20,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:20,793 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-02 23:58:21,589 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:21,589 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [864008796] [2021-05-02 23:58:21,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [864008796] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:21,590 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:21,590 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-02 23:58:21,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173684411] [2021-05-02 23:58:21,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-02 23:58:21,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:21,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-02 23:58:21,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:58:21,591 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:24,042 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-05-02 23:58:24,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-02 23:58:24,043 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2021-05-02 23:58:24,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:24,043 INFO L225 Difference]: With dead ends: 96 [2021-05-02 23:58:24,044 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 23:58:24,044 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 2031.6ms TimeCoverageRelationStatistics Valid=313, Invalid=6167, Unknown=0, NotChecked=0, Total=6480 [2021-05-02 23:58:24,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 23:58:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-05-02 23:58:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2021-05-02 23:58:24,051 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 85 [2021-05-02 23:58:24,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:24,052 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2021-05-02 23:58:24,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2021-05-02 23:58:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-02 23:58:24,052 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:24,052 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:24,052 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-02 23:58:24,052 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:24,053 INFO L82 PathProgramCache]: Analyzing trace with hash 367037649, now seen corresponding path program 38 times [2021-05-02 23:58:24,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:24,053 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [296392012] [2021-05-02 23:58:24,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:24,056 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_897 500000) InVars {main_~x~0=v_main_~x~0_897} OutVars{main_~x~0=v_main_~x~0_897} AuxVars[] AssignedVars[] [2021-05-02 23:58:24,059 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:24,060 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:24,064 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:24,073 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:24,082 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:24,083 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_899 999999) (< v_main_~x~0_899 500000)) InVars {main_~x~0=v_main_~x~0_899} OutVars{main_~x~0=v_main_~x~0_899} AuxVars[] AssignedVars[] [2021-05-02 23:58:24,084 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:24,091 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:24,095 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:24,100 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:24,108 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:24,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:24,157 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-02 23:58:25,045 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:25,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [296392012] [2021-05-02 23:58:25,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [296392012] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:25,046 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:25,046 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-02 23:58:25,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665549935] [2021-05-02 23:58:25,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 23:58:25,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:25,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 23:58:25,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 23:58:25,047 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:27,612 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2021-05-02 23:58:27,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-02 23:58:27,613 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2021-05-02 23:58:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:27,613 INFO L225 Difference]: With dead ends: 98 [2021-05-02 23:58:27,613 INFO L226 Difference]: Without dead ends: 91 [2021-05-02 23:58:27,614 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 2183.5ms TimeCoverageRelationStatistics Valid=321, Invalid=6485, Unknown=0, NotChecked=0, Total=6806 [2021-05-02 23:58:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-05-02 23:58:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-05-02 23:58:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2021-05-02 23:58:27,620 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 87 [2021-05-02 23:58:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:27,620 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2021-05-02 23:58:27,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2021-05-02 23:58:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-02 23:58:27,621 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:27,621 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:27,621 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-05-02 23:58:27,621 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:27,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:27,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1581641902, now seen corresponding path program 39 times [2021-05-02 23:58:27,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:27,621 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [487068982] [2021-05-02 23:58:27,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:27,626 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_940 500000) InVars {main_~x~0=v_main_~x~0_940} OutVars{main_~x~0=v_main_~x~0_940} AuxVars[] AssignedVars[] [2021-05-02 23:58:27,628 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:27,632 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:27,636 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:27,643 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:27,651 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:27,653 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_942 999999) (< v_main_~x~0_942 500000)) InVars {main_~x~0=v_main_~x~0_942} OutVars{main_~x~0=v_main_~x~0_942} AuxVars[] AssignedVars[] [2021-05-02 23:58:27,654 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:27,659 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:27,662 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:27,667 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:27,676 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:27,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:27,712 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-02 23:58:28,551 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:28,551 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [487068982] [2021-05-02 23:58:28,551 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [487068982] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:28,551 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:28,551 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-02 23:58:28,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000893753] [2021-05-02 23:58:28,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-02 23:58:28,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:28,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-02 23:58:28,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:58:28,552 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:31,203 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2021-05-02 23:58:31,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-02 23:58:31,203 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2021-05-02 23:58:31,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:31,204 INFO L225 Difference]: With dead ends: 100 [2021-05-02 23:58:31,204 INFO L226 Difference]: Without dead ends: 93 [2021-05-02 23:58:31,204 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 2189.6ms TimeCoverageRelationStatistics Valid=329, Invalid=6811, Unknown=0, NotChecked=0, Total=7140 [2021-05-02 23:58:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-02 23:58:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-05-02 23:58:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2021-05-02 23:58:31,211 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 89 [2021-05-02 23:58:31,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:31,211 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2021-05-02 23:58:31,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2021-05-02 23:58:31,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-02 23:58:31,212 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:31,212 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:31,212 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-02 23:58:31,212 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:31,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:31,213 INFO L82 PathProgramCache]: Analyzing trace with hash 585224523, now seen corresponding path program 40 times [2021-05-02 23:58:31,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:31,213 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995107730] [2021-05-02 23:58:31,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:31,217 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_984 500000) InVars {main_~x~0=v_main_~x~0_984} OutVars{main_~x~0=v_main_~x~0_984} AuxVars[] AssignedVars[] [2021-05-02 23:58:31,219 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:31,225 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:31,229 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:31,235 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:31,244 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:31,245 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_986 500000) (< v_main_~x~0_986 999999)) InVars {main_~x~0=v_main_~x~0_986} OutVars{main_~x~0=v_main_~x~0_986} AuxVars[] AssignedVars[] [2021-05-02 23:58:31,246 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:31,252 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:31,256 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:31,262 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:31,272 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:31,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:58:32,211 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:32,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995107730] [2021-05-02 23:58:32,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1995107730] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:32,211 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:32,211 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-02 23:58:32,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845023648] [2021-05-02 23:58:32,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-02 23:58:32,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:32,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-02 23:58:32,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2021-05-02 23:58:32,213 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:35,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:35,040 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2021-05-02 23:58:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-02 23:58:35,040 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2021-05-02 23:58:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:35,041 INFO L225 Difference]: With dead ends: 102 [2021-05-02 23:58:35,041 INFO L226 Difference]: Without dead ends: 95 [2021-05-02 23:58:35,042 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 2337.1ms TimeCoverageRelationStatistics Valid=337, Invalid=7145, Unknown=0, NotChecked=0, Total=7482 [2021-05-02 23:58:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-02 23:58:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-05-02 23:58:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2021-05-02 23:58:35,048 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 91 [2021-05-02 23:58:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:35,048 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2021-05-02 23:58:35,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2021-05-02 23:58:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-02 23:58:35,049 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:35,049 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:35,049 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-05-02 23:58:35,049 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:35,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:35,050 INFO L82 PathProgramCache]: Analyzing trace with hash 805830312, now seen corresponding path program 41 times [2021-05-02 23:58:35,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:35,050 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [538844696] [2021-05-02 23:58:35,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:35,054 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1029 500000) InVars {main_~x~0=v_main_~x~0_1029} OutVars{main_~x~0=v_main_~x~0_1029} AuxVars[] AssignedVars[] [2021-05-02 23:58:35,065 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:35,066 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:35,071 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:35,083 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:35,091 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:35,093 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1031 999999) (< v_main_~x~0_1031 500000)) InVars {main_~x~0=v_main_~x~0_1031} OutVars{main_~x~0=v_main_~x~0_1031} AuxVars[] AssignedVars[] [2021-05-02 23:58:35,094 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:35,094 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:35,098 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:35,109 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:35,119 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:35,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:35,160 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-02 23:58:36,144 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:36,144 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [538844696] [2021-05-02 23:58:36,144 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [538844696] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:36,144 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:36,145 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-02 23:58:36,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757865400] [2021-05-02 23:58:36,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-02 23:58:36,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:36,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-02 23:58:36,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:58:36,146 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:39,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:39,126 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2021-05-02 23:58:39,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-02 23:58:39,126 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2021-05-02 23:58:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:39,127 INFO L225 Difference]: With dead ends: 104 [2021-05-02 23:58:39,127 INFO L226 Difference]: Without dead ends: 97 [2021-05-02 23:58:39,128 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 2472.5ms TimeCoverageRelationStatistics Valid=345, Invalid=7487, Unknown=0, NotChecked=0, Total=7832 [2021-05-02 23:58:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-02 23:58:39,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-05-02 23:58:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2021-05-02 23:58:39,135 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 93 [2021-05-02 23:58:39,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:39,135 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2021-05-02 23:58:39,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2021-05-02 23:58:39,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-02 23:58:39,136 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:39,136 INFO L523 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:39,136 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-02 23:58:39,136 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:39,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1940371259, now seen corresponding path program 42 times [2021-05-02 23:58:39,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:39,137 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1923115454] [2021-05-02 23:58:39,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:39,141 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1075 500000) InVars {main_~x~0=v_main_~x~0_1075} OutVars{main_~x~0=v_main_~x~0_1075} AuxVars[] AssignedVars[] [2021-05-02 23:58:39,149 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:39,156 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:39,161 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:39,168 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:39,179 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:39,180 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1077 500000) (< v_main_~x~0_1077 999999)) InVars {main_~x~0=v_main_~x~0_1077} OutVars{main_~x~0=v_main_~x~0_1077} AuxVars[] AssignedVars[] [2021-05-02 23:58:39,182 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:39,186 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:39,190 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:39,196 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:39,204 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:39,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:39,248 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-02 23:58:40,290 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:40,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1923115454] [2021-05-02 23:58:40,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1923115454] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:40,291 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:40,291 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-02 23:58:40,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531129878] [2021-05-02 23:58:40,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-02 23:58:40,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:40,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-02 23:58:40,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2021-05-02 23:58:40,292 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:43,372 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-05-02 23:58:43,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-02 23:58:43,373 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2021-05-02 23:58:43,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:43,373 INFO L225 Difference]: With dead ends: 106 [2021-05-02 23:58:43,373 INFO L226 Difference]: Without dead ends: 99 [2021-05-02 23:58:43,374 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 2589.2ms TimeCoverageRelationStatistics Valid=353, Invalid=7837, Unknown=0, NotChecked=0, Total=8190 [2021-05-02 23:58:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-02 23:58:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-05-02 23:58:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2021-05-02 23:58:43,380 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 95 [2021-05-02 23:58:43,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:43,381 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2021-05-02 23:58:43,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:43,381 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2021-05-02 23:58:43,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-05-02 23:58:43,382 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:43,382 INFO L523 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:43,382 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-05-02 23:58:43,382 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:43,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:43,383 INFO L82 PathProgramCache]: Analyzing trace with hash 364806050, now seen corresponding path program 43 times [2021-05-02 23:58:43,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:43,383 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [56744763] [2021-05-02 23:58:43,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:43,388 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1122 500000) InVars {main_~x~0=v_main_~x~0_1122} OutVars{main_~x~0=v_main_~x~0_1122} AuxVars[] AssignedVars[] [2021-05-02 23:58:43,390 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:43,396 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:43,401 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:43,408 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:43,418 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:43,420 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1124 999999) (< v_main_~x~0_1124 500000)) InVars {main_~x~0=v_main_~x~0_1124} OutVars{main_~x~0=v_main_~x~0_1124} AuxVars[] AssignedVars[] [2021-05-02 23:58:43,421 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:43,427 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:43,433 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:43,440 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:43,449 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:43,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:43,490 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-02 23:58:44,612 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:44,613 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [56744763] [2021-05-02 23:58:44,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [56744763] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:44,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:44,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-02 23:58:44,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960739554] [2021-05-02 23:58:44,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-02 23:58:44,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:44,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-02 23:58:44,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:58:44,614 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:47,804 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2021-05-02 23:58:47,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-02 23:58:47,805 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2021-05-02 23:58:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:47,806 INFO L225 Difference]: With dead ends: 108 [2021-05-02 23:58:47,806 INFO L226 Difference]: Without dead ends: 101 [2021-05-02 23:58:47,806 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 2720.4ms TimeCoverageRelationStatistics Valid=361, Invalid=8195, Unknown=0, NotChecked=0, Total=8556 [2021-05-02 23:58:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-02 23:58:47,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-05-02 23:58:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2021-05-02 23:58:47,813 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 97 [2021-05-02 23:58:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:47,813 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2021-05-02 23:58:47,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:47,813 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2021-05-02 23:58:47,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-05-02 23:58:47,814 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:47,814 INFO L523 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:47,814 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-02 23:58:47,814 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:47,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:47,815 INFO L82 PathProgramCache]: Analyzing trace with hash -562924737, now seen corresponding path program 44 times [2021-05-02 23:58:47,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:47,815 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1477193980] [2021-05-02 23:58:47,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:47,825 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1170 500000) InVars {main_~x~0=v_main_~x~0_1170} OutVars{main_~x~0=v_main_~x~0_1170} AuxVars[] AssignedVars[] [2021-05-02 23:58:47,826 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:47,827 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:47,831 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:47,842 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:47,852 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:47,853 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1172 999999) (< v_main_~x~0_1172 500000)) InVars {main_~x~0=v_main_~x~0_1172} OutVars{main_~x~0=v_main_~x~0_1172} AuxVars[] AssignedVars[] [2021-05-02 23:58:47,855 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:47,856 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:47,861 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:47,872 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:47,882 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:47,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:47,922 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-02 23:58:49,059 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:49,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1477193980] [2021-05-02 23:58:49,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1477193980] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:49,059 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:49,059 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-02 23:58:49,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291378298] [2021-05-02 23:58:49,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-02 23:58:49,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:49,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-02 23:58:49,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2021-05-02 23:58:49,061 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:52,443 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2021-05-02 23:58:52,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-02 23:58:52,444 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2021-05-02 23:58:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:52,445 INFO L225 Difference]: With dead ends: 110 [2021-05-02 23:58:52,445 INFO L226 Difference]: Without dead ends: 103 [2021-05-02 23:58:52,446 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 2814.4ms TimeCoverageRelationStatistics Valid=369, Invalid=8561, Unknown=0, NotChecked=0, Total=8930 [2021-05-02 23:58:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-05-02 23:58:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-05-02 23:58:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:52,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2021-05-02 23:58:52,454 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 99 [2021-05-02 23:58:52,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:52,454 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2021-05-02 23:58:52,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:52,454 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2021-05-02 23:58:52,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-05-02 23:58:52,455 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:52,455 INFO L523 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:52,455 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-05-02 23:58:52,455 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:52,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:52,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1240986524, now seen corresponding path program 45 times [2021-05-02 23:58:52,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:52,456 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [117825130] [2021-05-02 23:58:52,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:52,469 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1219 500000) InVars {main_~x~0=v_main_~x~0_1219} OutVars{main_~x~0=v_main_~x~0_1219} AuxVars[] AssignedVars[] [2021-05-02 23:58:52,470 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:52,476 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:52,482 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:52,489 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:52,499 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:52,500 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1221 999999) (< v_main_~x~0_1221 500000)) InVars {main_~x~0=v_main_~x~0_1221} OutVars{main_~x~0=v_main_~x~0_1221} AuxVars[] AssignedVars[] [2021-05-02 23:58:52,501 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:52,502 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:52,507 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:52,517 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:52,526 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:52,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:58:53,832 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:53,832 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [117825130] [2021-05-02 23:58:53,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [117825130] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:53,832 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:53,832 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-02 23:58:53,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279814665] [2021-05-02 23:58:53,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-02 23:58:53,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:53,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-02 23:58:53,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2021-05-02 23:58:53,834 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:57,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:57,312 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2021-05-02 23:58:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-02 23:58:57,313 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2021-05-02 23:58:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:57,313 INFO L225 Difference]: With dead ends: 112 [2021-05-02 23:58:57,313 INFO L226 Difference]: Without dead ends: 105 [2021-05-02 23:58:57,314 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 2990.9ms TimeCoverageRelationStatistics Valid=377, Invalid=8935, Unknown=0, NotChecked=0, Total=9312 [2021-05-02 23:58:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-05-02 23:58:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-05-02 23:58:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2021-05-02 23:58:57,323 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 101 [2021-05-02 23:58:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:57,323 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2021-05-02 23:58:57,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2021-05-02 23:58:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-05-02 23:58:57,324 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:57,324 INFO L523 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:57,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-02 23:58:57,324 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:57,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:57,325 INFO L82 PathProgramCache]: Analyzing trace with hash -367079239, now seen corresponding path program 46 times [2021-05-02 23:58:57,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:57,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1449661080] [2021-05-02 23:58:57,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:57,330 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1269 500000) InVars {main_~x~0=v_main_~x~0_1269} OutVars{main_~x~0=v_main_~x~0_1269} AuxVars[] AssignedVars[] [2021-05-02 23:58:57,332 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:58:57,333 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:57,337 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:57,349 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:58:57,360 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:57,361 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1271 999999) (< v_main_~x~0_1271 500000)) InVars {main_~x~0=v_main_~x~0_1271} OutVars{main_~x~0=v_main_~x~0_1271} AuxVars[] AssignedVars[] [2021-05-02 23:58:57,363 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:58:57,368 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:57,373 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:58:57,379 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:58:57,389 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:57,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:57,426 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-02 23:58:58,658 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:58,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1449661080] [2021-05-02 23:58:58,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1449661080] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:58,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:58,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-02 23:58:58,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355012774] [2021-05-02 23:58:58,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-02 23:58:58,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:58,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-02 23:58:58,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2021-05-02 23:58:58,660 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:02,379 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2021-05-02 23:59:02,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-02 23:59:02,380 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2021-05-02 23:59:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:02,381 INFO L225 Difference]: With dead ends: 114 [2021-05-02 23:59:02,381 INFO L226 Difference]: Without dead ends: 107 [2021-05-02 23:59:02,381 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 3059.4ms TimeCoverageRelationStatistics Valid=385, Invalid=9317, Unknown=0, NotChecked=0, Total=9702 [2021-05-02 23:59:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-02 23:59:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-05-02 23:59:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2021-05-02 23:59:02,390 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 103 [2021-05-02 23:59:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:02,390 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2021-05-02 23:59:02,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2021-05-02 23:59:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-02 23:59:02,391 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:02,391 INFO L523 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:02,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-05-02 23:59:02,391 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:02,392 INFO L82 PathProgramCache]: Analyzing trace with hash 469949078, now seen corresponding path program 47 times [2021-05-02 23:59:02,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:02,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [129751197] [2021-05-02 23:59:02,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:02,396 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1320 500000) InVars {main_~x~0=v_main_~x~0_1320} OutVars{main_~x~0=v_main_~x~0_1320} AuxVars[] AssignedVars[] [2021-05-02 23:59:02,398 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:59:02,403 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:02,408 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:02,416 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:59:02,425 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:02,427 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1322 999999) (< v_main_~x~0_1322 500000)) InVars {main_~x~0=v_main_~x~0_1322} OutVars{main_~x~0=v_main_~x~0_1322} AuxVars[] AssignedVars[] [2021-05-02 23:59:02,428 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:59:02,429 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:02,433 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:02,442 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:59:02,450 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:02,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:02,498 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-02 23:59:03,739 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:03,739 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [129751197] [2021-05-02 23:59:03,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [129751197] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:03,739 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:03,739 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-05-02 23:59:03,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133791134] [2021-05-02 23:59:03,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-05-02 23:59:03,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:03,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-05-02 23:59:03,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:59:03,740 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:07,457 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2021-05-02 23:59:07,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-02 23:59:07,458 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2021-05-02 23:59:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:07,458 INFO L225 Difference]: With dead ends: 116 [2021-05-02 23:59:07,459 INFO L226 Difference]: Without dead ends: 109 [2021-05-02 23:59:07,459 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 3073.4ms TimeCoverageRelationStatistics Valid=393, Invalid=9707, Unknown=0, NotChecked=0, Total=10100 [2021-05-02 23:59:07,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-02 23:59:07,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-05-02 23:59:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2021-05-02 23:59:07,468 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 105 [2021-05-02 23:59:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:07,469 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2021-05-02 23:59:07,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2021-05-02 23:59:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-02 23:59:07,469 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:07,470 INFO L523 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:07,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-02 23:59:07,470 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:07,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1695277363, now seen corresponding path program 48 times [2021-05-02 23:59:07,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:07,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [166217710] [2021-05-02 23:59:07,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:07,475 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1372 500000) InVars {main_~x~0=v_main_~x~0_1372} OutVars{main_~x~0=v_main_~x~0_1372} AuxVars[] AssignedVars[] [2021-05-02 23:59:07,476 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:59:07,476 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:07,481 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:07,493 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:59:07,505 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:07,509 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1374 500000) (< v_main_~x~0_1374 999999)) InVars {main_~x~0=v_main_~x~0_1374} OutVars{main_~x~0=v_main_~x~0_1374} AuxVars[] AssignedVars[] [2021-05-02 23:59:07,511 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:59:07,512 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:07,517 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:07,533 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:59:07,543 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:07,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:07,582 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-02 23:59:08,835 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:08,835 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [166217710] [2021-05-02 23:59:08,835 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [166217710] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:08,835 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:08,836 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-02 23:59:08,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579679455] [2021-05-02 23:59:08,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-02 23:59:08,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:08,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-02 23:59:08,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2021-05-02 23:59:08,837 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:12,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:12,904 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2021-05-02 23:59:12,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-02 23:59:12,905 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2021-05-02 23:59:12,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:12,906 INFO L225 Difference]: With dead ends: 118 [2021-05-02 23:59:12,906 INFO L226 Difference]: Without dead ends: 111 [2021-05-02 23:59:12,907 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 3252.8ms TimeCoverageRelationStatistics Valid=401, Invalid=10105, Unknown=0, NotChecked=0, Total=10506 [2021-05-02 23:59:12,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-05-02 23:59:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-05-02 23:59:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2021-05-02 23:59:12,915 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 107 [2021-05-02 23:59:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:12,915 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2021-05-02 23:59:12,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2021-05-02 23:59:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-05-02 23:59:12,916 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:12,916 INFO L523 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:12,916 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-05-02 23:59:12,917 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:12,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:12,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1880247152, now seen corresponding path program 49 times [2021-05-02 23:59:12,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:12,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1336155120] [2021-05-02 23:59:12,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:12,922 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1425 500000) InVars {main_~x~0=v_main_~x~0_1425} OutVars{main_~x~0=v_main_~x~0_1425} AuxVars[] AssignedVars[] [2021-05-02 23:59:12,923 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:59:12,924 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:12,929 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:12,940 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:59:12,950 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:12,951 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1427 999999) (< v_main_~x~0_1427 500000)) InVars {main_~x~0=v_main_~x~0_1427} OutVars{main_~x~0=v_main_~x~0_1427} AuxVars[] AssignedVars[] [2021-05-02 23:59:12,952 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:59:12,954 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:12,959 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:12,971 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:59:12,980 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:13,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:59:14,344 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:14,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1336155120] [2021-05-02 23:59:14,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1336155120] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:14,345 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:14,345 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-05-02 23:59:14,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119863999] [2021-05-02 23:59:14,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-05-02 23:59:14,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:14,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-05-02 23:59:14,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:59:14,346 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:18,353 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2021-05-02 23:59:18,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-02 23:59:18,353 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2021-05-02 23:59:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:18,354 INFO L225 Difference]: With dead ends: 120 [2021-05-02 23:59:18,354 INFO L226 Difference]: Without dead ends: 113 [2021-05-02 23:59:18,355 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 3298.4ms TimeCoverageRelationStatistics Valid=409, Invalid=10511, Unknown=0, NotChecked=0, Total=10920 [2021-05-02 23:59:18,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-02 23:59:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-05-02 23:59:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2021-05-02 23:59:18,361 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 109 [2021-05-02 23:59:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:18,361 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2021-05-02 23:59:18,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:18,362 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2021-05-02 23:59:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-02 23:59:18,362 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:18,362 INFO L523 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:18,362 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-02 23:59:18,362 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:18,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:18,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1985469267, now seen corresponding path program 50 times [2021-05-02 23:59:18,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:18,363 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1939942857] [2021-05-02 23:59:18,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:18,378 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1479 500000) InVars {main_~x~0=v_main_~x~0_1479} OutVars{main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[] [2021-05-02 23:59:18,379 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:59:18,385 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:18,391 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:18,397 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:59:18,407 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:18,408 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1481 999999) (< v_main_~x~0_1481 500000)) InVars {main_~x~0=v_main_~x~0_1481} OutVars{main_~x~0=v_main_~x~0_1481} AuxVars[] AssignedVars[] [2021-05-02 23:59:18,410 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:59:18,410 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:18,415 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:18,426 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:59:18,435 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:18,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:18,475 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-02 23:59:19,855 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:19,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1939942857] [2021-05-02 23:59:19,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1939942857] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:19,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:19,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-02 23:59:19,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080752281] [2021-05-02 23:59:19,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-02 23:59:19,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:19,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-02 23:59:19,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2021-05-02 23:59:19,857 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:23,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:23,994 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2021-05-02 23:59:23,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-02 23:59:23,995 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2021-05-02 23:59:23,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:23,996 INFO L225 Difference]: With dead ends: 122 [2021-05-02 23:59:23,996 INFO L226 Difference]: Without dead ends: 115 [2021-05-02 23:59:23,997 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1392 ImplicationChecksByTransitivity, 3433.6ms TimeCoverageRelationStatistics Valid=417, Invalid=10925, Unknown=0, NotChecked=0, Total=11342 [2021-05-02 23:59:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-05-02 23:59:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-05-02 23:59:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2021-05-02 23:59:24,005 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 111 [2021-05-02 23:59:24,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:24,005 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2021-05-02 23:59:24,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2021-05-02 23:59:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-02 23:59:24,006 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:24,006 INFO L523 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:24,006 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-05-02 23:59:24,006 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:24,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:24,006 INFO L82 PathProgramCache]: Analyzing trace with hash -24706678, now seen corresponding path program 51 times [2021-05-02 23:59:24,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:24,007 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [861348187] [2021-05-02 23:59:24,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:24,011 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1534 500000) InVars {main_~x~0=v_main_~x~0_1534} OutVars{main_~x~0=v_main_~x~0_1534} AuxVars[] AssignedVars[] [2021-05-02 23:59:24,012 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:59:24,013 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:24,017 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:24,027 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:59:24,035 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:24,037 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1536 999999) (< v_main_~x~0_1536 500000)) InVars {main_~x~0=v_main_~x~0_1536} OutVars{main_~x~0=v_main_~x~0_1536} AuxVars[] AssignedVars[] [2021-05-02 23:59:24,041 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:59:24,046 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:24,050 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:24,055 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:59:24,064 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:24,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:59:25,531 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:25,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [861348187] [2021-05-02 23:59:25,532 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [861348187] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:25,532 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:25,532 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-02 23:59:25,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128589020] [2021-05-02 23:59:25,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-02 23:59:25,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:25,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-02 23:59:25,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:59:25,533 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:29,798 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2021-05-02 23:59:29,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-02 23:59:29,799 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2021-05-02 23:59:29,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:29,800 INFO L225 Difference]: With dead ends: 124 [2021-05-02 23:59:29,800 INFO L226 Difference]: Without dead ends: 117 [2021-05-02 23:59:29,801 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 3511.7ms TimeCoverageRelationStatistics Valid=425, Invalid=11347, Unknown=0, NotChecked=0, Total=11772 [2021-05-02 23:59:29,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-05-02 23:59:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-05-02 23:59:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2021-05-02 23:59:29,808 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 113 [2021-05-02 23:59:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:29,808 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2021-05-02 23:59:29,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2021-05-02 23:59:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-05-02 23:59:29,809 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:29,809 INFO L523 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:29,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-05-02 23:59:29,809 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:29,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:29,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1222501593, now seen corresponding path program 52 times [2021-05-02 23:59:29,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:29,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [120204203] [2021-05-02 23:59:29,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:29,813 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1590 500000) InVars {main_~x~0=v_main_~x~0_1590} OutVars{main_~x~0=v_main_~x~0_1590} AuxVars[] AssignedVars[] [2021-05-02 23:59:29,815 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:59:29,819 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:29,823 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:29,829 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:59:29,839 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:29,841 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1592 999999) (< v_main_~x~0_1592 500000)) InVars {main_~x~0=v_main_~x~0_1592} OutVars{main_~x~0=v_main_~x~0_1592} AuxVars[] AssignedVars[] [2021-05-02 23:59:29,843 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:59:29,849 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:29,856 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:29,863 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:59:29,873 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:29,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:29,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-02 23:59:31,382 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:31,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [120204203] [2021-05-02 23:59:31,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [120204203] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:31,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:31,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2021-05-02 23:59:31,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051592256] [2021-05-02 23:59:31,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-05-02 23:59:31,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:31,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-05-02 23:59:31,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2021-05-02 23:59:31,384 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:35,819 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2021-05-02 23:59:35,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-05-02 23:59:35,820 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2021-05-02 23:59:35,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:35,820 INFO L225 Difference]: With dead ends: 126 [2021-05-02 23:59:35,820 INFO L226 Difference]: Without dead ends: 119 [2021-05-02 23:59:35,822 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 3626.0ms TimeCoverageRelationStatistics Valid=433, Invalid=11777, Unknown=0, NotChecked=0, Total=12210 [2021-05-02 23:59:35,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-02 23:59:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-05-02 23:59:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2021-05-02 23:59:35,828 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 115 [2021-05-02 23:59:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:35,828 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2021-05-02 23:59:35,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2021-05-02 23:59:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-05-02 23:59:35,829 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:35,829 INFO L523 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:35,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-05-02 23:59:35,829 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:35,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:35,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1252179580, now seen corresponding path program 53 times [2021-05-02 23:59:35,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:35,830 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1809847526] [2021-05-02 23:59:35,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:35,842 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1647 500000) InVars {main_~x~0=v_main_~x~0_1647} OutVars{main_~x~0=v_main_~x~0_1647} AuxVars[] AssignedVars[] [2021-05-02 23:59:35,843 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:59:35,849 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:35,854 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:35,860 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:59:35,870 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:35,871 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1649 999999) (< v_main_~x~0_1649 500000)) InVars {main_~x~0=v_main_~x~0_1649} OutVars{main_~x~0=v_main_~x~0_1649} AuxVars[] AssignedVars[] [2021-05-02 23:59:35,873 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:59:35,874 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:35,878 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:35,889 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:59:35,899 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:35,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:35,936 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-02 23:59:37,474 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:37,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1809847526] [2021-05-02 23:59:37,474 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1809847526] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:37,474 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:37,474 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2021-05-02 23:59:37,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046613630] [2021-05-02 23:59:37,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2021-05-02 23:59:37,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:37,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-05-02 23:59:37,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 23:59:37,475 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:42,063 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2021-05-02 23:59:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-02 23:59:42,066 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2021-05-02 23:59:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:42,067 INFO L225 Difference]: With dead ends: 128 [2021-05-02 23:59:42,067 INFO L226 Difference]: Without dead ends: 121 [2021-05-02 23:59:42,068 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 3773.1ms TimeCoverageRelationStatistics Valid=441, Invalid=12215, Unknown=0, NotChecked=0, Total=12656 [2021-05-02 23:59:42,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-05-02 23:59:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-05-02 23:59:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:42,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2021-05-02 23:59:42,074 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 117 [2021-05-02 23:59:42,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:42,074 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2021-05-02 23:59:42,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2021-05-02 23:59:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-05-02 23:59:42,075 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:42,075 INFO L523 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:42,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-05-02 23:59:42,075 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:42,075 INFO L82 PathProgramCache]: Analyzing trace with hash 292045985, now seen corresponding path program 54 times [2021-05-02 23:59:42,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:42,076 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [489424926] [2021-05-02 23:59:42,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:42,080 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1705 500000) InVars {main_~x~0=v_main_~x~0_1705} OutVars{main_~x~0=v_main_~x~0_1705} AuxVars[] AssignedVars[] [2021-05-02 23:59:42,081 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:59:42,087 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:42,091 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:42,098 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:59:42,108 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:42,109 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1707 500000) (< v_main_~x~0_1707 999999)) InVars {main_~x~0=v_main_~x~0_1707} OutVars{main_~x~0=v_main_~x~0_1707} AuxVars[] AssignedVars[] [2021-05-02 23:59:42,111 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:59:42,111 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:42,116 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:42,128 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:59:42,138 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:42,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:42,175 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-02 23:59:43,825 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:43,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [489424926] [2021-05-02 23:59:43,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [489424926] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:43,826 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:43,826 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-02 23:59:43,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346613246] [2021-05-02 23:59:43,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-02 23:59:43,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:43,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-02 23:59:43,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2021-05-02 23:59:43,827 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:48,624 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2021-05-02 23:59:48,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-02 23:59:48,624 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2021-05-02 23:59:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:48,625 INFO L225 Difference]: With dead ends: 130 [2021-05-02 23:59:48,625 INFO L226 Difference]: Without dead ends: 123 [2021-05-02 23:59:48,626 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 3967.2ms TimeCoverageRelationStatistics Valid=449, Invalid=12661, Unknown=0, NotChecked=0, Total=13110 [2021-05-02 23:59:48,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-05-02 23:59:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-05-02 23:59:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2021-05-02 23:59:48,641 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 119 [2021-05-02 23:59:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:48,642 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2021-05-02 23:59:48,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2021-05-02 23:59:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-02 23:59:48,643 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:48,643 INFO L523 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:48,643 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-05-02 23:59:48,643 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:48,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:48,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1765870466, now seen corresponding path program 55 times [2021-05-02 23:59:48,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:48,644 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [47111562] [2021-05-02 23:59:48,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:48,649 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1764 500000) InVars {main_~x~0=v_main_~x~0_1764} OutVars{main_~x~0=v_main_~x~0_1764} AuxVars[] AssignedVars[] [2021-05-02 23:59:48,650 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:59:48,651 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:48,656 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:48,667 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:59:48,677 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:48,679 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1766 500000) (< v_main_~x~0_1766 999999)) InVars {main_~x~0=v_main_~x~0_1766} OutVars{main_~x~0=v_main_~x~0_1766} AuxVars[] AssignedVars[] [2021-05-02 23:59:48,680 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:59:48,681 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:48,685 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:48,697 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:59:48,707 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:48,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:48,746 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-02 23:59:50,578 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:50,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [47111562] [2021-05-02 23:59:50,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [47111562] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:50,578 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:50,578 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2021-05-02 23:59:50,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435248153] [2021-05-02 23:59:50,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-05-02 23:59:50,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:50,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-05-02 23:59:50,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 23:59:50,580 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:55,517 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2021-05-02 23:59:55,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-02 23:59:55,518 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-05-02 23:59:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:55,519 INFO L225 Difference]: With dead ends: 132 [2021-05-02 23:59:55,519 INFO L226 Difference]: Without dead ends: 125 [2021-05-02 23:59:55,520 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 52 SyntacticMatches, 11 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 4224.5ms TimeCoverageRelationStatistics Valid=457, Invalid=13115, Unknown=0, NotChecked=0, Total=13572 [2021-05-02 23:59:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-05-02 23:59:55,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-05-02 23:59:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2021-05-02 23:59:55,528 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 121 [2021-05-02 23:59:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:55,528 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2021-05-02 23:59:55,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2021-05-02 23:59:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-02 23:59:55,528 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:55,529 INFO L523 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:55,529 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-05-02 23:59:55,529 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:55,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:55,529 INFO L82 PathProgramCache]: Analyzing trace with hash 556343579, now seen corresponding path program 56 times [2021-05-02 23:59:55,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:55,530 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2028384114] [2021-05-02 23:59:55,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:55,534 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1824 500000) InVars {main_~x~0=v_main_~x~0_1824} OutVars{main_~x~0=v_main_~x~0_1824} AuxVars[] AssignedVars[] [2021-05-02 23:59:55,535 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-02 23:59:55,540 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:55,544 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:55,551 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-02 23:59:55,561 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:55,562 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1826 500000) (< v_main_~x~0_1826 999999)) InVars {main_~x~0=v_main_~x~0_1826} OutVars{main_~x~0=v_main_~x~0_1826} AuxVars[] AssignedVars[] [2021-05-02 23:59:55,564 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-02 23:59:55,570 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:55,574 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-02 23:59:55,581 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-02 23:59:55,591 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:55,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:55,632 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-02 23:59:57,522 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:57,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2028384114] [2021-05-02 23:59:57,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2028384114] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:57,522 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:57,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2021-05-02 23:59:57,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113566507] [2021-05-02 23:59:57,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2021-05-02 23:59:57,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:57,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-05-02 23:59:57,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2021-05-02 23:59:57,523 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:00:02,652 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2021-05-03 00:00:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-05-03 00:00:02,653 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2021-05-03 00:00:02,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:00:02,654 INFO L225 Difference]: With dead ends: 134 [2021-05-03 00:00:02,654 INFO L226 Difference]: Without dead ends: 127 [2021-05-03 00:00:02,655 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 52 SyntacticMatches, 12 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1731 ImplicationChecksByTransitivity, 4355.1ms TimeCoverageRelationStatistics Valid=465, Invalid=13577, Unknown=0, NotChecked=0, Total=14042 [2021-05-03 00:00:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-05-03 00:00:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-05-03 00:00:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2021-05-03 00:00:02,661 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 123 [2021-05-03 00:00:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:00:02,661 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2021-05-03 00:00:02,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2021-05-03 00:00:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-03 00:00:02,662 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:00:02,662 INFO L523 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:00:02,662 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-05-03 00:00:02,662 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:00:02,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:00:02,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1178953096, now seen corresponding path program 57 times [2021-05-03 00:00:02,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:00:02,663 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821771966] [2021-05-03 00:00:02,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:00:02,674 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1885 500000) InVars {main_~x~0=v_main_~x~0_1885} OutVars{main_~x~0=v_main_~x~0_1885} AuxVars[] AssignedVars[] [2021-05-03 00:00:02,675 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:00:02,676 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:02,681 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:02,695 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:00:02,704 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:02,706 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1887 500000) (< v_main_~x~0_1887 999999)) InVars {main_~x~0=v_main_~x~0_1887} OutVars{main_~x~0=v_main_~x~0_1887} AuxVars[] AssignedVars[] [2021-05-03 00:00:02,707 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:00:02,708 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:02,712 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:02,722 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:00:02,746 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:02,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:00:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:02,789 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:00:04,861 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:00:04,861 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821771966] [2021-05-03 00:00:04,862 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [821771966] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:00:04,862 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:00:04,862 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2021-05-03 00:00:04,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454741430] [2021-05-03 00:00:04,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-03 00:00:04,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:00:04,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-03 00:00:04,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2021-05-03 00:00:04,863 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:00:10,171 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-05-03 00:00:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-05-03 00:00:10,172 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2021-05-03 00:00:10,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:00:10,173 INFO L225 Difference]: With dead ends: 136 [2021-05-03 00:00:10,173 INFO L226 Difference]: Without dead ends: 129 [2021-05-03 00:00:10,174 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 54 SyntacticMatches, 10 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 4619.7ms TimeCoverageRelationStatistics Valid=473, Invalid=14047, Unknown=0, NotChecked=0, Total=14520 [2021-05-03 00:00:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-05-03 00:00:10,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-05-03 00:00:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2021-05-03 00:00:10,180 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 125 [2021-05-03 00:00:10,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:00:10,181 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2021-05-03 00:00:10,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2021-05-03 00:00:10,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-05-03 00:00:10,181 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:00:10,181 INFO L523 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:00:10,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-05-03 00:00:10,181 INFO L428 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:00:10,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:00:10,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1943220373, now seen corresponding path program 58 times [2021-05-03 00:00:10,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:00:10,182 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [677059442] [2021-05-03 00:00:10,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:00:10,191 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_1947 500000) InVars {main_~x~0=v_main_~x~0_1947} OutVars{main_~x~0=v_main_~x~0_1947} AuxVars[] AssignedVars[] [2021-05-03 00:00:10,192 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:00:10,199 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:10,204 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:10,211 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:00:10,220 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:10,221 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_1949 999999) (< v_main_~x~0_1949 500000)) InVars {main_~x~0=v_main_~x~0_1949} OutVars{main_~x~0=v_main_~x~0_1949} AuxVars[] AssignedVars[] [2021-05-03 00:00:10,222 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:00:10,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:10,231 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:10,238 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:00:10,247 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:10,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:00:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:10,301 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:00:12,140 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:00:12,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [677059442] [2021-05-03 00:00:12,141 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [677059442] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:00:12,141 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:00:12,141 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2021-05-03 00:00:12,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856378] [2021-05-03 00:00:12,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2021-05-03 00:00:12,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:00:12,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-05-03 00:00:12,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2021-05-03 00:00:12,142 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:00:17,830 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2021-05-03 00:00:17,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-05-03 00:00:17,831 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2021-05-03 00:00:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:00:17,832 INFO L225 Difference]: With dead ends: 138 [2021-05-03 00:00:17,832 INFO L226 Difference]: Without dead ends: 131 [2021-05-03 00:00:17,833 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1840 ImplicationChecksByTransitivity, 4527.3ms TimeCoverageRelationStatistics Valid=481, Invalid=14525, Unknown=0, NotChecked=0, Total=15006 [2021-05-03 00:00:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-03 00:00:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-05-03 00:00:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2021-05-03 00:00:17,843 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 127 [2021-05-03 00:00:17,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:00:17,843 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2021-05-03 00:00:17,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:17,843 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2021-05-03 00:00:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-05-03 00:00:17,844 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:00:17,844 INFO L523 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:00:17,844 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-05-03 00:00:17,844 INFO L428 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:00:17,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:00:17,845 INFO L82 PathProgramCache]: Analyzing trace with hash 169784178, now seen corresponding path program 59 times [2021-05-03 00:00:17,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:00:17,845 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1649143341] [2021-05-03 00:00:17,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:00:17,850 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2010 500000) InVars {main_~x~0=v_main_~x~0_2010} OutVars{main_~x~0=v_main_~x~0_2010} AuxVars[] AssignedVars[] [2021-05-03 00:00:17,851 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:00:17,857 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:17,862 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:17,868 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:00:17,878 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:17,879 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2012 500000) (< v_main_~x~0_2012 999999)) InVars {main_~x~0=v_main_~x~0_2012} OutVars{main_~x~0=v_main_~x~0_2012} AuxVars[] AssignedVars[] [2021-05-03 00:00:17,880 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:00:17,886 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:17,890 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:17,897 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:00:17,906 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:17,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:00:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:17,953 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:00:20,006 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:00:20,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1649143341] [2021-05-03 00:00:20,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1649143341] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:00:20,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:00:20,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2021-05-03 00:00:20,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594161492] [2021-05-03 00:00:20,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2021-05-03 00:00:20,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:00:20,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-05-03 00:00:20,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:00:20,007 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:00:25,928 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2021-05-03 00:00:25,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-05-03 00:00:25,928 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2021-05-03 00:00:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:00:25,929 INFO L225 Difference]: With dead ends: 140 [2021-05-03 00:00:25,929 INFO L226 Difference]: Without dead ends: 133 [2021-05-03 00:00:25,930 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 56 SyntacticMatches, 11 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1909 ImplicationChecksByTransitivity, 4817.6ms TimeCoverageRelationStatistics Valid=489, Invalid=15011, Unknown=0, NotChecked=0, Total=15500 [2021-05-03 00:00:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-05-03 00:00:25,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-05-03 00:00:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2021-05-03 00:00:25,937 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 129 [2021-05-03 00:00:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:00:25,937 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2021-05-03 00:00:25,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2021-05-03 00:00:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-05-03 00:00:25,938 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:00:25,938 INFO L523 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:00:25,938 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-03 00:00:25,938 INFO L428 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:00:25,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:00:25,938 INFO L82 PathProgramCache]: Analyzing trace with hash 999617295, now seen corresponding path program 60 times [2021-05-03 00:00:25,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:00:25,939 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1383900844] [2021-05-03 00:00:25,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:00:25,942 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2074 500000) InVars {main_~x~0=v_main_~x~0_2074} OutVars{main_~x~0=v_main_~x~0_2074} AuxVars[] AssignedVars[] [2021-05-03 00:00:25,944 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:00:25,944 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:25,951 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:25,962 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:00:25,972 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:25,973 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2076 999999) (< v_main_~x~0_2076 500000)) InVars {main_~x~0=v_main_~x~0_2076} OutVars{main_~x~0=v_main_~x~0_2076} AuxVars[] AssignedVars[] [2021-05-03 00:00:25,975 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:00:25,981 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:25,985 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:25,991 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:00:26,001 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:26,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:00:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:26,051 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:00:28,156 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:00:28,157 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1383900844] [2021-05-03 00:00:28,157 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1383900844] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:00:28,157 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:00:28,157 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2021-05-03 00:00:28,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635668207] [2021-05-03 00:00:28,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-03 00:00:28,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:00:28,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-03 00:00:28,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2021-05-03 00:00:28,158 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:00:34,065 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2021-05-03 00:00:34,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-05-03 00:00:34,066 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2021-05-03 00:00:34,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:00:34,067 INFO L225 Difference]: With dead ends: 142 [2021-05-03 00:00:34,067 INFO L226 Difference]: Without dead ends: 135 [2021-05-03 00:00:34,067 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 4875.8ms TimeCoverageRelationStatistics Valid=497, Invalid=15505, Unknown=0, NotChecked=0, Total=16002 [2021-05-03 00:00:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-05-03 00:00:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-05-03 00:00:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2021-05-03 00:00:34,076 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 131 [2021-05-03 00:00:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:00:34,076 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2021-05-03 00:00:34,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2021-05-03 00:00:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-05-03 00:00:34,077 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:00:34,077 INFO L523 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:00:34,077 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-05-03 00:00:34,078 INFO L428 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:00:34,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:00:34,078 INFO L82 PathProgramCache]: Analyzing trace with hash -394674324, now seen corresponding path program 61 times [2021-05-03 00:00:34,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:00:34,078 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1883849733] [2021-05-03 00:00:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:00:34,082 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2139 500000) InVars {main_~x~0=v_main_~x~0_2139} OutVars{main_~x~0=v_main_~x~0_2139} AuxVars[] AssignedVars[] [2021-05-03 00:00:34,083 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:00:34,088 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:34,092 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:34,098 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:00:34,107 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:34,108 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2141 500000) (< v_main_~x~0_2141 999999)) InVars {main_~x~0=v_main_~x~0_2141} OutVars{main_~x~0=v_main_~x~0_2141} AuxVars[] AssignedVars[] [2021-05-03 00:00:34,109 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:00:34,114 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:34,119 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:34,124 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:00:34,133 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:34,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:00:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:34,175 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:00:36,248 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:00:36,249 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1883849733] [2021-05-03 00:00:36,249 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1883849733] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:00:36,249 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:00:36,249 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2021-05-03 00:00:36,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659046649] [2021-05-03 00:00:36,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-05-03 00:00:36,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:00:36,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-05-03 00:00:36,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2021-05-03 00:00:36,250 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:00:42,282 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2021-05-03 00:00:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-05-03 00:00:42,283 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2021-05-03 00:00:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:00:42,283 INFO L225 Difference]: With dead ends: 144 [2021-05-03 00:00:42,283 INFO L226 Difference]: Without dead ends: 137 [2021-05-03 00:00:42,284 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 59 SyntacticMatches, 10 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2032 ImplicationChecksByTransitivity, 4943.6ms TimeCoverageRelationStatistics Valid=505, Invalid=16007, Unknown=0, NotChecked=0, Total=16512 [2021-05-03 00:00:42,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-03 00:00:42,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-05-03 00:00:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2021-05-03 00:00:42,290 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 133 [2021-05-03 00:00:42,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:00:42,291 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2021-05-03 00:00:42,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2021-05-03 00:00:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-05-03 00:00:42,291 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:00:42,291 INFO L523 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:00:42,291 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-05-03 00:00:42,292 INFO L428 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:00:42,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:00:42,292 INFO L82 PathProgramCache]: Analyzing trace with hash -279123831, now seen corresponding path program 62 times [2021-05-03 00:00:42,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:00:42,292 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [739905911] [2021-05-03 00:00:42,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:00:42,301 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2205 500000) InVars {main_~x~0=v_main_~x~0_2205} OutVars{main_~x~0=v_main_~x~0_2205} AuxVars[] AssignedVars[] [2021-05-03 00:00:42,303 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:00:42,308 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:42,313 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:42,320 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:00:42,331 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:42,332 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2207 999999) (< v_main_~x~0_2207 500000)) InVars {main_~x~0=v_main_~x~0_2207} OutVars{main_~x~0=v_main_~x~0_2207} AuxVars[] AssignedVars[] [2021-05-03 00:00:42,334 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:00:42,335 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:42,340 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:42,352 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:00:42,362 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:42,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:00:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:42,398 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:00:44,683 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:00:44,683 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [739905911] [2021-05-03 00:00:44,684 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [739905911] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:00:44,684 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:00:44,684 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2021-05-03 00:00:44,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195436503] [2021-05-03 00:00:44,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2021-05-03 00:00:44,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:00:44,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-05-03 00:00:44,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2021-05-03 00:00:44,685 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:00:50,958 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2021-05-03 00:00:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-05-03 00:00:50,959 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2021-05-03 00:00:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:00:50,960 INFO L225 Difference]: With dead ends: 146 [2021-05-03 00:00:50,960 INFO L226 Difference]: Without dead ends: 139 [2021-05-03 00:00:50,961 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2100 ImplicationChecksByTransitivity, 5239.0ms TimeCoverageRelationStatistics Valid=513, Invalid=16517, Unknown=0, NotChecked=0, Total=17030 [2021-05-03 00:00:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-03 00:00:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-05-03 00:00:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:50,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2021-05-03 00:00:50,967 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 135 [2021-05-03 00:00:50,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:00:50,968 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2021-05-03 00:00:50,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:50,968 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2021-05-03 00:00:50,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-05-03 00:00:50,969 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:00:50,969 INFO L523 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:00:50,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-05-03 00:00:50,969 INFO L428 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:00:50,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:00:50,969 INFO L82 PathProgramCache]: Analyzing trace with hash -904249754, now seen corresponding path program 63 times [2021-05-03 00:00:50,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:00:50,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [131010466] [2021-05-03 00:00:50,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:00:50,974 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2272 500000) InVars {main_~x~0=v_main_~x~0_2272} OutVars{main_~x~0=v_main_~x~0_2272} AuxVars[] AssignedVars[] [2021-05-03 00:00:50,988 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:00:50,989 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:50,994 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:51,005 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:00:51,015 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:51,016 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2274 500000) (< v_main_~x~0_2274 999999)) InVars {main_~x~0=v_main_~x~0_2274} OutVars{main_~x~0=v_main_~x~0_2274} AuxVars[] AssignedVars[] [2021-05-03 00:00:51,017 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:00:51,017 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:51,022 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:51,047 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:00:51,057 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:51,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:00:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:51,103 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:00:53,323 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:00:53,323 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [131010466] [2021-05-03 00:00:53,324 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [131010466] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:00:53,324 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:00:53,324 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2021-05-03 00:00:53,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841527675] [2021-05-03 00:00:53,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2021-05-03 00:00:53,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:00:53,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-05-03 00:00:53,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2021-05-03 00:00:53,325 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:59,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:00:59,795 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2021-05-03 00:00:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-05-03 00:00:59,795 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2021-05-03 00:00:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:00:59,796 INFO L225 Difference]: With dead ends: 148 [2021-05-03 00:00:59,796 INFO L226 Difference]: Without dead ends: 141 [2021-05-03 00:00:59,797 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 5254.4ms TimeCoverageRelationStatistics Valid=521, Invalid=17035, Unknown=0, NotChecked=0, Total=17556 [2021-05-03 00:00:59,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-05-03 00:00:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-05-03 00:00:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2021-05-03 00:00:59,803 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 137 [2021-05-03 00:00:59,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:00:59,803 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2021-05-03 00:00:59,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2021-05-03 00:00:59,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-05-03 00:00:59,804 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:00:59,804 INFO L523 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:00:59,804 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-05-03 00:00:59,804 INFO L428 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:00:59,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:00:59,805 INFO L82 PathProgramCache]: Analyzing trace with hash -354840317, now seen corresponding path program 64 times [2021-05-03 00:00:59,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:00:59,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [151031185] [2021-05-03 00:00:59,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:00:59,811 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2340 500000) InVars {main_~x~0=v_main_~x~0_2340} OutVars{main_~x~0=v_main_~x~0_2340} AuxVars[] AssignedVars[] [2021-05-03 00:00:59,813 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:00:59,818 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:59,822 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:59,828 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:00:59,838 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:59,839 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2342 500000) (< v_main_~x~0_2342 999999)) InVars {main_~x~0=v_main_~x~0_2342} OutVars{main_~x~0=v_main_~x~0_2342} AuxVars[] AssignedVars[] [2021-05-03 00:00:59,840 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:00:59,844 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:59,848 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:00:59,854 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:00:59,863 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:59,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:00:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:59,909 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:01:02,274 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:01:02,274 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [151031185] [2021-05-03 00:01:02,274 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [151031185] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:01:02,274 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:01:02,274 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2021-05-03 00:01:02,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715012219] [2021-05-03 00:01:02,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2021-05-03 00:01:02,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:01:02,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-05-03 00:01:02,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2021-05-03 00:01:02,276 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:01:08,978 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2021-05-03 00:01:08,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-05-03 00:01:08,978 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2021-05-03 00:01:08,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:01:08,979 INFO L225 Difference]: With dead ends: 150 [2021-05-03 00:01:08,979 INFO L226 Difference]: Without dead ends: 143 [2021-05-03 00:01:08,980 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 60 SyntacticMatches, 12 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2231 ImplicationChecksByTransitivity, 5525.3ms TimeCoverageRelationStatistics Valid=529, Invalid=17561, Unknown=0, NotChecked=0, Total=18090 [2021-05-03 00:01:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-03 00:01:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-05-03 00:01:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:08,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2021-05-03 00:01:08,986 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 139 [2021-05-03 00:01:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:01:08,987 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2021-05-03 00:01:08,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2021-05-03 00:01:08,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-05-03 00:01:08,987 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:01:08,987 INFO L523 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:01:08,987 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-05-03 00:01:08,987 INFO L428 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:01:08,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:01:08,988 INFO L82 PathProgramCache]: Analyzing trace with hash -653348768, now seen corresponding path program 65 times [2021-05-03 00:01:08,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:01:08,988 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1297609572] [2021-05-03 00:01:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:01:09,012 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2409 500000) InVars {main_~x~0=v_main_~x~0_2409} OutVars{main_~x~0=v_main_~x~0_2409} AuxVars[] AssignedVars[] [2021-05-03 00:01:09,016 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:01:09,017 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:09,022 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:01:09,034 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:01:09,044 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:09,045 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2411 999999) (< v_main_~x~0_2411 500000)) InVars {main_~x~0=v_main_~x~0_2411} OutVars{main_~x~0=v_main_~x~0_2411} AuxVars[] AssignedVars[] [2021-05-03 00:01:09,046 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:01:09,047 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:09,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:01:09,062 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:01:09,072 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:09,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:01:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:01:11,388 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:01:11,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1297609572] [2021-05-03 00:01:11,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1297609572] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:01:11,388 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:01:11,388 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2021-05-03 00:01:11,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398287592] [2021-05-03 00:01:11,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2021-05-03 00:01:11,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:01:11,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-05-03 00:01:11,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:01:11,389 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:01:18,285 INFO L93 Difference]: Finished difference Result 152 states and 156 transitions. [2021-05-03 00:01:18,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-05-03 00:01:18,285 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2021-05-03 00:01:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:01:18,286 INFO L225 Difference]: With dead ends: 152 [2021-05-03 00:01:18,286 INFO L226 Difference]: Without dead ends: 145 [2021-05-03 00:01:18,287 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2288 ImplicationChecksByTransitivity, 5505.1ms TimeCoverageRelationStatistics Valid=537, Invalid=18095, Unknown=0, NotChecked=0, Total=18632 [2021-05-03 00:01:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-05-03 00:01:18,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-05-03 00:01:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2021-05-03 00:01:18,295 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 141 [2021-05-03 00:01:18,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:01:18,295 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2021-05-03 00:01:18,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2021-05-03 00:01:18,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-03 00:01:18,296 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:01:18,296 INFO L523 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:01:18,296 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-03 00:01:18,296 INFO L428 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:01:18,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:01:18,296 INFO L82 PathProgramCache]: Analyzing trace with hash 242838653, now seen corresponding path program 66 times [2021-05-03 00:01:18,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:01:18,296 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [511258870] [2021-05-03 00:01:18,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:01:18,301 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2479 500000) InVars {main_~x~0=v_main_~x~0_2479} OutVars{main_~x~0=v_main_~x~0_2479} AuxVars[] AssignedVars[] [2021-05-03 00:01:18,302 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:01:18,312 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:18,317 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:01:18,323 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:01:18,334 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:18,336 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2481 999999) (< v_main_~x~0_2481 500000)) InVars {main_~x~0=v_main_~x~0_2481} OutVars{main_~x~0=v_main_~x~0_2481} AuxVars[] AssignedVars[] [2021-05-03 00:01:18,337 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:01:18,337 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:18,342 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:01:18,352 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:01:18,361 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:18,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:01:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:18,441 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:01:20,830 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:01:20,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [511258870] [2021-05-03 00:01:20,830 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [511258870] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:01:20,831 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:01:20,831 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2021-05-03 00:01:20,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123280247] [2021-05-03 00:01:20,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2021-05-03 00:01:20,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:01:20,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-05-03 00:01:20,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2021-05-03 00:01:20,832 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:01:27,970 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2021-05-03 00:01:27,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-05-03 00:01:27,970 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2021-05-03 00:01:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:01:27,971 INFO L225 Difference]: With dead ends: 154 [2021-05-03 00:01:27,971 INFO L226 Difference]: Without dead ends: 147 [2021-05-03 00:01:27,972 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 65 SyntacticMatches, 9 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2360 ImplicationChecksByTransitivity, 5751.1ms TimeCoverageRelationStatistics Valid=545, Invalid=18637, Unknown=0, NotChecked=0, Total=19182 [2021-05-03 00:01:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-05-03 00:01:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-05-03 00:01:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2021-05-03 00:01:27,983 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 143 [2021-05-03 00:01:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:01:27,983 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2021-05-03 00:01:27,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2021-05-03 00:01:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-05-03 00:01:27,984 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:01:27,984 INFO L523 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:01:27,984 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-05-03 00:01:27,984 INFO L428 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:01:27,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:01:27,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1809476262, now seen corresponding path program 67 times [2021-05-03 00:01:27,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:01:27,985 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [702790744] [2021-05-03 00:01:27,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:01:27,989 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2550 500000) InVars {main_~x~0=v_main_~x~0_2550} OutVars{main_~x~0=v_main_~x~0_2550} AuxVars[] AssignedVars[] [2021-05-03 00:01:27,991 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:01:27,996 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:28,001 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:01:28,008 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:01:28,019 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:28,021 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2552 500000) (< v_main_~x~0_2552 999999)) InVars {main_~x~0=v_main_~x~0_2552} OutVars{main_~x~0=v_main_~x~0_2552} AuxVars[] AssignedVars[] [2021-05-03 00:01:28,022 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:01:28,028 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:28,033 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:01:28,040 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:01:28,051 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:28,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:01:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:28,090 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:01:30,755 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:01:30,756 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [702790744] [2021-05-03 00:01:30,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [702790744] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:01:30,756 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:01:30,756 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2021-05-03 00:01:30,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490004184] [2021-05-03 00:01:30,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2021-05-03 00:01:30,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:01:30,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-05-03 00:01:30,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2021-05-03 00:01:30,757 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:01:38,405 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2021-05-03 00:01:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-05-03 00:01:38,405 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2021-05-03 00:01:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:01:38,406 INFO L225 Difference]: With dead ends: 156 [2021-05-03 00:01:38,406 INFO L226 Difference]: Without dead ends: 149 [2021-05-03 00:01:38,407 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 60 SyntacticMatches, 14 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2439 ImplicationChecksByTransitivity, 6235.0ms TimeCoverageRelationStatistics Valid=553, Invalid=19187, Unknown=0, NotChecked=0, Total=19740 [2021-05-03 00:01:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-05-03 00:01:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-05-03 00:01:38,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:38,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2021-05-03 00:01:38,417 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 145 [2021-05-03 00:01:38,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:01:38,417 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2021-05-03 00:01:38,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2021-05-03 00:01:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-05-03 00:01:38,418 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:01:38,418 INFO L523 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:01:38,418 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-05-03 00:01:38,418 INFO L428 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:01:38,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:01:38,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1600846583, now seen corresponding path program 68 times [2021-05-03 00:01:38,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:01:38,419 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1948223430] [2021-05-03 00:01:38,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:01:38,423 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2622 500000) InVars {main_~x~0=v_main_~x~0_2622} OutVars{main_~x~0=v_main_~x~0_2622} AuxVars[] AssignedVars[] [2021-05-03 00:01:38,424 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:01:38,425 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:38,430 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:01:38,442 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:01:38,452 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:38,453 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2624 500000) (< v_main_~x~0_2624 999999)) InVars {main_~x~0=v_main_~x~0_2624} OutVars{main_~x~0=v_main_~x~0_2624} AuxVars[] AssignedVars[] [2021-05-03 00:01:38,454 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:01:38,455 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:38,460 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:01:38,475 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:01:38,488 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:38,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:01:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:38,522 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:01:41,363 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:01:41,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1948223430] [2021-05-03 00:01:41,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1948223430] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:01:41,363 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:01:41,363 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2021-05-03 00:01:41,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115256887] [2021-05-03 00:01:41,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2021-05-03 00:01:41,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:01:41,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-05-03 00:01:41,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=5186, Unknown=0, NotChecked=0, Total=5402 [2021-05-03 00:01:41,365 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:01:48,990 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2021-05-03 00:01:48,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-05-03 00:01:48,991 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2021-05-03 00:01:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:01:48,991 INFO L225 Difference]: With dead ends: 158 [2021-05-03 00:01:48,991 INFO L226 Difference]: Without dead ends: 151 [2021-05-03 00:01:48,993 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 60 SyntacticMatches, 15 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2511 ImplicationChecksByTransitivity, 6400.5ms TimeCoverageRelationStatistics Valid=561, Invalid=19745, Unknown=0, NotChecked=0, Total=20306 [2021-05-03 00:01:48,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-05-03 00:01:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-05-03 00:01:49,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:49,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2021-05-03 00:01:49,002 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 147 [2021-05-03 00:01:49,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:01:49,003 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2021-05-03 00:01:49,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:49,003 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2021-05-03 00:01:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-05-03 00:01:49,003 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:01:49,003 INFO L523 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:01:49,004 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-05-03 00:01:49,004 INFO L428 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:01:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:01:49,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1861053780, now seen corresponding path program 69 times [2021-05-03 00:01:49,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:01:49,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [777723635] [2021-05-03 00:01:49,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:01:49,010 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2695 500000) InVars {main_~x~0=v_main_~x~0_2695} OutVars{main_~x~0=v_main_~x~0_2695} AuxVars[] AssignedVars[] [2021-05-03 00:01:49,011 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:01:49,012 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:49,025 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:01:49,039 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:01:49,050 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:49,052 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2697 999999) (< v_main_~x~0_2697 500000)) InVars {main_~x~0=v_main_~x~0_2697} OutVars{main_~x~0=v_main_~x~0_2697} AuxVars[] AssignedVars[] [2021-05-03 00:01:49,054 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:01:49,054 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:49,060 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:01:49,073 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:01:49,084 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:49,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:01:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:49,120 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:01:51,781 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:01:51,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [777723635] [2021-05-03 00:01:51,781 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [777723635] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:01:51,781 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:01:51,781 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2021-05-03 00:01:51,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436202736] [2021-05-03 00:01:51,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2021-05-03 00:01:51,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:01:51,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-05-03 00:01:51,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2021-05-03 00:01:51,782 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:01:59,634 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2021-05-03 00:01:59,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-05-03 00:01:59,635 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2021-05-03 00:01:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:01:59,636 INFO L225 Difference]: With dead ends: 160 [2021-05-03 00:01:59,636 INFO L226 Difference]: Without dead ends: 153 [2021-05-03 00:01:59,638 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 64 SyntacticMatches, 12 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2576 ImplicationChecksByTransitivity, 6308.8ms TimeCoverageRelationStatistics Valid=569, Invalid=20311, Unknown=0, NotChecked=0, Total=20880 [2021-05-03 00:01:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-05-03 00:01:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-05-03 00:01:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2021-05-03 00:01:59,648 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 149 [2021-05-03 00:01:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:01:59,648 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2021-05-03 00:01:59,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2021-05-03 00:01:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-05-03 00:01:59,649 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:01:59,649 INFO L523 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:01:59,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-05-03 00:01:59,649 INFO L428 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:01:59,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:01:59,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1482900367, now seen corresponding path program 70 times [2021-05-03 00:01:59,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:01:59,650 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1693229728] [2021-05-03 00:01:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:01:59,654 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2769 500000) InVars {main_~x~0=v_main_~x~0_2769} OutVars{main_~x~0=v_main_~x~0_2769} AuxVars[] AssignedVars[] [2021-05-03 00:01:59,655 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:01:59,661 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:59,666 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:01:59,674 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:01:59,684 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:59,689 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2771 500000) (< v_main_~x~0_2771 999999)) InVars {main_~x~0=v_main_~x~0_2771} OutVars{main_~x~0=v_main_~x~0_2771} AuxVars[] AssignedVars[] [2021-05-03 00:01:59,691 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:01:59,691 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:59,696 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:01:59,711 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:01:59,722 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:59,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:01:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:59,753 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:02:02,391 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:02:02,391 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1693229728] [2021-05-03 00:02:02,391 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1693229728] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:02:02,391 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:02:02,391 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2021-05-03 00:02:02,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438794141] [2021-05-03 00:02:02,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2021-05-03 00:02:02,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:02:02,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-05-03 00:02:02,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=5478, Unknown=0, NotChecked=0, Total=5700 [2021-05-03 00:02:02,393 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand has 74 states, 74 states have (on average 1.9864864864864864) internal successors, (147), 73 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:02:10,541 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2021-05-03 00:02:10,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-05-03 00:02:10,542 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.9864864864864864) internal successors, (147), 73 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2021-05-03 00:02:10,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:02:10,543 INFO L225 Difference]: With dead ends: 162 [2021-05-03 00:02:10,543 INFO L226 Difference]: Without dead ends: 155 [2021-05-03 00:02:10,543 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2638 ImplicationChecksByTransitivity, 6384.0ms TimeCoverageRelationStatistics Valid=577, Invalid=20885, Unknown=0, NotChecked=0, Total=21462 [2021-05-03 00:02:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-05-03 00:02:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-05-03 00:02:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2021-05-03 00:02:10,550 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 151 [2021-05-03 00:02:10,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:02:10,550 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2021-05-03 00:02:10,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 74 states, 74 states have (on average 1.9864864864864864) internal successors, (147), 73 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2021-05-03 00:02:10,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-05-03 00:02:10,550 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:02:10,551 INFO L523 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:02:10,551 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-05-03 00:02:10,551 INFO L428 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:02:10,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:02:10,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1907669070, now seen corresponding path program 71 times [2021-05-03 00:02:10,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:02:10,551 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1579166658] [2021-05-03 00:02:10,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:02:10,555 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2844 500000) InVars {main_~x~0=v_main_~x~0_2844} OutVars{main_~x~0=v_main_~x~0_2844} AuxVars[] AssignedVars[] [2021-05-03 00:02:10,555 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:02:10,556 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:10,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:02:10,570 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:02:10,580 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:10,581 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2846 500000) (< v_main_~x~0_2846 999999)) InVars {main_~x~0=v_main_~x~0_2846} OutVars{main_~x~0=v_main_~x~0_2846} AuxVars[] AssignedVars[] [2021-05-03 00:02:10,582 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:02:10,588 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:10,592 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:02:10,598 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:02:10,608 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:10,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:02:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:02:13,517 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:02:13,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1579166658] [2021-05-03 00:02:13,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1579166658] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:02:13,517 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:02:13,517 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2021-05-03 00:02:13,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822044018] [2021-05-03 00:02:13,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2021-05-03 00:02:13,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:02:13,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-05-03 00:02:13,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=5627, Unknown=0, NotChecked=0, Total=5852 [2021-05-03 00:02:13,518 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand has 75 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 74 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:02:22,042 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2021-05-03 00:02:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-05-03 00:02:22,043 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 74 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2021-05-03 00:02:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:02:22,043 INFO L225 Difference]: With dead ends: 164 [2021-05-03 00:02:22,043 INFO L226 Difference]: Without dead ends: 157 [2021-05-03 00:02:22,044 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 68 SyntacticMatches, 11 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2719 ImplicationChecksByTransitivity, 6822.1ms TimeCoverageRelationStatistics Valid=585, Invalid=21467, Unknown=0, NotChecked=0, Total=22052 [2021-05-03 00:02:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-05-03 00:02:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-05-03 00:02:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2021-05-03 00:02:22,051 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 153 [2021-05-03 00:02:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:02:22,051 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2021-05-03 00:02:22,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 75 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 74 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2021-05-03 00:02:22,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-05-03 00:02:22,052 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:02:22,052 INFO L523 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:02:22,052 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-05-03 00:02:22,052 INFO L428 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:02:22,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:02:22,053 INFO L82 PathProgramCache]: Analyzing trace with hash 364720363, now seen corresponding path program 72 times [2021-05-03 00:02:22,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:02:22,053 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [692522552] [2021-05-03 00:02:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:02:22,065 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2920 500000) InVars {main_~x~0=v_main_~x~0_2920} OutVars{main_~x~0=v_main_~x~0_2920} AuxVars[] AssignedVars[] [2021-05-03 00:02:22,066 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:02:22,072 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:22,077 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:02:22,084 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:02:22,094 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:22,096 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2922 500000) (< v_main_~x~0_2922 999999)) InVars {main_~x~0=v_main_~x~0_2922} OutVars{main_~x~0=v_main_~x~0_2922} AuxVars[] AssignedVars[] [2021-05-03 00:02:22,103 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:02:22,110 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:22,115 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:02:22,121 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:02:22,132 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:22,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:02:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:22,166 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:02:25,102 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:02:25,102 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [692522552] [2021-05-03 00:02:25,102 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [692522552] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:02:25,103 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:02:25,103 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2021-05-03 00:02:25,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312397945] [2021-05-03 00:02:25,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2021-05-03 00:02:25,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:02:25,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-05-03 00:02:25,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=5778, Unknown=0, NotChecked=0, Total=6006 [2021-05-03 00:02:25,104 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand has 76 states, 76 states have (on average 1.986842105263158) internal successors, (151), 75 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:02:33,695 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2021-05-03 00:02:33,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-05-03 00:02:33,696 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.986842105263158) internal successors, (151), 75 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2021-05-03 00:02:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:02:33,696 INFO L225 Difference]: With dead ends: 166 [2021-05-03 00:02:33,697 INFO L226 Difference]: Without dead ends: 159 [2021-05-03 00:02:33,697 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 69 SyntacticMatches, 10 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2791 ImplicationChecksByTransitivity, 6890.7ms TimeCoverageRelationStatistics Valid=593, Invalid=22057, Unknown=0, NotChecked=0, Total=22650 [2021-05-03 00:02:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-05-03 00:02:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-05-03 00:02:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2021-05-03 00:02:33,705 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 155 [2021-05-03 00:02:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:02:33,706 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2021-05-03 00:02:33,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 76 states, 76 states have (on average 1.986842105263158) internal successors, (151), 75 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:33,706 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2021-05-03 00:02:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-05-03 00:02:33,706 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:02:33,707 INFO L523 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:02:33,707 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-05-03 00:02:33,707 INFO L428 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:02:33,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:02:33,707 INFO L82 PathProgramCache]: Analyzing trace with hash -645269944, now seen corresponding path program 73 times [2021-05-03 00:02:33,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:02:33,707 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [25270120] [2021-05-03 00:02:33,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:02:33,711 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_2997 500000) InVars {main_~x~0=v_main_~x~0_2997} OutVars{main_~x~0=v_main_~x~0_2997} AuxVars[] AssignedVars[] [2021-05-03 00:02:33,713 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:02:33,719 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:33,724 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:02:33,731 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:02:33,742 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:33,743 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_2999 999999) (< v_main_~x~0_2999 500000)) InVars {main_~x~0=v_main_~x~0_2999} OutVars{main_~x~0=v_main_~x~0_2999} AuxVars[] AssignedVars[] [2021-05-03 00:02:33,744 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:02:33,749 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:33,754 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:02:33,759 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:02:33,769 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:33,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:02:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:33,812 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:02:37,066 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:02:37,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [25270120] [2021-05-03 00:02:37,066 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [25270120] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:02:37,066 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:02:37,066 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2021-05-03 00:02:37,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193030287] [2021-05-03 00:02:37,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2021-05-03 00:02:37,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:02:37,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-05-03 00:02:37,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:02:37,068 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand has 77 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 76 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:46,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:02:46,035 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2021-05-03 00:02:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2021-05-03 00:02:46,035 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 76 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2021-05-03 00:02:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:02:46,036 INFO L225 Difference]: With dead ends: 168 [2021-05-03 00:02:46,036 INFO L226 Difference]: Without dead ends: 161 [2021-05-03 00:02:46,037 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 67 SyntacticMatches, 14 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2874 ImplicationChecksByTransitivity, 7361.1ms TimeCoverageRelationStatistics Valid=601, Invalid=22655, Unknown=0, NotChecked=0, Total=23256 [2021-05-03 00:02:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-05-03 00:02:46,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-05-03 00:02:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 156 states have (on average 1.0128205128205128) internal successors, (158), 156 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2021-05-03 00:02:46,047 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 157 [2021-05-03 00:02:46,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:02:46,047 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2021-05-03 00:02:46,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 77 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 76 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2021-05-03 00:02:46,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-05-03 00:02:46,048 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:02:46,048 INFO L523 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:02:46,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-05-03 00:02:46,048 INFO L428 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:02:46,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:02:46,048 INFO L82 PathProgramCache]: Analyzing trace with hash -583346075, now seen corresponding path program 74 times [2021-05-03 00:02:46,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:02:46,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1529657696] [2021-05-03 00:02:46,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:02:46,053 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3075 500000) InVars {main_~x~0=v_main_~x~0_3075} OutVars{main_~x~0=v_main_~x~0_3075} AuxVars[] AssignedVars[] [2021-05-03 00:02:46,054 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:02:46,061 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:46,066 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:02:46,073 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:02:46,083 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:46,084 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3077 999999) (< v_main_~x~0_3077 500000)) InVars {main_~x~0=v_main_~x~0_3077} OutVars{main_~x~0=v_main_~x~0_3077} AuxVars[] AssignedVars[] [2021-05-03 00:02:46,085 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:02:46,086 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:46,090 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:02:46,101 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:02:46,111 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:46,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:02:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:46,146 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:02:49,428 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:02:49,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1529657696] [2021-05-03 00:02:49,429 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1529657696] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:02:49,429 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:02:49,429 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2021-05-03 00:02:49,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368893489] [2021-05-03 00:02:49,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-03 00:02:49,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:02:49,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-03 00:02:49,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=6086, Unknown=0, NotChecked=0, Total=6320 [2021-05-03 00:02:49,430 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand has 78 states, 78 states have (on average 1.9871794871794872) internal successors, (155), 77 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:58,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:02:58,577 INFO L93 Difference]: Finished difference Result 170 states and 174 transitions. [2021-05-03 00:02:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-05-03 00:02:58,578 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.9871794871794872) internal successors, (155), 77 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 159 [2021-05-03 00:02:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:02:58,578 INFO L225 Difference]: With dead ends: 170 [2021-05-03 00:02:58,578 INFO L226 Difference]: Without dead ends: 163 [2021-05-03 00:02:58,579 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 69 SyntacticMatches, 13 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2948 ImplicationChecksByTransitivity, 7479.2ms TimeCoverageRelationStatistics Valid=609, Invalid=23261, Unknown=0, NotChecked=0, Total=23870 [2021-05-03 00:02:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-05-03 00:02:58,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-05-03 00:02:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 158 states have (on average 1.0126582278481013) internal successors, (160), 158 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2021-05-03 00:02:58,595 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 159 [2021-05-03 00:02:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:02:58,595 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2021-05-03 00:02:58,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 78 states, 78 states have (on average 1.9871794871794872) internal successors, (155), 77 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2021-05-03 00:02:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-05-03 00:02:58,596 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:02:58,596 INFO L523 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:02:58,596 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-05-03 00:02:58,596 INFO L428 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:02:58,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:02:58,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1204050110, now seen corresponding path program 75 times [2021-05-03 00:02:58,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:02:58,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [878516674] [2021-05-03 00:02:58,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:02:58,601 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3154 500000) InVars {main_~x~0=v_main_~x~0_3154} OutVars{main_~x~0=v_main_~x~0_3154} AuxVars[] AssignedVars[] [2021-05-03 00:02:58,603 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:02:58,610 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:58,615 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:02:58,623 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:02:58,635 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:58,636 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3156 500000) (< v_main_~x~0_3156 999999)) InVars {main_~x~0=v_main_~x~0_3156} OutVars{main_~x~0=v_main_~x~0_3156} AuxVars[] AssignedVars[] [2021-05-03 00:02:58,637 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:02:58,637 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:58,642 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:02:58,655 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:02:58,668 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:58,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:02:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:58,710 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:03:01,976 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:01,976 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [878516674] [2021-05-03 00:03:01,976 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [878516674] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:01,976 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:01,976 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [79] imperfect sequences [] total 79 [2021-05-03 00:03:01,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508733167] [2021-05-03 00:03:01,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2021-05-03 00:03:01,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:01,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2021-05-03 00:03:01,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2021-05-03 00:03:01,977 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:11,560 INFO L93 Difference]: Finished difference Result 172 states and 176 transitions. [2021-05-03 00:03:11,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-05-03 00:03:11,561 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2021-05-03 00:03:11,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:11,562 INFO L225 Difference]: With dead ends: 172 [2021-05-03 00:03:11,562 INFO L226 Difference]: Without dead ends: 165 [2021-05-03 00:03:11,563 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 67 SyntacticMatches, 15 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3029 ImplicationChecksByTransitivity, 7670.6ms TimeCoverageRelationStatistics Valid=617, Invalid=23875, Unknown=0, NotChecked=0, Total=24492 [2021-05-03 00:03:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-05-03 00:03:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-05-03 00:03:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.0125) internal successors, (162), 160 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2021-05-03 00:03:11,569 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 161 [2021-05-03 00:03:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:11,570 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2021-05-03 00:03:11,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2021-05-03 00:03:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-05-03 00:03:11,571 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:11,571 INFO L523 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:11,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-05-03 00:03:11,571 INFO L428 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:11,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:11,571 INFO L82 PathProgramCache]: Analyzing trace with hash -700173601, now seen corresponding path program 76 times [2021-05-03 00:03:11,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:11,571 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [569130029] [2021-05-03 00:03:11,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:11,578 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3234 500000) InVars {main_~x~0=v_main_~x~0_3234} OutVars{main_~x~0=v_main_~x~0_3234} AuxVars[] AssignedVars[] [2021-05-03 00:03:11,579 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:03:11,585 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:11,589 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:11,595 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:03:11,605 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:11,606 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3236 999999) (< v_main_~x~0_3236 500000)) InVars {main_~x~0=v_main_~x~0_3236} OutVars{main_~x~0=v_main_~x~0_3236} AuxVars[] AssignedVars[] [2021-05-03 00:03:11,607 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:03:11,612 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:11,616 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:11,622 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:03:11,632 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:11,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:11,672 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:03:14,855 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:14,855 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [569130029] [2021-05-03 00:03:14,855 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [569130029] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:14,855 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:14,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2021-05-03 00:03:14,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791371810] [2021-05-03 00:03:14,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2021-05-03 00:03:14,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:14,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-05-03 00:03:14,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=6402, Unknown=0, NotChecked=0, Total=6642 [2021-05-03 00:03:14,857 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:24,960 INFO L93 Difference]: Finished difference Result 174 states and 178 transitions. [2021-05-03 00:03:24,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-05-03 00:03:24,961 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 163 [2021-05-03 00:03:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:24,962 INFO L225 Difference]: With dead ends: 174 [2021-05-03 00:03:24,962 INFO L226 Difference]: Without dead ends: 167 [2021-05-03 00:03:24,963 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 72 SyntacticMatches, 11 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3099 ImplicationChecksByTransitivity, 7795.9ms TimeCoverageRelationStatistics Valid=625, Invalid=24497, Unknown=0, NotChecked=0, Total=25122 [2021-05-03 00:03:24,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-05-03 00:03:24,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-05-03 00:03:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.0123456790123457) internal successors, (164), 162 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2021-05-03 00:03:24,970 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 163 [2021-05-03 00:03:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:24,970 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2021-05-03 00:03:24,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2021-05-03 00:03:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-05-03 00:03:24,971 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:24,971 INFO L523 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:24,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-05-03 00:03:24,971 INFO L428 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:24,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:24,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1806152900, now seen corresponding path program 77 times [2021-05-03 00:03:24,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:24,971 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1028725111] [2021-05-03 00:03:24,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:24,989 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3315 500000) InVars {main_~x~0=v_main_~x~0_3315} OutVars{main_~x~0=v_main_~x~0_3315} AuxVars[] AssignedVars[] [2021-05-03 00:03:24,991 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:03:24,991 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:24,996 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:25,009 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:03:25,020 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:25,022 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3317 500000) (< v_main_~x~0_3317 999999)) InVars {main_~x~0=v_main_~x~0_3317} OutVars{main_~x~0=v_main_~x~0_3317} AuxVars[] AssignedVars[] [2021-05-03 00:03:25,023 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:03:25,024 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:25,029 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:25,041 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:03:25,051 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:25,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:25,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:03:28,448 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:28,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1028725111] [2021-05-03 00:03:28,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1028725111] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:28,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:28,449 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2021-05-03 00:03:28,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305292688] [2021-05-03 00:03:28,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2021-05-03 00:03:28,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:28,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2021-05-03 00:03:28,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2021-05-03 00:03:28,450 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:38,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:38,589 INFO L93 Difference]: Finished difference Result 176 states and 180 transitions. [2021-05-03 00:03:38,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-05-03 00:03:38,590 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2021-05-03 00:03:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:38,590 INFO L225 Difference]: With dead ends: 176 [2021-05-03 00:03:38,590 INFO L226 Difference]: Without dead ends: 169 [2021-05-03 00:03:38,591 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 75 SyntacticMatches, 10 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3176 ImplicationChecksByTransitivity, 7951.3ms TimeCoverageRelationStatistics Valid=633, Invalid=25127, Unknown=0, NotChecked=0, Total=25760 [2021-05-03 00:03:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-05-03 00:03:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-05-03 00:03:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.0121951219512195) internal successors, (166), 164 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2021-05-03 00:03:38,599 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 165 [2021-05-03 00:03:38,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:38,599 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2021-05-03 00:03:38,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2021-05-03 00:03:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-05-03 00:03:38,600 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:38,600 INFO L523 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:38,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-05-03 00:03:38,600 INFO L428 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:38,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:38,600 INFO L82 PathProgramCache]: Analyzing trace with hash 499630169, now seen corresponding path program 78 times [2021-05-03 00:03:38,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:38,600 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [687188789] [2021-05-03 00:03:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:38,604 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3397 500000) InVars {main_~x~0=v_main_~x~0_3397} OutVars{main_~x~0=v_main_~x~0_3397} AuxVars[] AssignedVars[] [2021-05-03 00:03:38,605 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:03:38,606 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:38,611 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:38,623 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:03:38,633 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:38,634 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3399 500000) (< v_main_~x~0_3399 999999)) InVars {main_~x~0=v_main_~x~0_3399} OutVars{main_~x~0=v_main_~x~0_3399} AuxVars[] AssignedVars[] [2021-05-03 00:03:38,635 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:03:38,636 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:38,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:38,653 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:03:38,663 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:38,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:38,712 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:03:42,546 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:42,547 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [687188789] [2021-05-03 00:03:42,547 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [687188789] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:42,547 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:42,547 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2021-05-03 00:03:42,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137476654] [2021-05-03 00:03:42,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2021-05-03 00:03:42,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:42,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2021-05-03 00:03:42,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=6726, Unknown=0, NotChecked=0, Total=6972 [2021-05-03 00:03:42,548 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:53,566 INFO L93 Difference]: Finished difference Result 178 states and 182 transitions. [2021-05-03 00:03:53,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-05-03 00:03:53,566 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 167 [2021-05-03 00:03:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:53,567 INFO L225 Difference]: With dead ends: 178 [2021-05-03 00:03:53,567 INFO L226 Difference]: Without dead ends: 171 [2021-05-03 00:03:53,568 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 69 SyntacticMatches, 17 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3270 ImplicationChecksByTransitivity, 8815.7ms TimeCoverageRelationStatistics Valid=641, Invalid=25765, Unknown=0, NotChecked=0, Total=26406 [2021-05-03 00:03:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-05-03 00:03:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-05-03 00:03:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.0120481927710843) internal successors, (168), 166 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2021-05-03 00:03:53,581 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 167 [2021-05-03 00:03:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:53,581 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2021-05-03 00:03:53,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2021-05-03 00:03:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-05-03 00:03:53,582 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:53,582 INFO L523 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:53,582 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-05-03 00:03:53,583 INFO L428 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:53,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:53,583 INFO L82 PathProgramCache]: Analyzing trace with hash 154034742, now seen corresponding path program 79 times [2021-05-03 00:03:53,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:53,583 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [745868766] [2021-05-03 00:03:53,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:53,589 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3480 500000) InVars {main_~x~0=v_main_~x~0_3480} OutVars{main_~x~0=v_main_~x~0_3480} AuxVars[] AssignedVars[] [2021-05-03 00:03:53,590 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:03:53,591 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:53,598 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:53,613 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:03:53,624 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:53,625 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3482 500000) (< v_main_~x~0_3482 999999)) InVars {main_~x~0=v_main_~x~0_3482} OutVars{main_~x~0=v_main_~x~0_3482} AuxVars[] AssignedVars[] [2021-05-03 00:03:53,627 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:03:53,633 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:53,639 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:03:53,646 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:03:53,657 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:53,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:53,699 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:03:57,658 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:57,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [745868766] [2021-05-03 00:03:57,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [745868766] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:57,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:57,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2021-05-03 00:03:57,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183444830] [2021-05-03 00:03:57,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2021-05-03 00:03:57,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:57,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2021-05-03 00:03:57,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=6891, Unknown=0, NotChecked=0, Total=7140 [2021-05-03 00:03:57,660 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand has 83 states, 83 states have (on average 1.9879518072289157) internal successors, (165), 82 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:08,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:08,394 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2021-05-03 00:04:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-05-03 00:04:08,395 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.9879518072289157) internal successors, (165), 82 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 169 [2021-05-03 00:04:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:08,395 INFO L225 Difference]: With dead ends: 180 [2021-05-03 00:04:08,395 INFO L226 Difference]: Without dead ends: 173 [2021-05-03 00:04:08,396 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 73 SyntacticMatches, 13 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3343 ImplicationChecksByTransitivity, 8789.8ms TimeCoverageRelationStatistics Valid=649, Invalid=26411, Unknown=0, NotChecked=0, Total=27060 [2021-05-03 00:04:08,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-05-03 00:04:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2021-05-03 00:04:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.0119047619047619) internal successors, (170), 168 states have internal predecessors, (170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2021-05-03 00:04:08,413 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 169 [2021-05-03 00:04:08,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:08,413 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2021-05-03 00:04:08,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 83 states, 83 states have (on average 1.9879518072289157) internal successors, (165), 82 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2021-05-03 00:04:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-05-03 00:04:08,414 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:08,414 INFO L523 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:08,414 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-03 00:04:08,415 INFO L428 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:08,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:08,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1250688813, now seen corresponding path program 80 times [2021-05-03 00:04:08,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:08,415 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [759901613] [2021-05-03 00:04:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:08,420 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3564 500000) InVars {main_~x~0=v_main_~x~0_3564} OutVars{main_~x~0=v_main_~x~0_3564} AuxVars[] AssignedVars[] [2021-05-03 00:04:08,421 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:04:08,427 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:08,432 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:08,440 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:04:08,451 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:08,452 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3566 500000) (< v_main_~x~0_3566 999999)) InVars {main_~x~0=v_main_~x~0_3566} OutVars{main_~x~0=v_main_~x~0_3566} AuxVars[] AssignedVars[] [2021-05-03 00:04:08,453 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:04:08,459 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:08,464 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:08,471 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:04:08,482 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:08,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:08,515 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:04:12,358 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:12,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [759901613] [2021-05-03 00:04:12,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [759901613] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:12,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:12,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2021-05-03 00:04:12,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423542700] [2021-05-03 00:04:12,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2021-05-03 00:04:12,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:12,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-05-03 00:04:12,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=7058, Unknown=0, NotChecked=0, Total=7310 [2021-05-03 00:04:12,360 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand has 84 states, 84 states have (on average 1.9880952380952381) internal successors, (167), 83 states have internal predecessors, (167), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:24,172 INFO L93 Difference]: Finished difference Result 182 states and 186 transitions. [2021-05-03 00:04:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-05-03 00:04:24,173 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 1.9880952380952381) internal successors, (167), 83 states have internal predecessors, (167), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 171 [2021-05-03 00:04:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:24,174 INFO L225 Difference]: With dead ends: 182 [2021-05-03 00:04:24,174 INFO L226 Difference]: Without dead ends: 175 [2021-05-03 00:04:24,175 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 78 SyntacticMatches, 9 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3417 ImplicationChecksByTransitivity, 9127.5ms TimeCoverageRelationStatistics Valid=657, Invalid=27065, Unknown=0, NotChecked=0, Total=27722 [2021-05-03 00:04:24,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-05-03 00:04:24,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-05-03 00:04:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.011764705882353) internal successors, (172), 170 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2021-05-03 00:04:24,185 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 171 [2021-05-03 00:04:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:24,186 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2021-05-03 00:04:24,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 84 states, 84 states have (on average 1.9880952380952381) internal successors, (167), 83 states have internal predecessors, (167), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2021-05-03 00:04:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-05-03 00:04:24,187 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:24,187 INFO L523 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:24,187 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-05-03 00:04:24,187 INFO L428 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:24,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:24,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1724673072, now seen corresponding path program 81 times [2021-05-03 00:04:24,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:24,187 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [498049040] [2021-05-03 00:04:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:24,192 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3649 500000) InVars {main_~x~0=v_main_~x~0_3649} OutVars{main_~x~0=v_main_~x~0_3649} AuxVars[] AssignedVars[] [2021-05-03 00:04:24,194 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:04:24,194 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:24,200 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:24,213 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:04:24,225 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:24,227 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3651 999999) (< v_main_~x~0_3651 500000)) InVars {main_~x~0=v_main_~x~0_3651} OutVars{main_~x~0=v_main_~x~0_3651} AuxVars[] AssignedVars[] [2021-05-03 00:04:24,228 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:04:24,229 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:24,234 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:24,246 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:04:24,257 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:24,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:04:28,639 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:28,640 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [498049040] [2021-05-03 00:04:28,640 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [498049040] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:28,640 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:28,640 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [85] imperfect sequences [] total 85 [2021-05-03 00:04:28,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663208352] [2021-05-03 00:04:28,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2021-05-03 00:04:28,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:28,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2021-05-03 00:04:28,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2021-05-03 00:04:28,641 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand has 85 states, 85 states have (on average 1.988235294117647) internal successors, (169), 84 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:41,062 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2021-05-03 00:04:41,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-05-03 00:04:41,063 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 1.988235294117647) internal successors, (169), 84 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2021-05-03 00:04:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:41,063 INFO L225 Difference]: With dead ends: 184 [2021-05-03 00:04:41,064 INFO L226 Difference]: Without dead ends: 177 [2021-05-03 00:04:41,065 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 68 SyntacticMatches, 20 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3522 ImplicationChecksByTransitivity, 9914.5ms TimeCoverageRelationStatistics Valid=665, Invalid=27727, Unknown=0, NotChecked=0, Total=28392 [2021-05-03 00:04:41,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-05-03 00:04:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-05-03 00:04:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.0116279069767442) internal successors, (174), 172 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2021-05-03 00:04:41,072 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 173 [2021-05-03 00:04:41,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:41,072 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2021-05-03 00:04:41,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 85 states, 85 states have (on average 1.988235294117647) internal successors, (169), 84 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2021-05-03 00:04:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-05-03 00:04:41,073 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:41,073 INFO L523 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:41,074 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-05-03 00:04:41,074 INFO L428 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:41,074 INFO L82 PathProgramCache]: Analyzing trace with hash 599225421, now seen corresponding path program 82 times [2021-05-03 00:04:41,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:41,074 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [748227845] [2021-05-03 00:04:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:41,089 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3735 500000) InVars {main_~x~0=v_main_~x~0_3735} OutVars{main_~x~0=v_main_~x~0_3735} AuxVars[] AssignedVars[] [2021-05-03 00:04:41,090 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:04:41,091 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:41,098 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:41,114 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:04:41,130 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:41,132 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3737 500000) (< v_main_~x~0_3737 999999)) InVars {main_~x~0=v_main_~x~0_3737} OutVars{main_~x~0=v_main_~x~0_3737} AuxVars[] AssignedVars[] [2021-05-03 00:04:41,134 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:04:41,142 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:41,149 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:41,160 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:04:41,175 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:41,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:41,227 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:04:45,831 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:45,831 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [748227845] [2021-05-03 00:04:45,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [748227845] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:45,832 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:45,832 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [86] imperfect sequences [] total 86 [2021-05-03 00:04:45,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686965846] [2021-05-03 00:04:45,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2021-05-03 00:04:45,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:45,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-05-03 00:04:45,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=7398, Unknown=0, NotChecked=0, Total=7656 [2021-05-03 00:04:45,833 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand has 86 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 85 states have internal predecessors, (171), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:57,934 INFO L93 Difference]: Finished difference Result 186 states and 190 transitions. [2021-05-03 00:04:57,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-05-03 00:04:57,935 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 85 states have internal predecessors, (171), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 175 [2021-05-03 00:04:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:57,936 INFO L225 Difference]: With dead ends: 186 [2021-05-03 00:04:57,936 INFO L226 Difference]: Without dead ends: 179 [2021-05-03 00:04:57,937 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 76 SyntacticMatches, 14 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3594 ImplicationChecksByTransitivity, 9958.7ms TimeCoverageRelationStatistics Valid=673, Invalid=28397, Unknown=0, NotChecked=0, Total=29070 [2021-05-03 00:04:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-05-03 00:04:57,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2021-05-03 00:04:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.0114942528735633) internal successors, (176), 174 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2021-05-03 00:04:57,944 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 175 [2021-05-03 00:04:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:57,944 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2021-05-03 00:04:57,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 86 states, 86 states have (on average 1.9883720930232558) internal successors, (171), 85 states have internal predecessors, (171), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2021-05-03 00:04:57,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-05-03 00:04:57,945 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:57,945 INFO L523 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:57,945 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2021-05-03 00:04:57,945 INFO L428 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:57,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:57,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1375791402, now seen corresponding path program 83 times [2021-05-03 00:04:57,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:57,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2022881817] [2021-05-03 00:04:57,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:57,952 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3822 500000) InVars {main_~x~0=v_main_~x~0_3822} OutVars{main_~x~0=v_main_~x~0_3822} AuxVars[] AssignedVars[] [2021-05-03 00:04:57,953 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:04:57,954 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:57,959 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:57,974 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:04:57,986 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:57,987 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3824 999999) (< v_main_~x~0_3824 500000)) InVars {main_~x~0=v_main_~x~0_3824} OutVars{main_~x~0=v_main_~x~0_3824} AuxVars[] AssignedVars[] [2021-05-03 00:04:57,989 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:04:57,995 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:58,000 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:04:58,007 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:04:58,021 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:58,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:58,076 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:05:02,801 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:02,802 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2022881817] [2021-05-03 00:05:02,802 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2022881817] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:02,802 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:02,802 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [87] imperfect sequences [] total 87 [2021-05-03 00:05:02,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027082694] [2021-05-03 00:05:02,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2021-05-03 00:05:02,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:02,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2021-05-03 00:05:02,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=7571, Unknown=0, NotChecked=0, Total=7832 [2021-05-03 00:05:02,803 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand has 87 states, 87 states have (on average 1.9885057471264367) internal successors, (173), 86 states have internal predecessors, (173), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:16,778 INFO L93 Difference]: Finished difference Result 188 states and 192 transitions. [2021-05-03 00:05:16,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-05-03 00:05:16,779 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 1.9885057471264367) internal successors, (173), 86 states have internal predecessors, (173), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 177 [2021-05-03 00:05:16,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:16,779 INFO L225 Difference]: With dead ends: 188 [2021-05-03 00:05:16,779 INFO L226 Difference]: Without dead ends: 181 [2021-05-03 00:05:16,780 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 77 SyntacticMatches, 14 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3679 ImplicationChecksByTransitivity, 10852.6ms TimeCoverageRelationStatistics Valid=681, Invalid=29075, Unknown=0, NotChecked=0, Total=29756 [2021-05-03 00:05:16,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-05-03 00:05:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-05-03 00:05:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.0113636363636365) internal successors, (178), 176 states have internal predecessors, (178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2021-05-03 00:05:16,788 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 177 [2021-05-03 00:05:16,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:16,788 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2021-05-03 00:05:16,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 87 states, 87 states have (on average 1.9885057471264367) internal successors, (173), 86 states have internal predecessors, (173), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2021-05-03 00:05:16,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-05-03 00:05:16,789 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:16,789 INFO L523 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:16,790 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-05-03 00:05:16,790 INFO L428 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:16,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:16,790 INFO L82 PathProgramCache]: Analyzing trace with hash 331389639, now seen corresponding path program 84 times [2021-05-03 00:05:16,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:16,790 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [283300498] [2021-05-03 00:05:16,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:16,800 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3910 500000) InVars {main_~x~0=v_main_~x~0_3910} OutVars{main_~x~0=v_main_~x~0_3910} AuxVars[] AssignedVars[] [2021-05-03 00:05:16,801 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:05:16,802 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:16,807 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:16,819 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:05:16,838 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:16,840 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_3912 999999) (< v_main_~x~0_3912 500000)) InVars {main_~x~0=v_main_~x~0_3912} OutVars{main_~x~0=v_main_~x~0_3912} AuxVars[] AssignedVars[] [2021-05-03 00:05:16,841 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:05:16,848 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:16,853 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:16,860 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:05:16,871 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:16,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:16,908 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:05:21,234 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:21,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [283300498] [2021-05-03 00:05:21,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [283300498] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:21,235 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:21,235 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [88] imperfect sequences [] total 88 [2021-05-03 00:05:21,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796084626] [2021-05-03 00:05:21,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2021-05-03 00:05:21,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:21,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2021-05-03 00:05:21,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=7746, Unknown=0, NotChecked=0, Total=8010 [2021-05-03 00:05:21,236 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand has 88 states, 88 states have (on average 1.9886363636363635) internal successors, (175), 87 states have internal predecessors, (175), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:35,145 INFO L93 Difference]: Finished difference Result 190 states and 194 transitions. [2021-05-03 00:05:35,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-05-03 00:05:35,146 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 1.9886363636363635) internal successors, (175), 87 states have internal predecessors, (175), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 179 [2021-05-03 00:05:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:35,147 INFO L225 Difference]: With dead ends: 190 [2021-05-03 00:05:35,147 INFO L226 Difference]: Without dead ends: 183 [2021-05-03 00:05:35,149 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 77 SyntacticMatches, 15 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3767 ImplicationChecksByTransitivity, 10445.0ms TimeCoverageRelationStatistics Valid=689, Invalid=29761, Unknown=0, NotChecked=0, Total=30450 [2021-05-03 00:05:35,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-05-03 00:05:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-05-03 00:05:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 178 states have (on average 1.0112359550561798) internal successors, (180), 178 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2021-05-03 00:05:35,157 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 179 [2021-05-03 00:05:35,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:35,157 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2021-05-03 00:05:35,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 88 states, 88 states have (on average 1.9886363636363635) internal successors, (175), 87 states have internal predecessors, (175), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2021-05-03 00:05:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-05-03 00:05:35,158 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:35,158 INFO L523 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:35,158 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-05-03 00:05:35,158 INFO L428 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:35,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:35,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1683642660, now seen corresponding path program 85 times [2021-05-03 00:05:35,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:35,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1688151196] [2021-05-03 00:05:35,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:35,163 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_3999 500000) InVars {main_~x~0=v_main_~x~0_3999} OutVars{main_~x~0=v_main_~x~0_3999} AuxVars[] AssignedVars[] [2021-05-03 00:05:35,165 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:05:35,172 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:35,177 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:35,185 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:05:35,198 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:35,200 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4001 999999) (< v_main_~x~0_4001 500000)) InVars {main_~x~0=v_main_~x~0_4001} OutVars{main_~x~0=v_main_~x~0_4001} AuxVars[] AssignedVars[] [2021-05-03 00:05:35,201 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:05:35,202 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:35,208 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:35,221 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:05:35,235 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:35,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:35,294 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:05:40,254 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:40,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1688151196] [2021-05-03 00:05:40,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1688151196] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:40,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:40,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [89] imperfect sequences [] total 89 [2021-05-03 00:05:40,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369523944] [2021-05-03 00:05:40,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2021-05-03 00:05:40,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:40,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2021-05-03 00:05:40,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2021-05-03 00:05:40,256 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand has 89 states, 89 states have (on average 1.9887640449438202) internal successors, (177), 88 states have internal predecessors, (177), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:54,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:54,721 INFO L93 Difference]: Finished difference Result 192 states and 196 transitions. [2021-05-03 00:05:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2021-05-03 00:05:54,722 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.9887640449438202) internal successors, (177), 88 states have internal predecessors, (177), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 181 [2021-05-03 00:05:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:54,723 INFO L225 Difference]: With dead ends: 192 [2021-05-03 00:05:54,723 INFO L226 Difference]: Without dead ends: 185 [2021-05-03 00:05:54,724 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 81 SyntacticMatches, 12 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3848 ImplicationChecksByTransitivity, 11292.7ms TimeCoverageRelationStatistics Valid=697, Invalid=30455, Unknown=0, NotChecked=0, Total=31152 [2021-05-03 00:05:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-05-03 00:05:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-05-03 00:05:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 180 states have (on average 1.011111111111111) internal successors, (182), 180 states have internal predecessors, (182), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2021-05-03 00:05:54,735 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 181 [2021-05-03 00:05:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:54,735 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2021-05-03 00:05:54,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 89 states, 89 states have (on average 1.9887640449438202) internal successors, (177), 88 states have internal predecessors, (177), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2021-05-03 00:05:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-05-03 00:05:54,736 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:54,736 INFO L523 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:54,737 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-03 00:05:54,737 INFO L428 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:54,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:54,737 INFO L82 PathProgramCache]: Analyzing trace with hash -176294847, now seen corresponding path program 86 times [2021-05-03 00:05:54,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:54,737 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [991315716] [2021-05-03 00:05:54,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:54,743 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4089 500000) InVars {main_~x~0=v_main_~x~0_4089} OutVars{main_~x~0=v_main_~x~0_4089} AuxVars[] AssignedVars[] [2021-05-03 00:05:54,745 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:05:54,746 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:54,754 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:54,771 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:05:54,789 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:54,791 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4091 500000) (< v_main_~x~0_4091 999999)) InVars {main_~x~0=v_main_~x~0_4091} OutVars{main_~x~0=v_main_~x~0_4091} AuxVars[] AssignedVars[] [2021-05-03 00:05:54,792 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:05:54,794 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:54,805 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:05:54,824 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:05:54,837 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:54,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:54,902 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:06:00,214 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:00,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [991315716] [2021-05-03 00:06:00,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [991315716] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:00,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:00,215 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [90] imperfect sequences [] total 90 [2021-05-03 00:06:00,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533641091] [2021-05-03 00:06:00,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2021-05-03 00:06:00,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:00,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2021-05-03 00:06:00,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=8102, Unknown=0, NotChecked=0, Total=8372 [2021-05-03 00:06:00,216 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand has 90 states, 90 states have (on average 1.988888888888889) internal successors, (179), 89 states have internal predecessors, (179), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:16,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:16,479 INFO L93 Difference]: Finished difference Result 194 states and 198 transitions. [2021-05-03 00:06:16,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-05-03 00:06:16,481 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 1.988888888888889) internal successors, (179), 89 states have internal predecessors, (179), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 183 [2021-05-03 00:06:16,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:16,481 INFO L225 Difference]: With dead ends: 194 [2021-05-03 00:06:16,482 INFO L226 Difference]: Without dead ends: 187 [2021-05-03 00:06:16,483 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 82 SyntacticMatches, 11 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3934 ImplicationChecksByTransitivity, 12254.4ms TimeCoverageRelationStatistics Valid=705, Invalid=31157, Unknown=0, NotChecked=0, Total=31862 [2021-05-03 00:06:16,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-05-03 00:06:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2021-05-03 00:06:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.010989010989011) internal successors, (184), 182 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2021-05-03 00:06:16,494 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 183 [2021-05-03 00:06:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:16,494 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2021-05-03 00:06:16,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 90 states, 90 states have (on average 1.988888888888889) internal successors, (179), 89 states have internal predecessors, (179), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2021-05-03 00:06:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-05-03 00:06:16,495 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:16,496 INFO L523 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:16,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-05-03 00:06:16,496 INFO L428 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:16,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:16,496 INFO L82 PathProgramCache]: Analyzing trace with hash -869843938, now seen corresponding path program 87 times [2021-05-03 00:06:16,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:16,496 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [677429] [2021-05-03 00:06:16,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:16,503 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4180 500000) InVars {main_~x~0=v_main_~x~0_4180} OutVars{main_~x~0=v_main_~x~0_4180} AuxVars[] AssignedVars[] [2021-05-03 00:06:16,504 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:06:16,514 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:16,524 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:16,537 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:06:16,558 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:16,560 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4182 999999) (< v_main_~x~0_4182 500000)) InVars {main_~x~0=v_main_~x~0_4182} OutVars{main_~x~0=v_main_~x~0_4182} AuxVars[] AssignedVars[] [2021-05-03 00:06:16,562 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:06:16,563 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:16,570 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:16,587 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:06:16,603 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:16,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:16,674 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:06:21,956 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:21,957 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [677429] [2021-05-03 00:06:21,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [677429] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:21,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:21,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [91] imperfect sequences [] total 91 [2021-05-03 00:06:21,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763059760] [2021-05-03 00:06:21,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2021-05-03 00:06:21,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:21,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2021-05-03 00:06:21,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=8283, Unknown=0, NotChecked=0, Total=8556 [2021-05-03 00:06:21,958 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand has 91 states, 91 states have (on average 1.989010989010989) internal successors, (181), 90 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:36,957 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2021-05-03 00:06:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2021-05-03 00:06:36,958 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 1.989010989010989) internal successors, (181), 90 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 185 [2021-05-03 00:06:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:36,959 INFO L225 Difference]: With dead ends: 196 [2021-05-03 00:06:36,959 INFO L226 Difference]: Without dead ends: 189 [2021-05-03 00:06:36,960 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 76 SyntacticMatches, 19 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4039 ImplicationChecksByTransitivity, 11773.4ms TimeCoverageRelationStatistics Valid=713, Invalid=31867, Unknown=0, NotChecked=0, Total=32580 [2021-05-03 00:06:36,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-05-03 00:06:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-05-03 00:06:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 184 states have (on average 1.0108695652173914) internal successors, (186), 184 states have internal predecessors, (186), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2021-05-03 00:06:36,969 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 185 [2021-05-03 00:06:36,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:36,969 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2021-05-03 00:06:36,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 91 states, 91 states have (on average 1.989010989010989) internal successors, (181), 90 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:36,970 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2021-05-03 00:06:36,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-05-03 00:06:36,970 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:36,970 INFO L523 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:36,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-05-03 00:06:36,971 INFO L428 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:36,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:36,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1650589509, now seen corresponding path program 88 times [2021-05-03 00:06:36,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:36,971 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1764503945] [2021-05-03 00:06:36,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:36,978 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4272 500000) InVars {main_~x~0=v_main_~x~0_4272} OutVars{main_~x~0=v_main_~x~0_4272} AuxVars[] AssignedVars[] [2021-05-03 00:06:36,980 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:06:36,990 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:36,997 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:37,006 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:06:37,019 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:37,021 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4274 500000) (< v_main_~x~0_4274 999999)) InVars {main_~x~0=v_main_~x~0_4274} OutVars{main_~x~0=v_main_~x~0_4274} AuxVars[] AssignedVars[] [2021-05-03 00:06:37,023 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:06:37,031 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:37,038 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:06:37,048 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:06:37,064 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:37,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:37,105 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:06:43,329 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:43,329 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1764503945] [2021-05-03 00:06:43,329 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1764503945] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:43,329 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:43,329 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [92] imperfect sequences [] total 92 [2021-05-03 00:06:43,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261844708] [2021-05-03 00:06:43,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2021-05-03 00:06:43,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:43,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2021-05-03 00:06:43,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=8466, Unknown=0, NotChecked=0, Total=8742 [2021-05-03 00:06:43,330 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand has 92 states, 92 states have (on average 1.9891304347826086) internal successors, (183), 91 states have internal predecessors, (183), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:00,648 INFO L93 Difference]: Finished difference Result 198 states and 202 transitions. [2021-05-03 00:07:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-05-03 00:07:00,648 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 1.9891304347826086) internal successors, (183), 91 states have internal predecessors, (183), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 187 [2021-05-03 00:07:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:00,649 INFO L225 Difference]: With dead ends: 198 [2021-05-03 00:07:00,649 INFO L226 Difference]: Without dead ends: 191 [2021-05-03 00:07:00,650 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 76 SyntacticMatches, 20 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4131 ImplicationChecksByTransitivity, 13579.0ms TimeCoverageRelationStatistics Valid=721, Invalid=32585, Unknown=0, NotChecked=0, Total=33306 [2021-05-03 00:07:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-05-03 00:07:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2021-05-03 00:07:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.010752688172043) internal successors, (188), 186 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2021-05-03 00:07:00,658 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 187 [2021-05-03 00:07:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:00,658 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2021-05-03 00:07:00,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 92 states, 92 states have (on average 1.9891304347826086) internal successors, (183), 91 states have internal predecessors, (183), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2021-05-03 00:07:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2021-05-03 00:07:00,658 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:00,659 INFO L523 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:00,659 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2021-05-03 00:07:00,659 INFO L428 AbstractCegarLoop]: === Iteration 91 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:00,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:00,659 INFO L82 PathProgramCache]: Analyzing trace with hash -327806440, now seen corresponding path program 89 times [2021-05-03 00:07:00,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:00,659 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1032886095] [2021-05-03 00:07:00,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:00,663 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4365 500000) InVars {main_~x~0=v_main_~x~0_4365} OutVars{main_~x~0=v_main_~x~0_4365} AuxVars[] AssignedVars[] [2021-05-03 00:07:00,664 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:07:00,671 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:00,677 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:00,685 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:07:00,699 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:00,700 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4367 999999) (< v_main_~x~0_4367 500000)) InVars {main_~x~0=v_main_~x~0_4367} OutVars{main_~x~0=v_main_~x~0_4367} AuxVars[] AssignedVars[] [2021-05-03 00:07:00,702 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:07:00,703 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:00,708 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:00,721 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:07:00,733 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:00,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:06,107 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:06,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1032886095] [2021-05-03 00:07:06,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1032886095] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:06,107 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:06,107 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [93] imperfect sequences [] total 93 [2021-05-03 00:07:06,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834113681] [2021-05-03 00:07:06,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2021-05-03 00:07:06,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:06,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2021-05-03 00:07:06,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2021-05-03 00:07:06,108 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand has 93 states, 93 states have (on average 1.989247311827957) internal successors, (185), 92 states have internal predecessors, (185), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:24,309 INFO L93 Difference]: Finished difference Result 200 states and 204 transitions. [2021-05-03 00:07:24,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2021-05-03 00:07:24,315 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 93 states have (on average 1.989247311827957) internal successors, (185), 92 states have internal predecessors, (185), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 189 [2021-05-03 00:07:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:24,315 INFO L225 Difference]: With dead ends: 200 [2021-05-03 00:07:24,315 INFO L226 Difference]: Without dead ends: 193 [2021-05-03 00:07:24,316 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 79 SyntacticMatches, 17 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4216 ImplicationChecksByTransitivity, 13057.3ms TimeCoverageRelationStatistics Valid=729, Invalid=33311, Unknown=0, NotChecked=0, Total=34040 [2021-05-03 00:07:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-05-03 00:07:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2021-05-03 00:07:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.0106382978723405) internal successors, (190), 188 states have internal predecessors, (190), 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:07:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2021-05-03 00:07:24,324 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 189 [2021-05-03 00:07:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:24,325 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2021-05-03 00:07:24,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 93 states, 93 states have (on average 1.989247311827957) internal successors, (185), 92 states have internal predecessors, (185), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2021-05-03 00:07:24,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-05-03 00:07:24,325 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:24,325 INFO L523 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:24,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-05-03 00:07:24,326 INFO L428 AbstractCegarLoop]: === Iteration 92 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:24,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:24,326 INFO L82 PathProgramCache]: Analyzing trace with hash -443596747, now seen corresponding path program 90 times [2021-05-03 00:07:24,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:24,326 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1182362778] [2021-05-03 00:07:24,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:24,331 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4459 500000) InVars {main_~x~0=v_main_~x~0_4459} OutVars{main_~x~0=v_main_~x~0_4459} AuxVars[] AssignedVars[] [2021-05-03 00:07:24,332 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:07:24,333 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:24,342 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:24,359 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:07:24,375 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:24,377 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4461 999999) (< v_main_~x~0_4461 500000)) InVars {main_~x~0=v_main_~x~0_4461} OutVars{main_~x~0=v_main_~x~0_4461} AuxVars[] AssignedVars[] [2021-05-03 00:07:24,378 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:07:24,387 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:24,394 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:24,403 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:07:24,418 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:24,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:31,232 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:31,232 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1182362778] [2021-05-03 00:07:31,232 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1182362778] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:31,232 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:31,232 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [94] imperfect sequences [] total 94 [2021-05-03 00:07:31,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287165795] [2021-05-03 00:07:31,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2021-05-03 00:07:31,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:31,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2021-05-03 00:07:31,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=8838, Unknown=0, NotChecked=0, Total=9120 [2021-05-03 00:07:31,233 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand has 94 states, 94 states have (on average 1.9893617021276595) internal successors, (187), 93 states have internal predecessors, (187), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:48,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:48,613 INFO L93 Difference]: Finished difference Result 202 states and 206 transitions. [2021-05-03 00:07:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-05-03 00:07:48,614 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.9893617021276595) internal successors, (187), 93 states have internal predecessors, (187), 2 states have call successors, (3), 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:07:48,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:48,615 INFO L225 Difference]: With dead ends: 202 [2021-05-03 00:07:48,615 INFO L226 Difference]: Without dead ends: 195 [2021-05-03 00:07:48,616 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 82 SyntacticMatches, 15 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4304 ImplicationChecksByTransitivity, 14143.2ms TimeCoverageRelationStatistics Valid=737, Invalid=34045, Unknown=0, NotChecked=0, Total=34782 [2021-05-03 00:07:48,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-05-03 00:07:48,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-05-03 00:07:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.0105263157894737) internal successors, (192), 190 states have internal predecessors, (192), 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:07:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2021-05-03 00:07:48,624 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 191 [2021-05-03 00:07:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:48,624 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2021-05-03 00:07:48,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 94 states, 94 states have (on average 1.9893617021276595) internal successors, (187), 93 states have internal predecessors, (187), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2021-05-03 00:07:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-05-03 00:07:48,625 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:48,625 INFO L523 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:48,625 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2021-05-03 00:07:48,625 INFO L428 AbstractCegarLoop]: === Iteration 93 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:48,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:48,625 INFO L82 PathProgramCache]: Analyzing trace with hash -48932078, now seen corresponding path program 91 times [2021-05-03 00:07:48,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:48,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1454473001] [2021-05-03 00:07:48,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:48,631 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4554 500000) InVars {main_~x~0=v_main_~x~0_4554} OutVars{main_~x~0=v_main_~x~0_4554} AuxVars[] AssignedVars[] [2021-05-03 00:07:48,634 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:07:48,641 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:48,646 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:48,654 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:07:48,667 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:48,669 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4556 999999) (< v_main_~x~0_4556 500000)) InVars {main_~x~0=v_main_~x~0_4556} OutVars{main_~x~0=v_main_~x~0_4556} AuxVars[] AssignedVars[] [2021-05-03 00:07:48,670 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:07:48,677 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:48,682 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:07:48,691 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:07:48,704 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:48,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:48,751 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:07:55,749 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:55,749 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1454473001] [2021-05-03 00:07:55,749 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1454473001] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:55,749 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:55,749 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [95] imperfect sequences [] total 95 [2021-05-03 00:07:55,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072365914] [2021-05-03 00:07:55,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2021-05-03 00:07:55,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:55,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2021-05-03 00:07:55,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=9027, Unknown=0, NotChecked=0, Total=9312 [2021-05-03 00:07:55,750 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand has 95 states, 95 states have (on average 1.9894736842105263) internal successors, (189), 94 states have internal predecessors, (189), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:17,316 INFO L93 Difference]: Finished difference Result 204 states and 208 transitions. [2021-05-03 00:08:17,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2021-05-03 00:08:17,318 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 1.9894736842105263) internal successors, (189), 94 states have internal predecessors, (189), 2 states have call successors, (3), 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 193 [2021-05-03 00:08:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:17,319 INFO L225 Difference]: With dead ends: 204 [2021-05-03 00:08:17,319 INFO L226 Difference]: Without dead ends: 197 [2021-05-03 00:08:17,320 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 85 SyntacticMatches, 13 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4393 ImplicationChecksByTransitivity, 15860.4ms TimeCoverageRelationStatistics Valid=745, Invalid=34787, Unknown=0, NotChecked=0, Total=35532 [2021-05-03 00:08:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-05-03 00:08:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-05-03 00:08:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 192 states have (on average 1.0104166666666667) internal successors, (194), 192 states have internal predecessors, (194), 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:08:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2021-05-03 00:08:17,332 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 193 [2021-05-03 00:08:17,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:17,332 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2021-05-03 00:08:17,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 95 states, 95 states have (on average 1.9894736842105263) internal successors, (189), 94 states have internal predecessors, (189), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:17,333 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2021-05-03 00:08:17,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-05-03 00:08:17,333 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:17,333 INFO L523 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:17,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-05-03 00:08:17,334 INFO L428 AbstractCegarLoop]: === Iteration 94 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:17,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:17,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1266692783, now seen corresponding path program 92 times [2021-05-03 00:08:17,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:17,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1137208594] [2021-05-03 00:08:17,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:17,341 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4650 500000) InVars {main_~x~0=v_main_~x~0_4650} OutVars{main_~x~0=v_main_~x~0_4650} AuxVars[] AssignedVars[] [2021-05-03 00:08:17,343 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:08:17,345 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:17,355 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:08:17,385 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:08:17,414 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:17,417 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4652 500000) (< v_main_~x~0_4652 999999)) InVars {main_~x~0=v_main_~x~0_4652} OutVars{main_~x~0=v_main_~x~0_4652} AuxVars[] AssignedVars[] [2021-05-03 00:08:17,419 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:08:17,420 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:17,438 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:08:17,469 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:08:17,493 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:17,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:17,554 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:08:23,923 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:23,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1137208594] [2021-05-03 00:08:23,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1137208594] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:23,923 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:23,923 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2021-05-03 00:08:23,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386257740] [2021-05-03 00:08:23,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2021-05-03 00:08:23,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:23,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2021-05-03 00:08:23,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=9218, Unknown=0, NotChecked=0, Total=9506 [2021-05-03 00:08:23,925 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand has 96 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 95 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:08:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:46,355 INFO L93 Difference]: Finished difference Result 206 states and 210 transitions. [2021-05-03 00:08:46,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-05-03 00:08:46,356 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 95 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 195 [2021-05-03 00:08:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:46,357 INFO L225 Difference]: With dead ends: 206 [2021-05-03 00:08:46,357 INFO L226 Difference]: Without dead ends: 199 [2021-05-03 00:08:46,358 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 81 SyntacticMatches, 19 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4499 ImplicationChecksByTransitivity, 15610.3ms TimeCoverageRelationStatistics Valid=753, Invalid=35537, Unknown=0, NotChecked=0, Total=36290 [2021-05-03 00:08:46,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-05-03 00:08:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-05-03 00:08:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.0103092783505154) internal successors, (196), 194 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:08:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2021-05-03 00:08:46,366 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 195 [2021-05-03 00:08:46,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:46,367 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2021-05-03 00:08:46,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 96 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 95 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:08:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2021-05-03 00:08:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-05-03 00:08:46,367 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:46,367 INFO L523 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:46,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-05-03 00:08:46,368 INFO L428 AbstractCegarLoop]: === Iteration 95 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:46,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:46,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1433168116, now seen corresponding path program 93 times [2021-05-03 00:08:46,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:46,368 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801658516] [2021-05-03 00:08:46,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:46,381 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4747 500000) InVars {main_~x~0=v_main_~x~0_4747} OutVars{main_~x~0=v_main_~x~0_4747} AuxVars[] AssignedVars[] [2021-05-03 00:08:46,383 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:08:46,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:46,391 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:08:46,409 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:08:46,426 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:46,428 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4749 500000) (< v_main_~x~0_4749 999999)) InVars {main_~x~0=v_main_~x~0_4749} OutVars{main_~x~0=v_main_~x~0_4749} AuxVars[] AssignedVars[] [2021-05-03 00:08:46,429 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:08:46,430 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:46,437 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:08:46,459 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:08:46,482 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:46,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:46,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:08:54,399 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:54,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801658516] [2021-05-03 00:08:54,399 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [801658516] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:54,399 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:54,399 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [97] imperfect sequences [] total 97 [2021-05-03 00:08:54,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934053685] [2021-05-03 00:08:54,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2021-05-03 00:08:54,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:54,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2021-05-03 00:08:54,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2021-05-03 00:08:54,400 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 96 states have internal predecessors, (193), 2 states have call successors, (3), 3 states have call 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:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:14,899 INFO L93 Difference]: Finished difference Result 208 states and 212 transitions. [2021-05-03 00:09:14,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2021-05-03 00:09:14,900 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 96 states have internal predecessors, (193), 2 states have call successors, (3), 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 197 [2021-05-03 00:09:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:14,901 INFO L225 Difference]: With dead ends: 208 [2021-05-03 00:09:14,901 INFO L226 Difference]: Without dead ends: 201 [2021-05-03 00:09:14,903 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 85 SyntacticMatches, 16 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4588 ImplicationChecksByTransitivity, 16256.1ms TimeCoverageRelationStatistics Valid=761, Invalid=36295, Unknown=0, NotChecked=0, Total=37056 [2021-05-03 00:09:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-05-03 00:09:14,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-05-03 00:09:14,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.010204081632653) internal successors, (198), 196 states have internal predecessors, (198), 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:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2021-05-03 00:09:14,911 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 197 [2021-05-03 00:09:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:14,911 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2021-05-03 00:09:14,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 96 states have internal predecessors, (193), 2 states have call successors, (3), 3 states have call 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:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2021-05-03 00:09:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-05-03 00:09:14,912 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:14,912 INFO L523 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:14,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-05-03 00:09:14,912 INFO L428 AbstractCegarLoop]: === Iteration 96 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:14,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:14,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1839245271, now seen corresponding path program 94 times [2021-05-03 00:09:14,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:14,913 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [219642110] [2021-05-03 00:09:14,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:14,919 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< v_main_~x~0_4845 500000) InVars {main_~x~0=v_main_~x~0_4845} OutVars{main_~x~0=v_main_~x~0_4845} AuxVars[] AssignedVars[] [2021-05-03 00:09:14,920 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size [2021-05-03 00:09:14,921 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:14,929 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:14,949 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 91.7 percent of original size 44 [2021-05-03 00:09:14,974 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:14,976 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< v_main_~x~0_4847 999999) (< v_main_~x~0_4847 500000)) InVars {main_~x~0=v_main_~x~0_4847} OutVars{main_~x~0=v_main_~x~0_4847} AuxVars[] AssignedVars[] [2021-05-03 00:09:14,978 WARN L240 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size [2021-05-03 00:09:14,979 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:14,990 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-03 00:09:15,011 WARN L245 tifierPushTermWalker]: treesize reduction 25, result has 63.8 percent of original size 44 [2021-05-03 00:09:15,027 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:15,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:15,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:09:24,336 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:24,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [219642110] [2021-05-03 00:09:24,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [219642110] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:24,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:24,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [98] imperfect sequences [] total 98 [2021-05-03 00:09:24,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256055695] [2021-05-03 00:09:24,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states [2021-05-03 00:09:24,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:24,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2021-05-03 00:09:24,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=9606, Unknown=0, NotChecked=0, Total=9900 [2021-05-03 00:09:24,338 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand has 98 states, 98 states have (on average 1.989795918367347) internal successors, (195), 97 states have internal predecessors, (195), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)