/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/Mono3_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:54:00,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:54:00,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:54:00,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:54:00,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:54:00,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:54:00,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:54:00,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:54:00,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:54:00,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:54:00,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:54:00,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:54:00,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:54:00,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:54:00,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:54:00,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:54:00,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:54:00,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:54:00,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:54:00,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:54:00,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:54:00,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:54:00,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:54:00,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:54:00,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:54:00,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:54:00,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:54:00,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:54:00,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:54:00,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:54:00,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:54:00,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:54:00,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:54:00,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:54:00,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:54:00,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:54:00,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:54:00,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:54:00,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:54:00,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:54:00,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:54:00,226 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:54:00,261 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:54:00,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:54:00,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:54:00,270 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:54:00,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:54:00,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:54:00,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:54:00,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:54:00,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:54:00,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:54:00,273 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:54:00,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:54:00,274 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:54:00,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:54:00,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:54:00,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:54:00,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:54:00,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:54:00,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:54:00,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:54:00,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:54:00,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:54:00,277 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:54:00,277 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:54:00,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:54:00,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:54:00,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:54:00,932 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:54:00,934 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:54:00,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2021-05-02 23:54:01,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3129a360e/98fb8715ec4049fcbb74532fea3fa5c4/FLAG74b185b90 [2021-05-02 23:54:01,911 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:54:01,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_1.c [2021-05-02 23:54:01,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3129a360e/98fb8715ec4049fcbb74532fea3fa5c4/FLAG74b185b90 [2021-05-02 23:54:02,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3129a360e/98fb8715ec4049fcbb74532fea3fa5c4 [2021-05-02 23:54:02,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:54:02,283 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:54:02,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:54:02,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:54:02,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:54:02,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:54:02" (1/1) ... [2021-05-02 23:54:02,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4258ee26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:54:02, skipping insertion in model container [2021-05-02 23:54:02,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:54:02" (1/1) ... [2021-05-02 23:54:02,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:54:02,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:54:02,574 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/Mono3_1.c[311,324] [2021-05-02 23:54:02,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:54:02,617 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:54:02,673 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/Mono3_1.c[311,324] [2021-05-02 23:54:02,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:54:02,740 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:54:02,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:54:02 WrapperNode [2021-05-02 23:54:02,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:54:02,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:54:02,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:54:02,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:54:02,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:54:02" (1/1) ... [2021-05-02 23:54:02,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:54:02" (1/1) ... [2021-05-02 23:54:02,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:54:02" (1/1) ... [2021-05-02 23:54:02,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:54:02" (1/1) ... [2021-05-02 23:54:02,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:54:02" (1/1) ... [2021-05-02 23:54:02,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:54:02" (1/1) ... [2021-05-02 23:54:02,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:54:02" (1/1) ... [2021-05-02 23:54:02,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:54:02,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:54:02,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:54:02,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:54:02,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:54:02" (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:54:02,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:54:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:54:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:54:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:54:02,952 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:54:02,953 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:54:02,953 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:54:02,953 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:54:02,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:54:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:54:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:54:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:54:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:54:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:54:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:54:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:54:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:54:03,391 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:54:03,392 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 23:54:03,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:54:03 BoogieIcfgContainer [2021-05-02 23:54:03,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:54:03,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:54:03,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:54:03,409 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:54:03,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:54:02" (1/3) ... [2021-05-02 23:54:03,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b9b5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:54:03, skipping insertion in model container [2021-05-02 23:54:03,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:54:02" (2/3) ... [2021-05-02 23:54:03,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b9b5ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:54:03, skipping insertion in model container [2021-05-02 23:54:03,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:54:03" (3/3) ... [2021-05-02 23:54:03,430 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono3_1.c [2021-05-02 23:54:03,439 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:54:03,461 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:54:03,505 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:54:03,576 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:54:03,576 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:54:03,576 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:54:03,576 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:54:03,576 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:54:03,576 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:54:03,577 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:54:03,577 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:54:03,611 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:54:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:54:03,625 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:03,627 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:03,628 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:03,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1326077006, now seen corresponding path program 1 times [2021-05-02 23:54:03,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:03,660 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1804605699] [2021-05-02 23:54:03,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:03,757 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:54:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:04,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:04,078 INFO 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:54:04,081 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:04,081 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1804605699] [2021-05-02 23:54:04,085 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1804605699] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:04,085 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:04,086 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 23:54:04,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84770641] [2021-05-02 23:54:04,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 23:54:04,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:04,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 23:54:04,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:54:04,115 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:54:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:04,258 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-05-02 23:54:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 23:54:04,264 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:54:04,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:04,273 INFO L225 Difference]: With dead ends: 31 [2021-05-02 23:54:04,274 INFO L226 Difference]: Without dead ends: 14 [2021-05-02 23:54:04,281 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 87.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:54:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-05-02 23:54:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-05-02 23:54:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states 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:54:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-05-02 23:54:04,350 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-05-02 23:54:04,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:04,350 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-05-02 23:54:04,351 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:54:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-05-02 23:54:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:54:04,355 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:04,355 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:04,356 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:54:04,356 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:04,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:04,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2021-05-02 23:54:04,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:04,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1232449174] [2021-05-02 23:54:04,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:04,376 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:54:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:04,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:04,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-02 23:54:04,554 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:04,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1232449174] [2021-05-02 23:54:04,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1232449174] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:04,557 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:04,557 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 23:54:04,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320247348] [2021-05-02 23:54:04,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 23:54:04,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:04,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 23:54:04,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:54:04,570 INFO L87 Difference]: Start difference. First operand 14 states and 15 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:54:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:04,696 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2021-05-02 23:54:04,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 23:54:04,697 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:54:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:04,698 INFO L225 Difference]: With dead ends: 25 [2021-05-02 23:54:04,698 INFO L226 Difference]: Without dead ends: 17 [2021-05-02 23:54:04,704 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 74.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:54:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-02 23:54:04,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-05-02 23:54:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states 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:54:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-05-02 23:54:04,715 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2021-05-02 23:54:04,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:04,715 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-05-02 23:54:04,716 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:54:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-05-02 23:54:04,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 23:54:04,721 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:04,722 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:04,722 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:54:04,723 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:04,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:04,725 INFO L82 PathProgramCache]: Analyzing trace with hash 644646283, now seen corresponding path program 1 times [2021-05-02 23:54:04,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:04,726 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [508133524] [2021-05-02 23:54:04,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:04,810 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_9 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_9} OutVars{main_~x~0=v_main_~x~0_9} AuxVars[] AssignedVars[] [2021-05-02 23:54:04,843 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:04,908 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:05,020 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:05,086 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:05,163 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:05,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:05,367 INFO 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:54:05,524 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:05,525 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [508133524] [2021-05-02 23:54:05,525 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [508133524] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:05,526 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:05,526 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:54:05,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796647158] [2021-05-02 23:54:05,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:54:05,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:05,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:54:05,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:54:05,529 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:05,761 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-05-02 23:54:05,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:54:05,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-02 23:54:05,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:05,763 INFO L225 Difference]: With dead ends: 28 [2021-05-02 23:54:05,764 INFO L226 Difference]: Without dead ends: 20 [2021-05-02 23:54:05,765 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 230.1ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:54:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-05-02 23:54:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-05-02 23:54:05,794 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:54:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-05-02 23:54:05,798 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2021-05-02 23:54:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:05,799 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-05-02 23:54:05,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2021-05-02 23:54:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:54:05,801 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:05,801 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:05,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:54:05,802 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:05,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:05,803 INFO L82 PathProgramCache]: Analyzing trace with hash 148462787, now seen corresponding path program 2 times [2021-05-02 23:54:05,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:05,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1774232781] [2021-05-02 23:54:05,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:05,833 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_13 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_13} OutVars{main_~x~0=v_main_~x~0_13} AuxVars[] AssignedVars[] [2021-05-02 23:54:05,856 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:05,911 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:05,959 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:05,995 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:06,059 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:06,071 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_15 1) 4294967296) 1000000) (< (mod v_main_~x~0_15 4294967296) 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:54:06,101 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:06,153 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:06,179 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:06,355 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:06,462 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-05-02 23:54:06,464 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:06,578 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:06,645 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:06,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:06,798 INFO 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:54:06,998 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:06,999 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1774232781] [2021-05-02 23:54:06,999 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1774232781] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:06,999 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:06,999 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:54:07,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57138346] [2021-05-02 23:54:07,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:54:07,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:07,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:54:07,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:54:07,007 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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:54:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:07,472 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-05-02 23:54:07,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:54:07,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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:54:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:07,474 INFO L225 Difference]: With dead ends: 30 [2021-05-02 23:54:07,474 INFO L226 Difference]: Without dead ends: 22 [2021-05-02 23:54:07,475 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 515.3ms TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:54:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-05-02 23:54:07,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-05-02 23:54:07,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-05-02 23:54:07,484 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2021-05-02 23:54:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:07,485 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-05-02 23:54:07,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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:54:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2021-05-02 23:54:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 23:54:07,486 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:07,487 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:07,487 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:54:07,487 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:07,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:07,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1623366283, now seen corresponding path program 3 times [2021-05-02 23:54:07,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:07,488 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1628262185] [2021-05-02 23:54:07,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:07,503 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_20 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_20} OutVars{main_~x~0=v_main_~x~0_20} AuxVars[] AssignedVars[] [2021-05-02 23:54:07,510 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:07,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:07,599 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:07,632 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:07,676 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:07,683 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_22 1) 4294967296) 1000000) (< (mod v_main_~x~0_22 4294967296) 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:54:07,697 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:07,745 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:07,756 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:08,176 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:54:08,183 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:08,207 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:08,272 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:08,316 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:08,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:08,483 INFO 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:54:08,715 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:08,716 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1628262185] [2021-05-02 23:54:08,716 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1628262185] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:08,716 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:08,716 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:54:08,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111976666] [2021-05-02 23:54:08,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:54:08,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:08,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:54:08,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:54:08,726 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states 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:54:09,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:09,083 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-05-02 23:54:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:54:09,087 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-02 23:54:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:09,091 INFO L225 Difference]: With dead ends: 34 [2021-05-02 23:54:09,092 INFO L226 Difference]: Without dead ends: 26 [2021-05-02 23:54:09,093 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 356.8ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:54:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-05-02 23:54:09,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-05-02 23:54:09,103 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:54:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-05-02 23:54:09,104 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2021-05-02 23:54:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:09,105 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-05-02 23:54:09,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states 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:54:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-05-02 23:54:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 23:54:09,106 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:09,106 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:09,106 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:54:09,106 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:09,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:09,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1336989757, now seen corresponding path program 4 times [2021-05-02 23:54:09,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:09,108 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [388139628] [2021-05-02 23:54:09,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:09,122 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_28 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_28} OutVars{main_~x~0=v_main_~x~0_28} AuxVars[] AssignedVars[] [2021-05-02 23:54:09,129 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:09,160 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:09,200 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:09,239 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:09,297 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:09,306 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_30 4294967296) 500000) (< (mod (+ v_main_~x~0_30 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_30} OutVars{main_~x~0=v_main_~x~0_30} AuxVars[] AssignedVars[] [2021-05-02 23:54:09,313 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:09,372 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:09,380 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:09,537 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:54:09,572 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:09,579 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:09,640 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:09,690 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:09,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:09,841 INFO 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:54:10,015 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:10,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [388139628] [2021-05-02 23:54:10,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [388139628] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:10,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:10,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:54:10,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206399832] [2021-05-02 23:54:10,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:54:10,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:10,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:54:10,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:54:10,019 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:54:10,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:10,369 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2021-05-02 23:54:10,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:54:10,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:54:10,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:10,372 INFO L225 Difference]: With dead ends: 37 [2021-05-02 23:54:10,372 INFO L226 Difference]: Without dead ends: 29 [2021-05-02 23:54:10,373 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 338.3ms TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:54:10,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-02 23:54:10,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-05-02 23:54:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states 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:54:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2021-05-02 23:54:10,383 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 23 [2021-05-02 23:54:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:10,384 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-05-02 23:54:10,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:54:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2021-05-02 23:54:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-02 23:54:10,386 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:10,386 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:10,386 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 23:54:10,386 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:10,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:10,387 INFO L82 PathProgramCache]: Analyzing trace with hash -445321333, now seen corresponding path program 5 times [2021-05-02 23:54:10,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:10,387 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [192477092] [2021-05-02 23:54:10,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:10,401 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_37 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_37} OutVars{main_~x~0=v_main_~x~0_37} AuxVars[] AssignedVars[] [2021-05-02 23:54:10,410 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:10,442 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:10,477 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:10,518 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:10,559 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:10,565 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_39 1) 4294967296) 1000000) (< (mod v_main_~x~0_39 4294967296) 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:54:10,572 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:10,617 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:10,623 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:11,390 WARN L205 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:54:11,436 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:11,444 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:11,512 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:11,563 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:11,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:11,678 INFO 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:54:11,898 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:11,899 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [192477092] [2021-05-02 23:54:11,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [192477092] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:11,899 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:11,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:54:11,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918343476] [2021-05-02 23:54:11,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:54:11,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:11,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:54:11,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:54:11,902 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:12,317 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-05-02 23:54:12,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:54:12,318 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-05-02 23:54:12,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:12,319 INFO L225 Difference]: With dead ends: 40 [2021-05-02 23:54:12,319 INFO L226 Difference]: Without dead ends: 32 [2021-05-02 23:54:12,320 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 427.0ms TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:54:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-05-02 23:54:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-05-02 23:54:12,328 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:54:12,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-05-02 23:54:12,330 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2021-05-02 23:54:12,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:12,330 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-05-02 23:54:12,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-05-02 23:54:12,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 23:54:12,332 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:12,332 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:12,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 23:54:12,332 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:12,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:12,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1124027709, now seen corresponding path program 6 times [2021-05-02 23:54:12,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:12,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1300523329] [2021-05-02 23:54:12,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:12,347 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_47 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_47} OutVars{main_~x~0=v_main_~x~0_47} AuxVars[] AssignedVars[] [2021-05-02 23:54:12,353 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:12,388 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:12,420 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:12,454 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:12,501 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:12,506 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_49 4294967296) 500000) (< (mod (+ v_main_~x~0_49 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_49} OutVars{main_~x~0=v_main_~x~0_49} AuxVars[] AssignedVars[] [2021-05-02 23:54:12,512 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:12,561 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:12,566 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:13,851 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:54:13,893 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:13,903 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:13,956 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:13,991 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:14,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:14,089 INFO 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:54:14,394 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:14,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1300523329] [2021-05-02 23:54:14,395 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1300523329] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:14,395 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:14,395 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 23:54:14,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693289791] [2021-05-02 23:54:14,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 23:54:14,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:14,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 23:54:14,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:54:14,397 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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:54:14,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:14,842 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2021-05-02 23:54:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:54:14,842 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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:54:14,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:14,844 INFO L225 Difference]: With dead ends: 43 [2021-05-02 23:54:14,844 INFO L226 Difference]: Without dead ends: 35 [2021-05-02 23:54:14,844 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 13 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 497.5ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:54:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-02 23:54:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-05-02 23:54:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 3 states 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:54:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2021-05-02 23:54:14,858 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2021-05-02 23:54:14,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:14,859 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-05-02 23:54:14,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 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:54:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2021-05-02 23:54:14,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-02 23:54:14,860 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:14,860 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:14,861 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:54:14,861 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:14,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:14,862 INFO L82 PathProgramCache]: Analyzing trace with hash 240354443, now seen corresponding path program 7 times [2021-05-02 23:54:14,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:14,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [205981670] [2021-05-02 23:54:14,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:14,874 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_58 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_58} OutVars{main_~x~0=v_main_~x~0_58} AuxVars[] AssignedVars[] [2021-05-02 23:54:14,879 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:14,904 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:14,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:14,963 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:15,009 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:15,015 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_60 4294967296) 500000) (< (mod (+ v_main_~x~0_60 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_60} OutVars{main_~x~0=v_main_~x~0_60} AuxVars[] AssignedVars[] [2021-05-02 23:54:15,024 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:15,027 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:15,034 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:16,192 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:54:16,239 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:16,251 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:16,342 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:16,373 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:16,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:16,487 INFO 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:54:16,772 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:16,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [205981670] [2021-05-02 23:54:16,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [205981670] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:16,773 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:16,773 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-02 23:54:16,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484438751] [2021-05-02 23:54:16,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 23:54:16,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:16,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 23:54:16,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:54:16,775 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states 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:54:17,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:17,241 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-05-02 23:54:17,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:54:17,242 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-05-02 23:54:17,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:17,243 INFO L225 Difference]: With dead ends: 46 [2021-05-02 23:54:17,243 INFO L226 Difference]: Without dead ends: 38 [2021-05-02 23:54:17,244 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 512.5ms TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:54:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-05-02 23:54:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2021-05-02 23:54:17,273 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:54:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-05-02 23:54:17,275 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2021-05-02 23:54:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:17,275 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-05-02 23:54:17,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (3), 3 states 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:54:17,276 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-05-02 23:54:17,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 23:54:17,277 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:17,277 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:17,277 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 23:54:17,277 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:17,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:17,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1021444669, now seen corresponding path program 8 times [2021-05-02 23:54:17,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:17,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1755082303] [2021-05-02 23:54:17,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:17,297 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_70 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_70} OutVars{main_~x~0=v_main_~x~0_70} AuxVars[] AssignedVars[] [2021-05-02 23:54:17,301 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:17,327 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:17,353 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:17,387 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:17,447 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:17,456 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_72 1) 4294967296) 1000000) (< (mod v_main_~x~0_72 4294967296) 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:54:17,462 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:17,508 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:17,516 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:17,922 WARN L205 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:54:17,978 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:17,994 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:18,096 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:18,130 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:18,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:18,237 INFO 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:54:18,551 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:18,552 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1755082303] [2021-05-02 23:54:18,552 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1755082303] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:18,552 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:18,552 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 23:54:18,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018700711] [2021-05-02 23:54:18,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 23:54:18,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:18,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 23:54:18,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:54:18,555 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:54:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:19,181 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-05-02 23:54:19,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 23:54:19,182 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:54:19,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:19,183 INFO L225 Difference]: With dead ends: 49 [2021-05-02 23:54:19,183 INFO L226 Difference]: Without dead ends: 41 [2021-05-02 23:54:19,184 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 17 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 587.2ms TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:54:19,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-02 23:54:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2021-05-02 23:54:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 3 states have call successors, (3), 3 states 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:54:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2021-05-02 23:54:19,194 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 35 [2021-05-02 23:54:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:19,195 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-05-02 23:54:19,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 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:54:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2021-05-02 23:54:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-02 23:54:19,197 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:19,197 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:19,197 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 23:54:19,197 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:19,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1725015669, now seen corresponding path program 9 times [2021-05-02 23:54:19,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:19,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1195139619] [2021-05-02 23:54:19,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:19,210 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_83 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_83} OutVars{main_~x~0=v_main_~x~0_83} AuxVars[] AssignedVars[] [2021-05-02 23:54:19,215 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:19,242 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:19,279 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:19,322 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:19,377 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:19,382 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_85 4294967296) 500000) (< (mod (+ v_main_~x~0_85 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_85} OutVars{main_~x~0=v_main_~x~0_85} AuxVars[] AssignedVars[] [2021-05-02 23:54:19,387 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:19,431 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:19,436 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:19,975 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:54:20,004 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:20,012 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:20,059 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:20,107 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:20,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:20,222 INFO 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:54:20,576 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:20,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1195139619] [2021-05-02 23:54:20,576 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1195139619] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:20,576 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:20,577 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-02 23:54:20,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682105058] [2021-05-02 23:54:20,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 23:54:20,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:20,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 23:54:20,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:54:20,578 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (3), 3 states 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:54:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:21,251 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-05-02 23:54:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 23:54:21,253 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-05-02 23:54:21,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:21,254 INFO L225 Difference]: With dead ends: 52 [2021-05-02 23:54:21,254 INFO L226 Difference]: Without dead ends: 44 [2021-05-02 23:54:21,255 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 19 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 626.8ms TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:54:21,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-05-02 23:54:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2021-05-02 23:54:21,263 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:54:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-05-02 23:54:21,264 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2021-05-02 23:54:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:21,265 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-05-02 23:54:21,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (3), 3 states 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:54:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-05-02 23:54:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-02 23:54:21,268 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:21,268 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:21,269 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 23:54:21,269 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:21,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1926695107, now seen corresponding path program 10 times [2021-05-02 23:54:21,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:21,270 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [386490582] [2021-05-02 23:54:21,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:21,281 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_97 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_97} OutVars{main_~x~0=v_main_~x~0_97} AuxVars[] AssignedVars[] [2021-05-02 23:54:21,290 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:21,313 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:21,349 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:21,381 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:21,413 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:21,417 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_99 4294967296) 500000) (< (mod (+ v_main_~x~0_99 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_99} OutVars{main_~x~0=v_main_~x~0_99} AuxVars[] AssignedVars[] [2021-05-02 23:54:21,421 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:21,423 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:21,437 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:21,555 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:21,565 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:21,655 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:21,705 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:21,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:54:22,274 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:22,275 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [386490582] [2021-05-02 23:54:22,276 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [386490582] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:22,276 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:22,276 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-02 23:54:22,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359140540] [2021-05-02 23:54:22,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-02 23:54:22,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:22,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-02 23:54:22,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:54:22,278 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 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:54:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:23,054 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2021-05-02 23:54:23,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 23:54:23,055 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 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:54:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:23,056 INFO L225 Difference]: With dead ends: 55 [2021-05-02 23:54:23,056 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 23:54:23,057 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 21 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 775.9ms TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:54:23,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 23:54:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-05-02 23:54:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 3 states 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:54:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2021-05-02 23:54:23,067 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 41 [2021-05-02 23:54:23,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:23,068 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2021-05-02 23:54:23,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 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:54:23,069 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2021-05-02 23:54:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-02 23:54:23,070 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:23,070 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:23,070 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 23:54:23,071 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:23,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:23,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1479184757, now seen corresponding path program 11 times [2021-05-02 23:54:23,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:23,072 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [925393477] [2021-05-02 23:54:23,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:23,084 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_112 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_112} OutVars{main_~x~0=v_main_~x~0_112} AuxVars[] AssignedVars[] [2021-05-02 23:54:23,088 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:23,090 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:23,121 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:23,175 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:23,209 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:23,216 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_114 1) 4294967296) 1000000) (< (mod v_main_~x~0_114 4294967296) 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:54:23,221 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:23,254 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:23,260 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:23,486 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:54:23,530 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:23,536 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:23,644 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:23,710 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:23,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:23,811 INFO 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:54:24,232 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:24,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [925393477] [2021-05-02 23:54:24,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [925393477] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:24,233 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:24,233 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-02 23:54:24,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572181312] [2021-05-02 23:54:24,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 23:54:24,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:24,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 23:54:24,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:54:24,236 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:25,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:25,049 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-05-02 23:54:25,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 23:54:25,050 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-05-02 23:54:25,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:25,052 INFO L225 Difference]: With dead ends: 58 [2021-05-02 23:54:25,052 INFO L226 Difference]: Without dead ends: 50 [2021-05-02 23:54:25,053 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 23 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 789.1ms TimeCoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:54:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-05-02 23:54:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2021-05-02 23:54:25,065 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:54:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2021-05-02 23:54:25,067 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2021-05-02 23:54:25,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:25,067 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2021-05-02 23:54:25,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2021-05-02 23:54:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 23:54:25,069 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:25,069 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:25,069 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 23:54:25,070 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:25,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:25,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1738812477, now seen corresponding path program 12 times [2021-05-02 23:54:25,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:25,071 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584500613] [2021-05-02 23:54:25,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:25,082 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_128 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_128} OutVars{main_~x~0=v_main_~x~0_128} AuxVars[] AssignedVars[] [2021-05-02 23:54:25,086 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:25,088 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:25,137 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:25,191 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:25,233 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:25,238 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_130 1) 4294967296) 1000000) (< (mod v_main_~x~0_130 4294967296) 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:54:25,244 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:25,247 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:25,256 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:25,392 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:25,399 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:25,504 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:25,549 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:25,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:25,697 INFO 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:54:26,631 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:26,632 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584500613] [2021-05-02 23:54:26,632 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [584500613] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:26,632 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:26,632 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-02 23:54:26,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137733543] [2021-05-02 23:54:26,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 23:54:26,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:26,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 23:54:26,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:54:26,635 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 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:54:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:28,430 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-05-02 23:54:28,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-02 23:54:28,431 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 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:54:28,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:28,432 INFO L225 Difference]: With dead ends: 60 [2021-05-02 23:54:28,432 INFO L226 Difference]: Without dead ends: 52 [2021-05-02 23:54:28,434 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 7 SyntacticMatches, 13 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1980.8ms TimeCoverageRelationStatistics Valid=209, Invalid=2761, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:54:28,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-05-02 23:54:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-05-02 23:54:28,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2021-05-02 23:54:28,445 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 47 [2021-05-02 23:54:28,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:28,445 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2021-05-02 23:54:28,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 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:54:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2021-05-02 23:54:28,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-05-02 23:54:28,450 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:28,450 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:28,450 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-02 23:54:28,450 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:28,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:28,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1072118901, now seen corresponding path program 13 times [2021-05-02 23:54:28,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:28,451 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [886735883] [2021-05-02 23:54:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:28,461 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_145 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_145} OutVars{main_~x~0=v_main_~x~0_145} AuxVars[] AssignedVars[] [2021-05-02 23:54:28,465 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:28,467 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:28,493 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:28,537 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:28,573 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:28,579 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_147 1) 4294967296) 1000000) (< (mod v_main_~x~0_147 4294967296) 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:54:28,582 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:28,585 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:28,588 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:28,804 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:54:28,846 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:28,864 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:28,965 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:29,017 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:29,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:29,151 INFO 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:54:29,709 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:29,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [886735883] [2021-05-02 23:54:29,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [886735883] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:29,710 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:29,710 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-02 23:54:29,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206542070] [2021-05-02 23:54:29,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-02 23:54:29,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:29,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-02 23:54:29,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:54:29,711 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 2 states have call successors, (3), 3 states 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:54:30,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:30,577 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-05-02 23:54:30,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-02 23:54:30,578 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-05-02 23:54:30,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:30,579 INFO L225 Difference]: With dead ends: 64 [2021-05-02 23:54:30,579 INFO L226 Difference]: Without dead ends: 56 [2021-05-02 23:54:30,580 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 27 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 937.4ms TimeCoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:54:30,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-05-02 23:54:30,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2021-05-02 23:54:30,589 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:54:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-05-02 23:54:30,590 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2021-05-02 23:54:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:30,590 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-05-02 23:54:30,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 17 states have internal predecessors, (46), 2 states have call successors, (3), 3 states 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:54:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-05-02 23:54:30,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-02 23:54:30,591 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:30,591 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:30,591 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-02 23:54:30,591 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:30,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:30,592 INFO L82 PathProgramCache]: Analyzing trace with hash 467427011, now seen corresponding path program 14 times [2021-05-02 23:54:30,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:30,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1883149351] [2021-05-02 23:54:30,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:30,599 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_163 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_163} OutVars{main_~x~0=v_main_~x~0_163} AuxVars[] AssignedVars[] [2021-05-02 23:54:30,602 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:30,615 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:30,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:30,662 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:30,689 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:30,692 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_165 4294967296) 500000) (< (mod (+ v_main_~x~0_165 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_165} OutVars{main_~x~0=v_main_~x~0_165} AuxVars[] AssignedVars[] [2021-05-02 23:54:30,695 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:30,722 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:30,724 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:30,791 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:30,805 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:30,855 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:30,881 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:30,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:30,989 INFO 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:54:31,858 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:31,858 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1883149351] [2021-05-02 23:54:31,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1883149351] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:31,859 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:31,859 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-02 23:54:31,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389126026] [2021-05-02 23:54:31,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 23:54:31,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:31,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 23:54:31,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 23:54:31,860 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 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:54:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:33,809 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2021-05-02 23:54:33,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-02 23:54:33,810 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 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:54:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:33,811 INFO L225 Difference]: With dead ends: 66 [2021-05-02 23:54:33,811 INFO L226 Difference]: Without dead ends: 58 [2021-05-02 23:54:33,812 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 7 SyntacticMatches, 15 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 2037.1ms TimeCoverageRelationStatistics Valid=241, Invalid=3665, Unknown=0, NotChecked=0, Total=3906 [2021-05-02 23:54:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-02 23:54:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-05-02 23:54:33,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 3 states have call successors, (3), 3 states 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:54:33,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2021-05-02 23:54:33,835 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2021-05-02 23:54:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:33,836 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2021-05-02 23:54:33,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 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:54:33,836 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2021-05-02 23:54:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-05-02 23:54:33,837 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:33,837 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:33,837 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-02 23:54:33,838 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:33,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:33,838 INFO L82 PathProgramCache]: Analyzing trace with hash -876062581, now seen corresponding path program 15 times [2021-05-02 23:54:33,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:33,839 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [314684719] [2021-05-02 23:54:33,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:33,857 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_182 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_182} OutVars{main_~x~0=v_main_~x~0_182} AuxVars[] AssignedVars[] [2021-05-02 23:54:33,869 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:33,892 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:33,925 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:33,960 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:34,005 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:34,009 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_184 1) 4294967296) 1000000) (< (mod v_main_~x~0_184 4294967296) 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:54:34,014 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:34,016 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:34,020 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:36,050 WARN L205 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:54:38,684 WARN L205 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:54:38,716 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:38,723 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:38,809 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:38,857 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:38,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:38,955 INFO 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:54:39,815 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:39,816 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [314684719] [2021-05-02 23:54:39,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [314684719] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:39,816 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:39,816 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-02 23:54:39,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130531374] [2021-05-02 23:54:39,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 23:54:39,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:39,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 23:54:39,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:54:39,818 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:41,139 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-05-02 23:54:41,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 23:54:41,140 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2021-05-02 23:54:41,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:41,141 INFO L225 Difference]: With dead ends: 70 [2021-05-02 23:54:41,141 INFO L226 Difference]: Without dead ends: 62 [2021-05-02 23:54:41,142 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 6 SyntacticMatches, 31 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1500.9ms TimeCoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:54:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-05-02 23:54:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2021-05-02 23:54:41,155 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:54:41,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2021-05-02 23:54:41,156 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 56 [2021-05-02 23:54:41,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:41,157 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2021-05-02 23:54:41,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2021-05-02 23:54:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-02 23:54:41,158 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:41,158 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:41,158 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-02 23:54:41,158 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:41,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:41,159 INFO L82 PathProgramCache]: Analyzing trace with hash 25733571, now seen corresponding path program 16 times [2021-05-02 23:54:41,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:41,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1657620709] [2021-05-02 23:54:41,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:41,172 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_202 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_202} OutVars{main_~x~0=v_main_~x~0_202} AuxVars[] AssignedVars[] [2021-05-02 23:54:41,174 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:41,177 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:41,203 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:41,264 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:41,308 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:41,311 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_204 4294967296) 500000) (< (mod (+ v_main_~x~0_204 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_204} OutVars{main_~x~0=v_main_~x~0_204} AuxVars[] AssignedVars[] [2021-05-02 23:54:41,316 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:41,356 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:41,360 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:41,458 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:41,467 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:41,512 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:41,550 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:41,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:41,660 INFO 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:54:42,550 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:42,551 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1657620709] [2021-05-02 23:54:42,551 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1657620709] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:42,551 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:42,551 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-02 23:54:42,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186244155] [2021-05-02 23:54:42,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-02 23:54:42,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:42,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-02 23:54:42,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:54:42,553 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 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:54:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:43,863 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2021-05-02 23:54:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-02 23:54:43,864 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 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:54:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:43,865 INFO L225 Difference]: With dead ends: 73 [2021-05-02 23:54:43,865 INFO L226 Difference]: Without dead ends: 65 [2021-05-02 23:54:43,866 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 33 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1501.3ms TimeCoverageRelationStatistics Valid=146, Invalid=1336, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:54:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-02 23:54:43,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-05-02 23:54:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 3 states have call successors, (3), 3 states 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:54:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2021-05-02 23:54:43,880 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 59 [2021-05-02 23:54:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:43,881 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2021-05-02 23:54:43,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 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:54:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2021-05-02 23:54:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-02 23:54:43,883 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:43,883 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:43,883 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-02 23:54:43,883 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:43,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:43,884 INFO L82 PathProgramCache]: Analyzing trace with hash 414461323, now seen corresponding path program 17 times [2021-05-02 23:54:43,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:43,885 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1588648060] [2021-05-02 23:54:43,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:43,909 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_223 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_223} OutVars{main_~x~0=v_main_~x~0_223} AuxVars[] AssignedVars[] [2021-05-02 23:54:43,914 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:43,937 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:43,963 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:43,996 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:44,041 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:44,049 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_225 1) 4294967296) 1000000) (< (mod v_main_~x~0_225 4294967296) 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:54:44,053 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:44,087 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:44,093 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:45,042 WARN L205 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:54:45,047 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:45,059 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:45,100 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:45,149 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:45,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:45,245 INFO 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:54:46,153 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:46,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1588648060] [2021-05-02 23:54:46,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1588648060] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:46,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:46,154 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-02 23:54:46,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426287647] [2021-05-02 23:54:46,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 23:54:46,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:46,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 23:54:46,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:54:46,161 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 2 states have call successors, (3), 3 states 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:54:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:47,483 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-05-02 23:54:47,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-02 23:54:47,484 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2021-05-02 23:54:47,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:47,485 INFO L225 Difference]: With dead ends: 76 [2021-05-02 23:54:47,485 INFO L226 Difference]: Without dead ends: 68 [2021-05-02 23:54:47,486 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 6 SyntacticMatches, 35 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1499.9ms TimeCoverageRelationStatistics Valid=154, Invalid=1486, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:54:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-02 23:54:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2021-05-02 23:54:47,498 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:54:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2021-05-02 23:54:47,499 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2021-05-02 23:54:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:47,500 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2021-05-02 23:54:47,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 2 states have call successors, (3), 3 states 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:54:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2021-05-02 23:54:47,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-02 23:54:47,501 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:47,501 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:47,501 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-02 23:54:47,502 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:47,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:47,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1771091139, now seen corresponding path program 18 times [2021-05-02 23:54:47,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:47,503 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [614150720] [2021-05-02 23:54:47,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:47,519 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_245 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_245} OutVars{main_~x~0=v_main_~x~0_245} AuxVars[] AssignedVars[] [2021-05-02 23:54:47,522 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:47,544 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:47,568 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:47,600 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:47,642 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:47,646 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_247 1) 4294967296) 1000000) (< (mod v_main_~x~0_247 4294967296) 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:54:47,650 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:47,652 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:47,657 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:48,329 WARN L205 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:54:48,368 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:48,374 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:48,456 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:48,494 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:48,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:48,623 INFO 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:54:50,312 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:50,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [614150720] [2021-05-02 23:54:50,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [614150720] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:50,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:50,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-02 23:54:50,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861432510] [2021-05-02 23:54:50,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-02 23:54:50,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:50,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-02 23:54:50,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 23:54:50,315 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 40 states, 40 states have (on average 1.525) internal successors, (61), 39 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:54:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:53,469 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2021-05-02 23:54:53,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-02 23:54:53,471 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.525) internal successors, (61), 39 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:54:53,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:53,472 INFO L225 Difference]: With dead ends: 78 [2021-05-02 23:54:53,472 INFO L226 Difference]: Without dead ends: 70 [2021-05-02 23:54:53,474 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 6 SyntacticMatches, 19 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 3582.2ms TimeCoverageRelationStatistics Valid=305, Invalid=5857, Unknown=0, NotChecked=0, Total=6162 [2021-05-02 23:54:53,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-05-02 23:54:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-05-02 23:54:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2021-05-02 23:54:53,487 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 65 [2021-05-02 23:54:53,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:53,487 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2021-05-02 23:54:53,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.525) internal successors, (61), 39 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:54:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2021-05-02 23:54:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-02 23:54:53,488 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:53,488 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:53,488 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-02 23:54:53,488 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:53,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1487684235, now seen corresponding path program 19 times [2021-05-02 23:54:53,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:53,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [539257043] [2021-05-02 23:54:53,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:53,503 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_268 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_268} OutVars{main_~x~0=v_main_~x~0_268} AuxVars[] AssignedVars[] [2021-05-02 23:54:53,506 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:53,526 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:53,547 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:53,572 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:53,608 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:53,612 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_270 4294967296) 500000) (< (mod (+ v_main_~x~0_270 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_270} OutVars{main_~x~0=v_main_~x~0_270} AuxVars[] AssignedVars[] [2021-05-02 23:54:53,616 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:53,647 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:53,651 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:54,280 WARN L205 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:54:54,328 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:54,342 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:54,407 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:54,451 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:54,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:54,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:54:55,542 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:55,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [539257043] [2021-05-02 23:54:55,543 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [539257043] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:55,543 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:55,543 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-02 23:54:55,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296991186] [2021-05-02 23:54:55,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 23:54:55,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:55,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 23:54:55,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:54:55,546 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 2 states have call successors, (3), 3 states 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:54:56,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:56,988 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2021-05-02 23:54:56,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-02 23:54:56,989 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-05-02 23:54:56,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:56,990 INFO L225 Difference]: With dead ends: 82 [2021-05-02 23:54:56,991 INFO L226 Difference]: Without dead ends: 74 [2021-05-02 23:54:56,992 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 6 SyntacticMatches, 39 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1641.4ms TimeCoverageRelationStatistics Valid=170, Invalid=1810, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:54:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-02 23:54:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2021-05-02 23:54:57,004 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:54:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2021-05-02 23:54:57,005 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 68 [2021-05-02 23:54:57,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:57,005 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2021-05-02 23:54:57,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 2 states have call successors, (3), 3 states 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:54:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2021-05-02 23:54:57,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-02 23:54:57,006 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:57,007 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:57,007 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-02 23:54:57,007 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:57,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:57,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1876656189, now seen corresponding path program 20 times [2021-05-02 23:54:57,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:57,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1809122799] [2021-05-02 23:54:57,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:57,018 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_292 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_292} OutVars{main_~x~0=v_main_~x~0_292} AuxVars[] AssignedVars[] [2021-05-02 23:54:57,020 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:54:57,042 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:57,076 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:57,116 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:54:57,168 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:57,172 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_294 4294967296) 500000) (< (mod (+ v_main_~x~0_294 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_294} OutVars{main_~x~0=v_main_~x~0_294} AuxVars[] AssignedVars[] [2021-05-02 23:54:57,177 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:54:57,222 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:57,227 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:57,342 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:57,351 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:57,417 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:54:57,455 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:57,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:57,580 INFO 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:54:58,601 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:58,602 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1809122799] [2021-05-02 23:54:58,602 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1809122799] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:58,602 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:58,602 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-02 23:54:58,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828986862] [2021-05-02 23:54:58,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-02 23:54:58,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:58,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-02 23:54:58,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2021-05-02 23:54:58,605 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 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:55:00,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:00,404 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2021-05-02 23:55:00,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-02 23:55:00,407 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 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:55:00,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:00,408 INFO L225 Difference]: With dead ends: 85 [2021-05-02 23:55:00,408 INFO L226 Difference]: Without dead ends: 77 [2021-05-02 23:55:00,409 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 6 SyntacticMatches, 41 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1845.3ms TimeCoverageRelationStatistics Valid=178, Invalid=1984, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:55:00,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-02 23:55:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2021-05-02 23:55:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 3 states have call successors, (3), 3 states 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:55:00,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2021-05-02 23:55:00,422 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2021-05-02 23:55:00,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:00,423 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2021-05-02 23:55:00,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 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:55:00,423 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2021-05-02 23:55:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-02 23:55:00,424 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:00,424 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:00,425 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-02 23:55:00,425 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:00,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1585408117, now seen corresponding path program 21 times [2021-05-02 23:55:00,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:00,426 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [958083094] [2021-05-02 23:55:00,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:00,438 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_317 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_317} OutVars{main_~x~0=v_main_~x~0_317} AuxVars[] AssignedVars[] [2021-05-02 23:55:00,442 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:55:00,465 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:00,489 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:00,518 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:55:00,557 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:00,576 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_319 4294967296) 500000) (< (mod (+ v_main_~x~0_319 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_319} OutVars{main_~x~0=v_main_~x~0_319} AuxVars[] AssignedVars[] [2021-05-02 23:55:00,581 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:55:00,621 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:00,625 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:00,682 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:00,689 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:00,761 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:55:00,806 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:00,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:00,895 INFO 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:55:02,167 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:02,167 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [958083094] [2021-05-02 23:55:02,167 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [958083094] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:02,167 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:02,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-02 23:55:02,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166473582] [2021-05-02 23:55:02,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 23:55:02,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:02,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 23:55:02,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:55:02,170 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 2 states have call successors, (3), 3 states 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:55:03,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:03,995 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2021-05-02 23:55:03,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-02 23:55:03,997 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2021-05-02 23:55:03,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:03,998 INFO L225 Difference]: With dead ends: 88 [2021-05-02 23:55:03,998 INFO L226 Difference]: Without dead ends: 80 [2021-05-02 23:55:04,000 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 6 SyntacticMatches, 43 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 2037.5ms TimeCoverageRelationStatistics Valid=186, Invalid=2166, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:55:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-05-02 23:55:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2021-05-02 23:55:04,017 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:55:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2021-05-02 23:55:04,019 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2021-05-02 23:55:04,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:04,019 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2021-05-02 23:55:04,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 2 states have call successors, (3), 3 states 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:55:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2021-05-02 23:55:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-02 23:55:04,020 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:04,021 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:04,021 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-02 23:55:04,021 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:04,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:04,021 INFO L82 PathProgramCache]: Analyzing trace with hash -848033085, now seen corresponding path program 22 times [2021-05-02 23:55:04,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:04,022 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1288774757] [2021-05-02 23:55:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:04,033 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_343 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_343} OutVars{main_~x~0=v_main_~x~0_343} AuxVars[] AssignedVars[] [2021-05-02 23:55:04,037 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:55:04,039 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:04,071 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:04,135 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:55:04,179 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:04,192 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_345 1) 4294967296) 1000000) (< (mod v_main_~x~0_345 4294967296) 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:55:04,201 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:55:04,203 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:04,207 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:04,337 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:04,348 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:04,453 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:55:04,662 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-02 23:55:04,665 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:04,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:04,802 INFO 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:55:07,324 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:07,325 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1288774757] [2021-05-02 23:55:07,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1288774757] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:07,325 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:07,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-02 23:55:07,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273537967] [2021-05-02 23:55:07,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-02 23:55:07,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:07,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-02 23:55:07,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2021-05-02 23:55:07,328 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 48 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 47 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:55:11,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:11,620 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2021-05-02 23:55:11,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-02 23:55:11,621 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 47 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:55:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:11,623 INFO L225 Difference]: With dead ends: 90 [2021-05-02 23:55:11,623 INFO L226 Difference]: Without dead ends: 82 [2021-05-02 23:55:11,626 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 6 SyntacticMatches, 23 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 5023.0ms TimeCoverageRelationStatistics Valid=369, Invalid=8561, Unknown=0, NotChecked=0, Total=8930 [2021-05-02 23:55:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-05-02 23:55:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-05-02 23:55:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 3 states have call successors, (3), 3 states 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:55:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2021-05-02 23:55:11,642 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 77 [2021-05-02 23:55:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:11,642 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2021-05-02 23:55:11,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 47 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:55:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2021-05-02 23:55:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-02 23:55:11,644 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:11,644 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:11,644 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-02 23:55:11,644 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:11,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:11,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1828793483, now seen corresponding path program 23 times [2021-05-02 23:55:11,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:11,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2083772225] [2021-05-02 23:55:11,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:11,658 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_370 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_370} OutVars{main_~x~0=v_main_~x~0_370} AuxVars[] AssignedVars[] [2021-05-02 23:55:11,661 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:55:11,690 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:11,723 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:11,761 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:55:11,834 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:11,846 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_372 4294967296) 500000) (< (mod (+ v_main_~x~0_372 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_372} OutVars{main_~x~0=v_main_~x~0_372} AuxVars[] AssignedVars[] [2021-05-02 23:55:11,850 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:55:11,897 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:11,903 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:12,834 WARN L205 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:55:12,884 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:12,895 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:12,934 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:55:12,979 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:13,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:13,072 INFO 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:55:14,372 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:14,372 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2083772225] [2021-05-02 23:55:14,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2083772225] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:14,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:14,373 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-02 23:55:14,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468000322] [2021-05-02 23:55:14,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 23:55:14,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:14,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 23:55:14,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:55:14,374 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 2 states have call successors, (3), 3 states 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:55:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:16,403 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-05-02 23:55:16,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-02 23:55:16,404 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2021-05-02 23:55:16,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:16,405 INFO L225 Difference]: With dead ends: 94 [2021-05-02 23:55:16,405 INFO L226 Difference]: Without dead ends: 86 [2021-05-02 23:55:16,406 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 6 SyntacticMatches, 47 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 2171.5ms TimeCoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:55:16,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-05-02 23:55:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2021-05-02 23:55:16,421 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:55:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2021-05-02 23:55:16,422 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 80 [2021-05-02 23:55:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:16,422 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2021-05-02 23:55:16,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 2 states have call successors, (3), 3 states 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:55:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2021-05-02 23:55:16,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-02 23:55:16,424 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:16,424 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:16,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-02 23:55:16,424 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:16,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:16,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1783671357, now seen corresponding path program 24 times [2021-05-02 23:55:16,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:16,425 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1793559375] [2021-05-02 23:55:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:16,438 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_398 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_398} OutVars{main_~x~0=v_main_~x~0_398} AuxVars[] AssignedVars[] [2021-05-02 23:55:16,442 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:55:16,473 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:16,505 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:16,534 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:55:16,571 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:16,575 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_400 4294967296) 500000) (< (mod (+ v_main_~x~0_400 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_400} OutVars{main_~x~0=v_main_~x~0_400} AuxVars[] AssignedVars[] [2021-05-02 23:55:16,582 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:55:16,618 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:16,621 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:16,729 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:16,737 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:16,787 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:55:16,830 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:16,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:16,919 INFO 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:55:18,341 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:18,342 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1793559375] [2021-05-02 23:55:18,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1793559375] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:18,342 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:18,342 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-02 23:55:18,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821811443] [2021-05-02 23:55:18,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-02 23:55:18,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:18,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-02 23:55:18,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:55:18,344 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 28 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:55:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:20,463 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2021-05-02 23:55:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-02 23:55:20,464 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 28 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:55:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:20,465 INFO L225 Difference]: With dead ends: 97 [2021-05-02 23:55:20,465 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 23:55:20,467 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 6 SyntacticMatches, 49 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2310.8ms TimeCoverageRelationStatistics Valid=210, Invalid=2760, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:55:20,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 23:55:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-05-02 23:55:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 3 states have call successors, (3), 3 states 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:55:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2021-05-02 23:55:20,484 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 83 [2021-05-02 23:55:20,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:20,484 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2021-05-02 23:55:20,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 28 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:55:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2021-05-02 23:55:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-05-02 23:55:20,486 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:20,486 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:20,486 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-02 23:55:20,486 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:20,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:20,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1728183925, now seen corresponding path program 25 times [2021-05-02 23:55:20,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:20,487 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1916359029] [2021-05-02 23:55:20,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:20,498 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_427 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_427} OutVars{main_~x~0=v_main_~x~0_427} AuxVars[] AssignedVars[] [2021-05-02 23:55:20,501 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:55:20,524 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:20,545 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:20,574 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:55:20,609 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:20,613 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_429 1) 4294967296) 1000000) (< (mod v_main_~x~0_429 4294967296) 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:55:20,615 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:55:20,618 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:20,624 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:20,747 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:20,757 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:20,831 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:55:20,876 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:20,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:20,971 INFO 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:55:22,387 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:22,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1916359029] [2021-05-02 23:55:22,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1916359029] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:22,388 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:22,388 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-02 23:55:22,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798090127] [2021-05-02 23:55:22,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-02 23:55:22,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:22,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-02 23:55:22,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:55:22,391 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:24,751 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2021-05-02 23:55:24,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-02 23:55:24,752 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2021-05-02 23:55:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:24,753 INFO L225 Difference]: With dead ends: 100 [2021-05-02 23:55:24,753 INFO L226 Difference]: Without dead ends: 92 [2021-05-02 23:55:24,754 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 6 SyntacticMatches, 51 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 2445.3ms TimeCoverageRelationStatistics Valid=218, Invalid=2974, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:55:24,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-05-02 23:55:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2021-05-02 23:55:24,769 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:55:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2021-05-02 23:55:24,770 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2021-05-02 23:55:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:24,771 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2021-05-02 23:55:24,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 29 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2021-05-02 23:55:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-02 23:55:24,772 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:24,772 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:24,772 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-02 23:55:24,772 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:24,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:24,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2030461123, now seen corresponding path program 26 times [2021-05-02 23:55:24,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:24,773 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2131533391] [2021-05-02 23:55:24,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:24,785 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_457 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_457} OutVars{main_~x~0=v_main_~x~0_457} AuxVars[] AssignedVars[] [2021-05-02 23:55:24,789 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:55:24,815 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:24,843 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:24,867 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:55:24,904 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:24,908 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_459 1) 4294967296) 1000000) (< (mod v_main_~x~0_459 4294967296) 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:55:24,912 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:55:24,947 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:24,959 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:25,150 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:55:25,156 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:25,169 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:25,241 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:55:25,290 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:25,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:25,395 INFO 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:55:27,013 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:27,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2131533391] [2021-05-02 23:55:27,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2131533391] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:27,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:27,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-02 23:55:27,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818817579] [2021-05-02 23:55:27,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-02 23:55:27,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:27,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-02 23:55:27,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-05-02 23:55:27,015 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 30 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:55:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:29,388 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2021-05-02 23:55:29,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-02 23:55:29,389 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 30 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:55:29,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:29,390 INFO L225 Difference]: With dead ends: 103 [2021-05-02 23:55:29,390 INFO L226 Difference]: Without dead ends: 95 [2021-05-02 23:55:29,391 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 6 SyntacticMatches, 53 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2636.3ms TimeCoverageRelationStatistics Valid=226, Invalid=3196, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 23:55:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-02 23:55:29,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2021-05-02 23:55:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 3 states have call successors, (3), 3 states 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:55:29,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2021-05-02 23:55:29,414 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 89 [2021-05-02 23:55:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:29,414 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2021-05-02 23:55:29,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 30 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:55:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2021-05-02 23:55:29,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-05-02 23:55:29,415 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:29,416 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:29,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-05-02 23:55:29,416 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:29,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:29,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1732712075, now seen corresponding path program 27 times [2021-05-02 23:55:29,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:29,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [646770995] [2021-05-02 23:55:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:29,426 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_488 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_488} OutVars{main_~x~0=v_main_~x~0_488} AuxVars[] AssignedVars[] [2021-05-02 23:55:29,431 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:55:29,442 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:29,471 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:29,518 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:55:29,553 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:29,556 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_490 4294967296) 500000) (< (mod (+ v_main_~x~0_490 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_490} OutVars{main_~x~0=v_main_~x~0_490} AuxVars[] AssignedVars[] [2021-05-02 23:55:29,559 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:55:29,561 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:29,567 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:29,660 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:29,670 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:29,764 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:55:29,804 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:29,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:29,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-02 23:55:31,553 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:31,554 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [646770995] [2021-05-02 23:55:31,554 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [646770995] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:31,554 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:31,554 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-02 23:55:31,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388147910] [2021-05-02 23:55:31,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 23:55:31,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:31,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 23:55:31,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:55:31,556 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 32 states, 32 states have (on average 2.75) internal successors, (88), 31 states have internal predecessors, (88), 2 states have call successors, (3), 3 states 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:55:34,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:34,324 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-05-02 23:55:34,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-02 23:55:34,325 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.75) internal successors, (88), 31 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2021-05-02 23:55:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:34,326 INFO L225 Difference]: With dead ends: 106 [2021-05-02 23:55:34,326 INFO L226 Difference]: Without dead ends: 98 [2021-05-02 23:55:34,327 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 6 SyntacticMatches, 55 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 2811.2ms TimeCoverageRelationStatistics Valid=234, Invalid=3426, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 23:55:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-02 23:55:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2021-05-02 23:55:34,341 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:55:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2021-05-02 23:55:34,342 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 92 [2021-05-02 23:55:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:34,342 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2021-05-02 23:55:34,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 2.75) internal successors, (88), 31 states have internal predecessors, (88), 2 states have call successors, (3), 3 states 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:55:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2021-05-02 23:55:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-02 23:55:34,343 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:34,343 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:34,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-05-02 23:55:34,343 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:34,344 INFO L82 PathProgramCache]: Analyzing trace with hash 598289347, now seen corresponding path program 28 times [2021-05-02 23:55:34,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:34,344 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [564973118] [2021-05-02 23:55:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:34,355 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_520 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_520} OutVars{main_~x~0=v_main_~x~0_520} AuxVars[] AssignedVars[] [2021-05-02 23:55:34,358 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:55:34,379 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:34,403 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:34,433 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:55:34,468 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:34,477 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_522 4294967296) 500000) (< (mod (+ v_main_~x~0_522 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_522} OutVars{main_~x~0=v_main_~x~0_522} AuxVars[] AssignedVars[] [2021-05-02 23:55:34,481 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:55:34,482 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:34,490 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:34,558 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:34,568 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:34,671 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:55:34,712 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:34,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:55:36,531 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:36,531 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [564973118] [2021-05-02 23:55:36,531 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [564973118] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:36,531 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:36,532 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-02 23:55:36,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359449937] [2021-05-02 23:55:36,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-02 23:55:36,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:36,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-02 23:55:36,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 23:55:36,533 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 33 states, 33 states have (on average 2.757575757575758) internal successors, (91), 32 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:55:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:39,209 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2021-05-02 23:55:39,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-02 23:55:39,210 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.757575757575758) internal successors, (91), 32 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:55:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:39,211 INFO L225 Difference]: With dead ends: 109 [2021-05-02 23:55:39,211 INFO L226 Difference]: Without dead ends: 101 [2021-05-02 23:55:39,213 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 6 SyntacticMatches, 57 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 2819.2ms TimeCoverageRelationStatistics Valid=242, Invalid=3664, Unknown=0, NotChecked=0, Total=3906 [2021-05-02 23:55:39,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-02 23:55:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2021-05-02 23:55:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 95 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2021-05-02 23:55:39,233 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 95 [2021-05-02 23:55:39,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:39,233 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2021-05-02 23:55:39,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 2.757575757575758) internal successors, (91), 32 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:55:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2021-05-02 23:55:39,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-05-02 23:55:39,234 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:39,234 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:39,235 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-05-02 23:55:39,235 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:39,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:39,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2108451723, now seen corresponding path program 29 times [2021-05-02 23:55:39,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:39,236 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1105551582] [2021-05-02 23:55:39,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:39,252 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_553 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_553} OutVars{main_~x~0=v_main_~x~0_553} AuxVars[] AssignedVars[] [2021-05-02 23:55:39,270 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:55:39,299 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:39,336 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:39,370 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:55:39,421 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:39,426 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_555 4294967296) 500000) (< (mod (+ v_main_~x~0_555 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_555} OutVars{main_~x~0=v_main_~x~0_555} AuxVars[] AssignedVars[] [2021-05-02 23:55:39,429 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:55:39,431 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:39,436 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:39,633 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:39,697 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:39,777 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:55:39,813 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:39,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:55:41,869 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:41,869 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1105551582] [2021-05-02 23:55:41,869 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1105551582] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:41,870 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:41,870 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-02 23:55:41,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962725280] [2021-05-02 23:55:41,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-02 23:55:41,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:41,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-02 23:55:41,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:55:41,872 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 33 states have internal predecessors, (94), 2 states have call successors, (3), 3 states 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:55:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:44,831 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2021-05-02 23:55:44,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-02 23:55:44,831 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 33 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2021-05-02 23:55:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:44,832 INFO L225 Difference]: With dead ends: 112 [2021-05-02 23:55:44,833 INFO L226 Difference]: Without dead ends: 104 [2021-05-02 23:55:44,834 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 6 SyntacticMatches, 59 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 3219.4ms TimeCoverageRelationStatistics Valid=250, Invalid=3910, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 23:55:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-05-02 23:55:44,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2021-05-02 23:55:44,854 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:55:44,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2021-05-02 23:55:44,855 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2021-05-02 23:55:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:44,855 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2021-05-02 23:55:44,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 2.764705882352941) internal successors, (94), 33 states have internal predecessors, (94), 2 states have call successors, (3), 3 states 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:55:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2021-05-02 23:55:44,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-05-02 23:55:44,857 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:44,857 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:44,857 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-05-02 23:55:44,857 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:44,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:44,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1573369539, now seen corresponding path program 30 times [2021-05-02 23:55:44,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:44,858 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1434917487] [2021-05-02 23:55:44,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:44,870 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_587 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_587} OutVars{main_~x~0=v_main_~x~0_587} AuxVars[] AssignedVars[] [2021-05-02 23:55:44,873 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:55:44,894 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:44,919 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:44,947 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:55:44,985 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:44,989 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_589 4294967296) 500000) (< (mod (+ v_main_~x~0_589 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_589} OutVars{main_~x~0=v_main_~x~0_589} AuxVars[] AssignedVars[] [2021-05-02 23:55:44,992 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:55:45,025 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:45,029 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:45,567 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:55:45,618 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:45,657 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:45,715 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:55:45,757 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:45,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:45,841 INFO 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:55:47,809 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:47,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1434917487] [2021-05-02 23:55:47,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1434917487] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:47,810 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:47,810 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-02 23:55:47,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732208978] [2021-05-02 23:55:47,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-02 23:55:47,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:47,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-02 23:55:47,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 23:55:47,812 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 34 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:55:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:50,969 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2021-05-02 23:55:50,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-02 23:55:50,969 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 34 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:55:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:50,971 INFO L225 Difference]: With dead ends: 115 [2021-05-02 23:55:50,971 INFO L226 Difference]: Without dead ends: 107 [2021-05-02 23:55:50,972 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 6 SyntacticMatches, 61 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 3283.4ms TimeCoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2021-05-02 23:55:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-02 23:55:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2021-05-02 23:55:50,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 101 states have internal predecessors, (103), 3 states have call successors, (3), 3 states 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:55:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2021-05-02 23:55:50,989 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 101 [2021-05-02 23:55:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:50,989 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2021-05-02 23:55:50,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 2.7714285714285714) internal successors, (97), 34 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:55:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2021-05-02 23:55:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-05-02 23:55:50,990 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:50,990 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:50,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-02 23:55:50,990 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:50,991 INFO L82 PathProgramCache]: Analyzing trace with hash -436338549, now seen corresponding path program 31 times [2021-05-02 23:55:50,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:50,991 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1835501998] [2021-05-02 23:55:50,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:51,000 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_622 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_622} OutVars{main_~x~0=v_main_~x~0_622} AuxVars[] AssignedVars[] [2021-05-02 23:55:51,003 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:55:51,031 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:51,057 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:51,081 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:55:51,127 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:51,131 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_624 1) 4294967296) 1000000) (< (mod v_main_~x~0_624 4294967296) 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:55:51,136 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:55:51,138 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:51,142 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:51,254 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:51,266 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:51,428 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:55:51,477 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:51,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:55:54,104 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:54,105 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1835501998] [2021-05-02 23:55:54,105 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1835501998] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:54,105 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:54,105 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-02 23:55:54,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215851759] [2021-05-02 23:55:54,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-02 23:55:54,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:54,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-02 23:55:54,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:55:54,107 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 35 states have internal predecessors, (100), 2 states have call successors, (3), 3 states 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:55:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:57,508 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2021-05-02 23:55:57,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-02 23:55:57,509 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 35 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2021-05-02 23:55:57,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:57,510 INFO L225 Difference]: With dead ends: 118 [2021-05-02 23:55:57,510 INFO L226 Difference]: Without dead ends: 110 [2021-05-02 23:55:57,511 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 6 SyntacticMatches, 63 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 3982.5ms TimeCoverageRelationStatistics Valid=266, Invalid=4426, Unknown=0, NotChecked=0, Total=4692 [2021-05-02 23:55:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-05-02 23:55:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2021-05-02 23:55:57,526 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:55:57,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2021-05-02 23:55:57,527 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2021-05-02 23:55:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:57,527 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2021-05-02 23:55:57,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 35 states have internal predecessors, (100), 2 states have call successors, (3), 3 states 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:55:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2021-05-02 23:55:57,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-02 23:55:57,528 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:57,528 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:57,528 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-05-02 23:55:57,528 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:57,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:57,529 INFO L82 PathProgramCache]: Analyzing trace with hash 194118083, now seen corresponding path program 32 times [2021-05-02 23:55:57,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:57,529 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1512486220] [2021-05-02 23:55:57,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:57,539 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_658 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_658} OutVars{main_~x~0=v_main_~x~0_658} AuxVars[] AssignedVars[] [2021-05-02 23:55:57,542 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:55:57,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:57,576 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:57,632 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:55:57,668 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:57,671 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_660 1) 4294967296) 1000000) (< (mod v_main_~x~0_660 4294967296) 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:55:57,674 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:55:57,710 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:57,720 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:57,812 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:57,826 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:57,891 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:55:57,950 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:58,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:56:00,384 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:56:00,384 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1512486220] [2021-05-02 23:56:00,385 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1512486220] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:56:00,385 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:56:00,385 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-02 23:56:00,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044616257] [2021-05-02 23:56:00,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-02 23:56:00,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:56:00,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-02 23:56:00,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 23:56:00,387 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 37 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 36 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:56:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:56:03,803 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2021-05-02 23:56:03,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-02 23:56:03,804 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 36 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:56:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:56:03,806 INFO L225 Difference]: With dead ends: 121 [2021-05-02 23:56:03,806 INFO L226 Difference]: Without dead ends: 113 [2021-05-02 23:56:03,806 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 6 SyntacticMatches, 65 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 3718.2ms TimeCoverageRelationStatistics Valid=274, Invalid=4696, Unknown=0, NotChecked=0, Total=4970 [2021-05-02 23:56:03,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-02 23:56:03,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2021-05-02 23:56:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 3 states have call successors, (3), 3 states 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:56:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2021-05-02 23:56:03,821 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 107 [2021-05-02 23:56:03,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:56:03,822 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2021-05-02 23:56:03,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 2.7837837837837838) internal successors, (103), 36 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:56:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2021-05-02 23:56:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-05-02 23:56:03,823 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:56:03,823 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:56:03,823 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-05-02 23:56:03,823 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:56:03,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:56:03,824 INFO L82 PathProgramCache]: Analyzing trace with hash 235656587, now seen corresponding path program 33 times [2021-05-02 23:56:03,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:56:03,825 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [458579873] [2021-05-02 23:56:03,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:56:03,840 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_695 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_695} OutVars{main_~x~0=v_main_~x~0_695} AuxVars[] AssignedVars[] [2021-05-02 23:56:03,845 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:56:03,847 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:03,873 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:56:03,935 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:56:03,985 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:04,004 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_697 1) 4294967296) 1000000) (< (mod v_main_~x~0_697 4294967296) 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:56:04,009 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:56:04,057 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:04,062 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:06,183 WARN L205 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:56:06,241 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:56:06,277 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:56:06,339 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:56:06,392 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:06,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:56:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:06,519 INFO 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:56:09,091 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:56:09,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [458579873] [2021-05-02 23:56:09,092 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [458579873] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:56:09,092 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:56:09,092 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-02 23:56:09,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472781534] [2021-05-02 23:56:09,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-02 23:56:09,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:56:09,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-02 23:56:09,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:56:09,093 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 37 states have internal predecessors, (106), 2 states have call successors, (3), 3 states 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:56:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:56:12,084 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2021-05-02 23:56:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-02 23:56:12,085 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 37 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2021-05-02 23:56:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:56:12,085 INFO L225 Difference]: With dead ends: 124 [2021-05-02 23:56:12,085 INFO L226 Difference]: Without dead ends: 116 [2021-05-02 23:56:12,086 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 6 SyntacticMatches, 67 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 3778.1ms TimeCoverageRelationStatistics Valid=282, Invalid=4974, Unknown=0, NotChecked=0, Total=5256 [2021-05-02 23:56:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-05-02 23:56:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-05-02 23:56:12,106 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:56:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2021-05-02 23:56:12,107 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2021-05-02 23:56:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:56:12,107 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2021-05-02 23:56:12,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 2.789473684210526) internal successors, (106), 37 states have internal predecessors, (106), 2 states have call successors, (3), 3 states 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:56:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2021-05-02 23:56:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-02 23:56:12,108 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:56:12,108 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:56:12,108 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-02 23:56:12,108 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:56:12,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:56:12,109 INFO L82 PathProgramCache]: Analyzing trace with hash 758648003, now seen corresponding path program 34 times [2021-05-02 23:56:12,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:56:12,109 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1328463391] [2021-05-02 23:56:12,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:56:12,117 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_733 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_733} OutVars{main_~x~0=v_main_~x~0_733} AuxVars[] AssignedVars[] [2021-05-02 23:56:12,119 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:56:12,138 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:12,156 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:56:12,185 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:56:12,249 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:12,253 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_735 4294967296) 500000) (< (mod (+ v_main_~x~0_735 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_735} OutVars{main_~x~0=v_main_~x~0_735} AuxVars[] AssignedVars[] [2021-05-02 23:56:12,255 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:56:12,256 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:12,259 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:12,382 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:56:12,389 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:56:12,448 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:56:12,476 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:12,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:56:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:12,591 INFO 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:56:16,822 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:56:16,823 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1328463391] [2021-05-02 23:56:16,823 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1328463391] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:56:16,823 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:56:16,823 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2021-05-02 23:56:16,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152870624] [2021-05-02 23:56:16,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2021-05-02 23:56:16,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:56:16,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-05-02 23:56:16,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=5186, Unknown=0, NotChecked=0, Total=5402 [2021-05-02 23:56:16,825 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 72 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 71 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:56:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:56:24,432 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2021-05-02 23:56:24,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-05-02 23:56:24,433 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 71 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:56:24,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:56:24,434 INFO L225 Difference]: With dead ends: 126 [2021-05-02 23:56:24,434 INFO L226 Difference]: Without dead ends: 118 [2021-05-02 23:56:24,436 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 7 SyntacticMatches, 35 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2549 ImplicationChecksByTransitivity, 8612.6ms TimeCoverageRelationStatistics Valid=561, Invalid=19745, Unknown=0, NotChecked=0, Total=20306 [2021-05-02 23:56:24,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-05-02 23:56:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-05-02 23:56:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:56:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2021-05-02 23:56:24,458 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 113 [2021-05-02 23:56:24,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:56:24,458 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2021-05-02 23:56:24,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 72 states, 72 states have (on average 1.5138888888888888) internal successors, (109), 71 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:56:24,459 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2021-05-02 23:56:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-05-02 23:56:24,459 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:56:24,460 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:56:24,460 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-05-02 23:56:24,460 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:56:24,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:56:24,460 INFO L82 PathProgramCache]: Analyzing trace with hash -945427829, now seen corresponding path program 35 times [2021-05-02 23:56:24,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:56:24,461 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1437143958] [2021-05-02 23:56:24,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:56:24,469 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_772 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_772} OutVars{main_~x~0=v_main_~x~0_772} AuxVars[] AssignedVars[] [2021-05-02 23:56:24,472 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:56:24,487 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:24,505 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:56:24,522 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:56:24,550 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:24,552 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_774 4294967296) 500000) (< (mod (+ v_main_~x~0_774 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_774} OutVars{main_~x~0=v_main_~x~0_774} AuxVars[] AssignedVars[] [2021-05-02 23:56:24,554 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:56:24,593 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:24,597 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:25,298 WARN L205 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:56:25,390 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:56:25,404 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:56:28,022 WARN L205 SmtUtils]: Spent 2.59 s on a formula simplification that was a NOOP. DAG size: 3 [2021-05-02 23:56:28,037 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:56:28,068 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:28,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:56:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:28,124 INFO 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:56:30,423 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:56:30,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1437143958] [2021-05-02 23:56:30,424 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1437143958] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:56:30,424 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:56:30,424 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-02 23:56:30,424 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385410019] [2021-05-02 23:56:30,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-02 23:56:30,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:56:30,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-02 23:56:30,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:56:30,426 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand has 40 states, 40 states have (on average 2.8) internal successors, (112), 39 states have internal predecessors, (112), 2 states have call successors, (3), 3 states 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:56:33,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:56:33,760 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2021-05-02 23:56:33,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-02 23:56:33,761 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.8) internal successors, (112), 39 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2021-05-02 23:56:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:56:33,762 INFO L225 Difference]: With dead ends: 130 [2021-05-02 23:56:33,762 INFO L226 Difference]: Without dead ends: 122 [2021-05-02 23:56:33,763 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 6 SyntacticMatches, 71 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 3648.8ms TimeCoverageRelationStatistics Valid=298, Invalid=5554, Unknown=0, NotChecked=0, Total=5852 [2021-05-02 23:56:33,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-05-02 23:56:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2021-05-02 23:56:33,779 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:56:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2021-05-02 23:56:33,780 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 116 [2021-05-02 23:56:33,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:56:33,780 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2021-05-02 23:56:33,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 2.8) internal successors, (112), 39 states have internal predecessors, (112), 2 states have call successors, (3), 3 states 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:56:33,781 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2021-05-02 23:56:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-05-02 23:56:33,781 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:56:33,781 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:56:33,781 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-05-02 23:56:33,782 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:56:33,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:56:33,782 INFO L82 PathProgramCache]: Analyzing trace with hash -555100221, now seen corresponding path program 36 times [2021-05-02 23:56:33,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:56:33,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1787282578] [2021-05-02 23:56:33,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:56:33,789 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_812 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_812} OutVars{main_~x~0=v_main_~x~0_812} AuxVars[] AssignedVars[] [2021-05-02 23:56:33,792 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:56:33,810 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:33,827 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:56:33,848 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:56:33,892 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:33,895 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_814 1) 4294967296) 1000000) (< (mod v_main_~x~0_814 4294967296) 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:56:33,898 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:56:33,926 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:33,930 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:33,985 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:56:33,990 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:56:34,022 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:56:34,058 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:34,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:56:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:56:38,812 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:56:38,813 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1787282578] [2021-05-02 23:56:38,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1787282578] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:56:38,813 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:56:38,813 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2021-05-02 23:56:38,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476040367] [2021-05-02 23:56:38,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2021-05-02 23:56:38,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:56:38,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-05-02 23:56:38,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=5778, Unknown=0, NotChecked=0, Total=6006 [2021-05-02 23:56:38,815 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 76 states, 76 states have (on average 1.513157894736842) internal successors, (115), 75 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:56:47,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:56:47,959 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2021-05-02 23:56:47,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-05-02 23:56:47,960 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.513157894736842) internal successors, (115), 75 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:56:47,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:56:47,961 INFO L225 Difference]: With dead ends: 132 [2021-05-02 23:56:47,961 INFO L226 Difference]: Without dead ends: 124 [2021-05-02 23:56:47,963 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 7 SyntacticMatches, 37 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2843 ImplicationChecksByTransitivity, 9911.6ms TimeCoverageRelationStatistics Valid=593, Invalid=22057, Unknown=0, NotChecked=0, Total=22650 [2021-05-02 23:56:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-05-02 23:56:47,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-05-02 23:56:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.0168067226890756) internal successors, (121), 119 states have internal predecessors, (121), 3 states have call successors, (3), 3 states 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:56:48,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2021-05-02 23:56:48,000 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 119 [2021-05-02 23:56:48,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:56:48,001 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2021-05-02 23:56:48,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 76 states, 76 states have (on average 1.513157894736842) internal successors, (115), 75 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:56:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2021-05-02 23:56:48,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-05-02 23:56:48,002 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:56:48,002 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:56:48,002 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-05-02 23:56:48,002 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:56:48,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:56:48,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1218199435, now seen corresponding path program 37 times [2021-05-02 23:56:48,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:56:48,003 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1642922335] [2021-05-02 23:56:48,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:56:48,012 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_853 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_853} OutVars{main_~x~0=v_main_~x~0_853} AuxVars[] AssignedVars[] [2021-05-02 23:56:48,015 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:56:48,016 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:48,066 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:56:48,115 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:56:48,159 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:48,163 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_855 4294967296) 500000) (< (mod (+ v_main_~x~0_855 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_855} OutVars{main_~x~0=v_main_~x~0_855} AuxVars[] AssignedVars[] [2021-05-02 23:56:48,166 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:56:48,168 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:48,171 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:48,248 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:56:48,255 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:56:48,337 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:56:48,370 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:48,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:56:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:48,449 INFO 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:56:50,985 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:56:50,986 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1642922335] [2021-05-02 23:56:50,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1642922335] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:56:50,986 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:56:50,986 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-02 23:56:50,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146720104] [2021-05-02 23:56:50,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 23:56:50,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:56:50,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 23:56:50,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:56:50,987 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand has 42 states, 42 states have (on average 2.8095238095238093) internal successors, (118), 41 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:56:54,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:56:54,678 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-05-02 23:56:54,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-02 23:56:54,679 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.8095238095238093) internal successors, (118), 41 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2021-05-02 23:56:54,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:56:54,680 INFO L225 Difference]: With dead ends: 136 [2021-05-02 23:56:54,680 INFO L226 Difference]: Without dead ends: 128 [2021-05-02 23:56:54,681 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 6 SyntacticMatches, 75 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 4026.5ms TimeCoverageRelationStatistics Valid=314, Invalid=6166, Unknown=0, NotChecked=0, Total=6480 [2021-05-02 23:56:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-05-02 23:56:54,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2021-05-02 23:56:54,705 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-02 23:56:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2021-05-02 23:56:54,706 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2021-05-02 23:56:54,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:56:54,707 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2021-05-02 23:56:54,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 2.8095238095238093) internal successors, (118), 41 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:56:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2021-05-02 23:56:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-02 23:56:54,708 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:56:54,708 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:56:54,708 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-05-02 23:56:54,708 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:56:54,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:56:54,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1490510531, now seen corresponding path program 38 times [2021-05-02 23:56:54,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:56:54,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1087796801] [2021-05-02 23:56:54,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:56:54,719 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_895 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_895} OutVars{main_~x~0=v_main_~x~0_895} AuxVars[] AssignedVars[] [2021-05-02 23:56:54,726 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:56:54,727 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:54,755 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:56:54,804 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:56:54,850 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:54,853 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_897 4294967296) 500000) (< (mod (+ v_main_~x~0_897 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_897} OutVars{main_~x~0=v_main_~x~0_897} AuxVars[] AssignedVars[] [2021-05-02 23:56:54,856 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:56:54,857 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:54,860 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:54,973 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:56:54,992 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:56:55,099 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:56:55,131 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:55,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:56:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:55,206 INFO 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:56:57,849 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:56:57,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1087796801] [2021-05-02 23:56:57,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1087796801] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:56:57,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:56:57,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-02 23:56:57,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972427746] [2021-05-02 23:56:57,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-02 23:56:57,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:56:57,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-02 23:56:57,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 23:56:57,851 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 43 states, 43 states have (on average 2.813953488372093) internal successors, (121), 42 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-02 23:57:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:01,973 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2021-05-02 23:57:01,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-02 23:57:01,974 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.813953488372093) internal successors, (121), 42 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-02 23:57:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:01,978 INFO L225 Difference]: With dead ends: 139 [2021-05-02 23:57:01,978 INFO L226 Difference]: Without dead ends: 131 [2021-05-02 23:57:01,979 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 6 SyntacticMatches, 77 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 4317.2ms TimeCoverageRelationStatistics Valid=322, Invalid=6484, Unknown=0, NotChecked=0, Total=6806 [2021-05-02 23:57:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-02 23:57:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2021-05-02 23:57:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.016) internal successors, (127), 125 states have internal predecessors, (127), 3 states have call successors, (3), 3 states 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:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2021-05-02 23:57:02,002 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 125 [2021-05-02 23:57:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:02,003 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2021-05-02 23:57:02,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 2.813953488372093) internal successors, (121), 42 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-02 23:57:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2021-05-02 23:57:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-05-02 23:57:02,003 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:02,004 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:02,004 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-05-02 23:57:02,004 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:02,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:02,004 INFO L82 PathProgramCache]: Analyzing trace with hash 717149323, now seen corresponding path program 39 times [2021-05-02 23:57:02,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:02,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [279768162] [2021-05-02 23:57:02,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:02,012 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_938 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_938} OutVars{main_~x~0=v_main_~x~0_938} AuxVars[] AssignedVars[] [2021-05-02 23:57:02,015 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:57:02,016 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:02,036 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:57:02,072 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:57:02,102 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:02,104 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_940 1) 4294967296) 1000000) (< (mod v_main_~x~0_940 4294967296) 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:57:02,107 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:57:02,135 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:02,138 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:02,181 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:57:02,190 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:57:02,339 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2021-05-02 23:57:02,376 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:57:02,414 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:02,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:02,519 INFO 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:05,501 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:05,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [279768162] [2021-05-02 23:57:05,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [279768162] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:05,501 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:05,502 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-02 23:57:05,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878298563] [2021-05-02 23:57:05,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-02 23:57:05,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:05,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-02 23:57:05,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:57:05,503 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand has 44 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 43 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:09,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:09,755 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2021-05-02 23:57:09,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-02 23:57:09,756 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 43 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2021-05-02 23:57:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:09,757 INFO L225 Difference]: With dead ends: 142 [2021-05-02 23:57:09,757 INFO L226 Difference]: Without dead ends: 134 [2021-05-02 23:57:09,758 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 6 SyntacticMatches, 79 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 4711.5ms TimeCoverageRelationStatistics Valid=330, Invalid=6810, Unknown=0, NotChecked=0, Total=7140 [2021-05-02 23:57:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-05-02 23:57:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2021-05-02 23:57:09,784 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-02 23:57:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2021-05-02 23:57:09,785 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 128 [2021-05-02 23:57:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:09,786 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2021-05-02 23:57:09,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 2.8181818181818183) internal successors, (124), 43 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2021-05-02 23:57:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-05-02 23:57:09,787 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:09,787 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:09,787 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-05-02 23:57:09,787 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:09,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:09,788 INFO L82 PathProgramCache]: Analyzing trace with hash -282022461, now seen corresponding path program 40 times [2021-05-02 23:57:09,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:09,788 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1382697359] [2021-05-02 23:57:09,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:09,800 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_982 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_982} OutVars{main_~x~0=v_main_~x~0_982} AuxVars[] AssignedVars[] [2021-05-02 23:57:09,802 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:57:09,804 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:09,827 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:57:09,882 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:57:09,915 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:09,917 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_984 1) 4294967296) 1000000) (< (mod v_main_~x~0_984 4294967296) 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:57:09,919 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:57:09,949 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:09,952 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:10,015 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:57:10,023 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:57:10,076 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:57:10,109 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:10,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:10,187 INFO 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:13,125 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:13,125 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1382697359] [2021-05-02 23:57:13,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1382697359] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:13,125 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:13,125 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-02 23:57:13,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589201693] [2021-05-02 23:57:13,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-02 23:57:13,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:13,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-02 23:57:13,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2021-05-02 23:57:13,127 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand has 45 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 44 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-02 23:57:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:18,761 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2021-05-02 23:57:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-02 23:57:18,763 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 44 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-02 23:57:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:18,764 INFO L225 Difference]: With dead ends: 145 [2021-05-02 23:57:18,764 INFO L226 Difference]: Without dead ends: 137 [2021-05-02 23:57:18,766 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 6 SyntacticMatches, 81 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 5291.2ms TimeCoverageRelationStatistics Valid=338, Invalid=7144, Unknown=0, NotChecked=0, Total=7482 [2021-05-02 23:57:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-02 23:57:18,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2021-05-02 23:57:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.015267175572519) internal successors, (133), 131 states have internal predecessors, (133), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2021-05-02 23:57:18,797 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 131 [2021-05-02 23:57:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:18,798 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2021-05-02 23:57:18,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 2.8222222222222224) internal successors, (127), 44 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-02 23:57:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2021-05-02 23:57:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-05-02 23:57:18,799 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:18,799 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:18,799 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-02 23:57:18,800 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:18,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:18,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1809688971, now seen corresponding path program 41 times [2021-05-02 23:57:18,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:18,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763431064] [2021-05-02 23:57:18,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:18,816 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1027 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1027} OutVars{main_~x~0=v_main_~x~0_1027} AuxVars[] AssignedVars[] [2021-05-02 23:57:18,821 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:57:18,823 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:18,864 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:57:18,952 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:57:19,027 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:19,032 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1029 1) 4294967296) 1000000) (< (mod v_main_~x~0_1029 4294967296) 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:57:19,037 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:57:19,125 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:19,131 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:19,401 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:57:19,450 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:57:19,458 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:57:19,512 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:57:19,563 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:19,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:57:28,017 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:28,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1763431064] [2021-05-02 23:57:28,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1763431064] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:28,017 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:28,017 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [86] imperfect sequences [] total 86 [2021-05-02 23:57:28,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7029051] [2021-05-02 23:57:28,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2021-05-02 23:57:28,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:28,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-05-02 23:57:28,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=7398, Unknown=0, NotChecked=0, Total=7656 [2021-05-02 23:57:28,019 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand has 86 states, 86 states have (on average 1.5116279069767442) internal successors, (130), 85 states have internal predecessors, (130), 2 states have call successors, (3), 3 states 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,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:39,115 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2021-05-02 23:57:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2021-05-02 23:57:39,116 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.5116279069767442) internal successors, (130), 85 states have internal predecessors, (130), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2021-05-02 23:57:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:39,118 INFO L225 Difference]: With dead ends: 147 [2021-05-02 23:57:39,118 INFO L226 Difference]: Without dead ends: 139 [2021-05-02 23:57:39,120 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 7 SyntacticMatches, 42 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3648 ImplicationChecksByTransitivity, 14558.8ms TimeCoverageRelationStatistics Valid=673, Invalid=28397, Unknown=0, NotChecked=0, Total=29070 [2021-05-02 23:57:39,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-02 23:57:39,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-05-02 23:57:39,145 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-02 23:57:39,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2021-05-02 23:57:39,146 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2021-05-02 23:57:39,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:39,146 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2021-05-02 23:57:39,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 86 states, 86 states have (on average 1.5116279069767442) internal successors, (130), 85 states have internal predecessors, (130), 2 states have call successors, (3), 3 states 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,147 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2021-05-02 23:57:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-05-02 23:57:39,147 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:39,148 INFO L523 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:39,148 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-05-02 23:57:39,148 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:39,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:39,148 INFO L82 PathProgramCache]: Analyzing trace with hash 304462019, now seen corresponding path program 42 times [2021-05-02 23:57:39,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:39,149 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2017900473] [2021-05-02 23:57:39,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:39,158 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1073 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1073} OutVars{main_~x~0=v_main_~x~0_1073} AuxVars[] AssignedVars[] [2021-05-02 23:57:39,160 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:57:39,180 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:39,207 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:57:39,229 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:57:39,263 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:39,265 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1075 4294967296) 500000) (< (mod (+ v_main_~x~0_1075 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_1075} OutVars{main_~x~0=v_main_~x~0_1075} AuxVars[] AssignedVars[] [2021-05-02 23:57:39,267 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:57:39,293 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:39,296 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:39,342 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:57:39,349 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:57:39,405 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:57:39,441 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:39,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:39,518 INFO 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,810 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:42,811 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2017900473] [2021-05-02 23:57:42,811 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2017900473] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:42,811 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:42,811 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-02 23:57:42,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139910888] [2021-05-02 23:57:42,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-02 23:57:42,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:42,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-02 23:57:42,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2021-05-02 23:57:42,812 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 47 states, 47 states have (on average 2.8297872340425534) internal successors, (133), 46 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-02 23:57:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:47,667 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2021-05-02 23:57:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-02 23:57:47,668 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.8297872340425534) internal successors, (133), 46 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-02 23:57:47,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:47,669 INFO L225 Difference]: With dead ends: 151 [2021-05-02 23:57:47,669 INFO L226 Difference]: Without dead ends: 143 [2021-05-02 23:57:47,670 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 6 SyntacticMatches, 85 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 5244.7ms TimeCoverageRelationStatistics Valid=354, Invalid=7836, Unknown=0, NotChecked=0, Total=8190 [2021-05-02 23:57:47,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-02 23:57:47,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2021-05-02 23:57:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.0145985401459854) internal successors, (139), 137 states have internal predecessors, (139), 3 states have call successors, (3), 3 states 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:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2021-05-02 23:57:47,696 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 137 [2021-05-02 23:57:47,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:47,696 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2021-05-02 23:57:47,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 2.8297872340425534) internal successors, (133), 46 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-02 23:57:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2021-05-02 23:57:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-05-02 23:57:47,697 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:47,697 INFO L523 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:47,697 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-05-02 23:57:47,697 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:47,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:47,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1841872523, now seen corresponding path program 43 times [2021-05-02 23:57:47,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:47,698 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1989145426] [2021-05-02 23:57:47,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:47,707 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1120 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1120} OutVars{main_~x~0=v_main_~x~0_1120} AuxVars[] AssignedVars[] [2021-05-02 23:57:47,709 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:57:47,727 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:47,754 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:57:47,777 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:57:47,836 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:47,839 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1122 4294967296) 500000) (< (mod (+ v_main_~x~0_1122 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_1122} OutVars{main_~x~0=v_main_~x~0_1122} AuxVars[] AssignedVars[] [2021-05-02 23:57:47,842 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:57:47,843 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:47,847 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:47,951 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:57:47,958 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:57:48,137 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:57:48,186 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:48,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:48,272 INFO 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:51,688 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:51,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1989145426] [2021-05-02 23:57:51,689 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1989145426] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:51,689 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:51,689 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-02 23:57:51,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291109017] [2021-05-02 23:57:51,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-02 23:57:51,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:51,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-02 23:57:51,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:57:51,691 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand has 48 states, 48 states have (on average 2.8333333333333335) internal successors, (136), 47 states have internal predecessors, (136), 2 states have call successors, (3), 3 states 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,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:56,619 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2021-05-02 23:57:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-02 23:57:56,619 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.8333333333333335) internal successors, (136), 47 states have internal predecessors, (136), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 140 [2021-05-02 23:57:56,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:56,620 INFO L225 Difference]: With dead ends: 154 [2021-05-02 23:57:56,620 INFO L226 Difference]: Without dead ends: 146 [2021-05-02 23:57:56,621 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 6 SyntacticMatches, 87 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 5409.0ms TimeCoverageRelationStatistics Valid=362, Invalid=8194, Unknown=0, NotChecked=0, Total=8556 [2021-05-02 23:57:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-05-02 23:57:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2021-05-02 23:57:56,646 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-02 23:57:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2021-05-02 23:57:56,646 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 140 [2021-05-02 23:57:56,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:56,647 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2021-05-02 23:57:56,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 48 states have (on average 2.8333333333333335) internal successors, (136), 47 states have internal predecessors, (136), 2 states have call successors, (3), 3 states 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,647 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2021-05-02 23:57:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-02 23:57:56,648 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:56,648 INFO L523 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:56,648 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-02 23:57:56,648 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:56,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:56,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1306952643, now seen corresponding path program 44 times [2021-05-02 23:57:56,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:56,648 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1669270525] [2021-05-02 23:57:56,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:56,661 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1168 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1168} OutVars{main_~x~0=v_main_~x~0_1168} AuxVars[] AssignedVars[] [2021-05-02 23:57:56,663 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:57:56,665 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:56,686 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:57:56,736 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:57:56,781 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:56,784 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1170 1) 4294967296) 1000000) (< (mod v_main_~x~0_1170 4294967296) 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:57:56,786 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:57:56,788 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:56,792 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:56,845 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:57:56,854 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:57:56,910 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:57:56,943 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:57,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:57,006 INFO 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:00,464 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:00,464 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1669270525] [2021-05-02 23:58:00,464 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1669270525] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:00,464 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:00,464 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-02 23:58:00,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981332544] [2021-05-02 23:58:00,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-02 23:58:00,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:00,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-02 23:58:00,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2021-05-02 23:58:00,465 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand has 49 states, 49 states have (on average 2.836734693877551) internal successors, (139), 48 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-02 23:58:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:05,774 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2021-05-02 23:58:05,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-02 23:58:05,775 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.836734693877551) internal successors, (139), 48 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-02 23:58:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:05,776 INFO L225 Difference]: With dead ends: 157 [2021-05-02 23:58:05,776 INFO L226 Difference]: Without dead ends: 149 [2021-05-02 23:58:05,776 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 6 SyntacticMatches, 89 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 5584.2ms TimeCoverageRelationStatistics Valid=370, Invalid=8560, Unknown=0, NotChecked=0, Total=8930 [2021-05-02 23:58:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-05-02 23:58:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2021-05-02 23:58:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.013986013986014) internal successors, (145), 143 states have internal predecessors, (145), 3 states have call successors, (3), 3 states 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,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2021-05-02 23:58:05,794 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 143 [2021-05-02 23:58:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:05,794 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2021-05-02 23:58:05,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 2.836734693877551) internal successors, (139), 48 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-02 23:58:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2021-05-02 23:58:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-05-02 23:58:05,795 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:05,795 INFO L523 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:05,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-05-02 23:58:05,795 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:05,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:05,796 INFO L82 PathProgramCache]: Analyzing trace with hash -162524277, now seen corresponding path program 45 times [2021-05-02 23:58:05,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:05,796 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820308088] [2021-05-02 23:58:05,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:05,815 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1217 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1217} OutVars{main_~x~0=v_main_~x~0_1217} AuxVars[] AssignedVars[] [2021-05-02 23:58:05,817 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:58:05,835 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:05,850 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:58:05,870 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:58:05,909 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:05,911 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1219 1) 4294967296) 1000000) (< (mod v_main_~x~0_1219 4294967296) 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:05,913 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:58:05,914 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:05,917 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:06,152 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:58:06,176 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:58:06,182 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:58:06,250 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:58:06,283 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:06,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:58:13,912 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:13,912 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1820308088] [2021-05-02 23:58:13,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1820308088] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:13,913 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:13,913 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [94] imperfect sequences [] total 94 [2021-05-02 23:58:13,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992591947] [2021-05-02 23:58:13,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2021-05-02 23:58:13,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:13,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2021-05-02 23:58:13,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=8838, Unknown=0, NotChecked=0, Total=9120 [2021-05-02 23:58:13,914 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand has 94 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 93 states have internal predecessors, (142), 2 states have call successors, (3), 3 states 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,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:27,577 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2021-05-02 23:58:27,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-05-02 23:58:27,578 INFO L78 Accepts]: Start accepts. Automaton has has 94 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 93 states have internal predecessors, (142), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 146 [2021-05-02 23:58:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:27,579 INFO L225 Difference]: With dead ends: 159 [2021-05-02 23:58:27,579 INFO L226 Difference]: Without dead ends: 151 [2021-05-02 23:58:27,581 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 7 SyntacticMatches, 46 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4364 ImplicationChecksByTransitivity, 15249.9ms TimeCoverageRelationStatistics Valid=737, Invalid=34045, Unknown=0, NotChecked=0, Total=34782 [2021-05-02 23:58:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-05-02 23:58:27,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-05-02 23:58:27,608 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-02 23:58:27,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2021-05-02 23:58:27,608 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 146 [2021-05-02 23:58:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:27,609 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2021-05-02 23:58:27,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 94 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 93 states have internal predecessors, (142), 2 states have call successors, (3), 3 states 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,609 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2021-05-02 23:58:27,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-05-02 23:58:27,610 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:27,610 INFO L523 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:27,610 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-05-02 23:58:27,610 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:27,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:27,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1252200131, now seen corresponding path program 46 times [2021-05-02 23:58:27,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:27,611 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1728380517] [2021-05-02 23:58:27,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:27,618 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1267 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1267} OutVars{main_~x~0=v_main_~x~0_1267} AuxVars[] AssignedVars[] [2021-05-02 23:58:27,620 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:58:27,635 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 17 [2021-05-02 23:58:27,684 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:58:27,725 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:27,727 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1269 1) 4294967296) 1000000) (< (mod v_main_~x~0_1269 4294967296) 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:27,729 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:58:27,761 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:27,763 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:27,807 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:58:27,844 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:58:27,882 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:58:27,919 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:28,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:28,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:58:38,667 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:38,667 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1728380517] [2021-05-02 23:58:38,667 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1728380517] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:38,668 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:38,668 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2021-05-02 23:58:38,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879980301] [2021-05-02 23:58:38,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2021-05-02 23:58:38,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:38,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2021-05-02 23:58:38,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=9218, Unknown=0, NotChecked=0, Total=9506 [2021-05-02 23:58:38,670 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 96 states, 96 states have (on average 1.5104166666666667) internal successors, (145), 95 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-02 23:59:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:02,906 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2021-05-02 23:59:02,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-05-02 23:59:02,907 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.5104166666666667) internal successors, (145), 95 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-02 23:59:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:02,908 INFO L225 Difference]: With dead ends: 162 [2021-05-02 23:59:02,908 INFO L226 Difference]: Without dead ends: 154 [2021-05-02 23:59:02,910 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 7 SyntacticMatches, 47 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4553 ImplicationChecksByTransitivity, 23903.9ms TimeCoverageRelationStatistics Valid=753, Invalid=35537, Unknown=0, NotChecked=0, Total=36290 [2021-05-02 23:59:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-05-02 23:59:02,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-05-02 23:59:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.0134228187919463) internal successors, (151), 149 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:02,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2021-05-02 23:59:02,937 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 149 [2021-05-02 23:59:02,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:02,937 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2021-05-02 23:59:02,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 96 states, 96 states have (on average 1.5104166666666667) internal successors, (145), 95 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-02 23:59:02,938 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2021-05-02 23:59:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-05-02 23:59:02,938 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:02,939 INFO L523 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:02,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-05-02 23:59:02,939 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:02,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash 792963211, now seen corresponding path program 47 times [2021-05-02 23:59:02,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:02,940 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2052983032] [2021-05-02 23:59:02,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:02,953 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1318 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1318} OutVars{main_~x~0=v_main_~x~0_1318} AuxVars[] AssignedVars[] [2021-05-02 23:59:02,956 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:59:02,984 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:03,011 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:59:03,047 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:59:03,105 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:03,108 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1320 4294967296) 500000) (< (mod (+ v_main_~x~0_1320 1) 4294967296) 1000000)) 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:03,111 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:59:03,150 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:03,154 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:03,414 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:59:03,458 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:59:03,472 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:59:03,536 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:59:03,590 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:03,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:03,700 INFO 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:11,010 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:11,011 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2052983032] [2021-05-02 23:59:11,011 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2052983032] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:11,011 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:11,011 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-02 23:59:11,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050525930] [2021-05-02 23:59:11,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-02 23:59:11,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:11,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-02 23:59:11,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:59:11,012 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand has 52 states, 52 states have (on average 2.8461538461538463) internal successors, (148), 51 states have internal predecessors, (148), 2 states have call successors, (3), 3 states 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,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:18,982 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2021-05-02 23:59:18,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-02 23:59:18,983 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.8461538461538463) internal successors, (148), 51 states have internal predecessors, (148), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2021-05-02 23:59:18,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:18,984 INFO L225 Difference]: With dead ends: 166 [2021-05-02 23:59:18,984 INFO L226 Difference]: Without dead ends: 158 [2021-05-02 23:59:18,985 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 6 SyntacticMatches, 95 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 10331.8ms TimeCoverageRelationStatistics Valid=394, Invalid=9706, Unknown=0, NotChecked=0, Total=10100 [2021-05-02 23:59:18,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-05-02 23:59:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2021-05-02 23:59:19,005 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-02 23:59:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2021-05-02 23:59:19,006 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 152 [2021-05-02 23:59:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:19,006 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2021-05-02 23:59:19,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 2.8461538461538463) internal successors, (148), 51 states have internal predecessors, (148), 2 states have call successors, (3), 3 states 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:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2021-05-02 23:59:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-05-02 23:59:19,007 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:19,007 INFO L523 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:19,007 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-05-02 23:59:19,008 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:19,008 INFO L82 PathProgramCache]: Analyzing trace with hash -863282749, now seen corresponding path program 48 times [2021-05-02 23:59:19,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:19,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2074096847] [2021-05-02 23:59:19,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:19,016 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1370 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1370} OutVars{main_~x~0=v_main_~x~0_1370} AuxVars[] AssignedVars[] [2021-05-02 23:59:19,022 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:59:19,039 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:19,074 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:59:19,100 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:59:19,138 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:19,140 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1372 4294967296) 500000) (< (mod (+ v_main_~x~0_1372 1) 4294967296) 1000000)) 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:19,142 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:59:19,144 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:19,146 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:19,438 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:59:19,478 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:59:19,510 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:59:19,580 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:59:19,612 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:19,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:19,690 INFO 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:24,377 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:24,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2074096847] [2021-05-02 23:59:24,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2074096847] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:24,378 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:24,378 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-05-02 23:59:24,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710735913] [2021-05-02 23:59:24,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-05-02 23:59:24,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:24,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-05-02 23:59:24,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2021-05-02 23:59:24,379 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand has 53 states, 53 states have (on average 2.849056603773585) internal successors, (151), 52 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-02 23:59:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:30,998 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2021-05-02 23:59:30,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-02 23:59:30,999 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.849056603773585) internal successors, (151), 52 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-02 23:59:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:31,000 INFO L225 Difference]: With dead ends: 169 [2021-05-02 23:59:31,000 INFO L226 Difference]: Without dead ends: 161 [2021-05-02 23:59:31,001 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 6 SyntacticMatches, 97 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 7252.7ms TimeCoverageRelationStatistics Valid=402, Invalid=10104, Unknown=0, NotChecked=0, Total=10506 [2021-05-02 23:59:31,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-05-02 23:59:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2021-05-02 23:59:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.0129032258064516) internal successors, (157), 155 states have internal predecessors, (157), 3 states have call successors, (3), 3 states 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:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2021-05-02 23:59:31,025 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 155 [2021-05-02 23:59:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:31,025 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2021-05-02 23:59:31,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 2.849056603773585) internal successors, (151), 52 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-02 23:59:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2021-05-02 23:59:31,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-05-02 23:59:31,025 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:31,025 INFO L523 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:31,026 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-05-02 23:59:31,026 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:31,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:31,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1502380661, now seen corresponding path program 49 times [2021-05-02 23:59:31,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:31,026 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1702610734] [2021-05-02 23:59:31,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:31,036 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1423 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1423} OutVars{main_~x~0=v_main_~x~0_1423} AuxVars[] AssignedVars[] [2021-05-02 23:59:31,037 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:59:31,055 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:31,080 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:59:31,102 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:59:31,133 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:31,136 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1425 4294967296) 500000) (< (mod (+ v_main_~x~0_1425 1) 4294967296) 1000000)) 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:31,138 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:59:31,139 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:31,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:31,209 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:59:31,215 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:59:31,363 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2021-05-02 23:59:31,400 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:59:31,434 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:31,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:31,512 INFO 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:36,461 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:36,461 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1702610734] [2021-05-02 23:59:36,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1702610734] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:36,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:36,461 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-02 23:59:36,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144475145] [2021-05-02 23:59:36,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-02 23:59:36,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:36,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-02 23:59:36,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:59:36,463 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand has 54 states, 54 states have (on average 2.8518518518518516) internal successors, (154), 53 states have internal predecessors, (154), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:43,638 INFO L93 Difference]: Finished difference Result 172 states and 176 transitions. [2021-05-02 23:59:43,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-02 23:59:43,640 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.8518518518518516) internal successors, (154), 53 states have internal predecessors, (154), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 158 [2021-05-02 23:59:43,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:43,642 INFO L225 Difference]: With dead ends: 172 [2021-05-02 23:59:43,642 INFO L226 Difference]: Without dead ends: 164 [2021-05-02 23:59:43,643 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 6 SyntacticMatches, 99 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 7741.1ms TimeCoverageRelationStatistics Valid=410, Invalid=10510, Unknown=0, NotChecked=0, Total=10920 [2021-05-02 23:59:43,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-05-02 23:59:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2021-05-02 23:59:43,666 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-02 23:59:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2021-05-02 23:59:43,666 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 158 [2021-05-02 23:59:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:43,667 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2021-05-02 23:59:43,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 54 states have (on average 2.8518518518518516) internal successors, (154), 53 states have internal predecessors, (154), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:43,667 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2021-05-02 23:59:43,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-05-02 23:59:43,668 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:43,668 INFO L523 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:43,668 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-05-02 23:59:43,668 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:43,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:43,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1278253885, now seen corresponding path program 50 times [2021-05-02 23:59:43,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:43,669 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [723364521] [2021-05-02 23:59:43,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:43,686 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1477 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1477} OutVars{main_~x~0=v_main_~x~0_1477} AuxVars[] AssignedVars[] [2021-05-02 23:59:43,689 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-02 23:59:43,690 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:43,718 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:59:43,785 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-02 23:59:43,838 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:43,842 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1479 1) 4294967296) 1000000) (< (mod v_main_~x~0_1479 4294967296) 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:43,845 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-02 23:59:43,883 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:43,885 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:44,434 WARN L205 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:59:44,477 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:59:44,487 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:59:44,563 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-02 23:59:44,620 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:44,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:44,743 INFO 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:51,790 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:51,791 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [723364521] [2021-05-02 23:59:51,791 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [723364521] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:51,791 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:51,791 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-02 23:59:51,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184730425] [2021-05-02 23:59:51,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-02 23:59:51,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:51,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-02 23:59:51,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2021-05-02 23:59:51,792 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand has 55 states, 55 states have (on average 2.8545454545454545) internal successors, (157), 54 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:00:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:00:02,238 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2021-05-03 00:00:02,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-03 00:00:02,239 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.8545454545454545) internal successors, (157), 54 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:00:02,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:00:02,240 INFO L225 Difference]: With dead ends: 175 [2021-05-03 00:00:02,240 INFO L226 Difference]: Without dead ends: 167 [2021-05-03 00:00:02,241 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 6 SyntacticMatches, 101 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 10957.5ms TimeCoverageRelationStatistics Valid=418, Invalid=10924, Unknown=0, NotChecked=0, Total=11342 [2021-05-03 00:00:02,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-05-03 00:00:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2021-05-03 00:00:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.0124223602484472) internal successors, (163), 161 states have internal predecessors, (163), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2021-05-03 00:00:02,263 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 161 [2021-05-03 00:00:02,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:00:02,263 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2021-05-03 00:00:02,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 55 states, 55 states have (on average 2.8545454545454545) internal successors, (157), 54 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:00:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2021-05-03 00:00:02,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-05-03 00:00:02,264 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:00:02,264 INFO L523 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:00:02,265 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-05-03 00:00:02,265 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:00:02,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:00:02,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1303351947, now seen corresponding path program 51 times [2021-05-03 00:00:02,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:00:02,265 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1468582163] [2021-05-03 00:00:02,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:00:02,273 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1532 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1532} OutVars{main_~x~0=v_main_~x~0_1532} AuxVars[] AssignedVars[] [2021-05-03 00:00:02,277 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:00:02,298 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:02,321 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:00:02,355 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:00:02,427 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:02,430 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1534 1) 4294967296) 1000000) (< (mod v_main_~x~0_1534 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_1534} OutVars{main_~x~0=v_main_~x~0_1534} AuxVars[] AssignedVars[] [2021-05-03 00:00:02,433 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:00:02,473 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:02,476 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:02,537 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:00:02,547 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:00:02,593 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:00:02,640 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:02,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:00:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:02,743 INFO 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:16,436 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:00:16,436 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1468582163] [2021-05-03 00:00:16,436 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1468582163] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:00:16,436 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:00:16,437 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [106] imperfect sequences [] total 106 [2021-05-03 00:00:16,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302102538] [2021-05-03 00:00:16,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states [2021-05-03 00:00:16,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:00:16,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2021-05-03 00:00:16,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=11238, Unknown=0, NotChecked=0, Total=11556 [2021-05-03 00:00:16,438 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand has 106 states, 106 states have (on average 1.509433962264151) internal successors, (160), 105 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:00:42,357 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2021-05-03 00:00:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-05-03 00:00:42,358 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 106 states have (on average 1.509433962264151) internal successors, (160), 105 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 164 [2021-05-03 00:00:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:00:42,359 INFO L225 Difference]: With dead ends: 177 [2021-05-03 00:00:42,359 INFO L226 Difference]: Without dead ends: 169 [2021-05-03 00:00:42,361 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 7 SyntacticMatches, 52 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5558 ImplicationChecksByTransitivity, 27602.7ms TimeCoverageRelationStatistics Valid=833, Invalid=43477, Unknown=0, NotChecked=0, Total=44310 [2021-05-03 00:00:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-05-03 00:00:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-05-03 00:00:42,383 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:00:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2021-05-03 00:00:42,383 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2021-05-03 00:00:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:00:42,384 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2021-05-03 00:00:42,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 106 states, 106 states have (on average 1.509433962264151) internal successors, (160), 105 states have internal predecessors, (160), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2021-05-03 00:00:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-05-03 00:00:42,384 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:00:42,384 INFO L523 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:00:42,385 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-05-03 00:00:42,385 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:00:42,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:00:42,385 INFO L82 PathProgramCache]: Analyzing trace with hash -56676413, now seen corresponding path program 52 times [2021-05-03 00:00:42,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:00:42,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [539994620] [2021-05-03 00:00:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:00:42,409 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1588 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1588} OutVars{main_~x~0=v_main_~x~0_1588} AuxVars[] AssignedVars[] [2021-05-03 00:00:42,411 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:00:42,436 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:42,478 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:00:42,512 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:00:42,573 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:42,576 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1590 4294967296) 500000) (< (mod (+ v_main_~x~0_1590 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_1590} OutVars{main_~x~0=v_main_~x~0_1590} AuxVars[] AssignedVars[] [2021-05-03 00:00:42,579 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:00:42,581 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:42,583 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:42,651 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:00:42,666 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:00:42,779 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:00:42,845 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:42,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:00:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:42,935 INFO 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:56,020 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:00:56,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [539994620] [2021-05-03 00:00:56,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [539994620] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:00:56,021 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:00:56,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [108] imperfect sequences [] total 108 [2021-05-03 00:00:56,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195235612] [2021-05-03 00:00:56,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2021-05-03 00:00:56,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:00:56,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2021-05-03 00:00:56,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=11666, Unknown=0, NotChecked=0, Total=11990 [2021-05-03 00:00:56,023 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand has 108 states, 108 states have (on average 1.5092592592592593) internal successors, (163), 107 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:01:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:01:18,613 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2021-05-03 00:01:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-05-03 00:01:18,614 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 1.5092592592592593) internal successors, (163), 107 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:01:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:01:18,615 INFO L225 Difference]: With dead ends: 180 [2021-05-03 00:01:18,615 INFO L226 Difference]: Without dead ends: 172 [2021-05-03 00:01:18,617 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 7 SyntacticMatches, 53 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5771 ImplicationChecksByTransitivity, 25376.0ms TimeCoverageRelationStatistics Valid=849, Invalid=45161, Unknown=0, NotChecked=0, Total=46010 [2021-05-03 00:01:18,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-05-03 00:01:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2021-05-03 00:01:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.0119760479041917) internal successors, (169), 167 states have internal predecessors, (169), 3 states have call successors, (3), 3 states have call 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,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2021-05-03 00:01:18,640 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 167 [2021-05-03 00:01:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:01:18,640 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2021-05-03 00:01:18,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 108 states, 108 states have (on average 1.5092592592592593) internal successors, (163), 107 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:01:18,641 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2021-05-03 00:01:18,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-05-03 00:01:18,641 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:01:18,641 INFO L523 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:01:18,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-05-03 00:01:18,641 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:01:18,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:01:18,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2059921291, now seen corresponding path program 53 times [2021-05-03 00:01:18,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:01:18,642 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1767872521] [2021-05-03 00:01:18,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:01:18,649 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1645 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1645} OutVars{main_~x~0=v_main_~x~0_1645} AuxVars[] AssignedVars[] [2021-05-03 00:01:18,651 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:01:18,670 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:18,692 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:01:18,723 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:01:18,771 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:18,774 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1647 1) 4294967296) 1000000) (< (mod v_main_~x~0_1647 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_1647} OutVars{main_~x~0=v_main_~x~0_1647} AuxVars[] AssignedVars[] [2021-05-03 00:01:18,776 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:01:18,777 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:18,781 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:18,911 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:01:19,032 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:01:19,043 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:01:19,137 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:01:19,175 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:19,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:01:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:01:26,255 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:01:26,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1767872521] [2021-05-03 00:01:26,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1767872521] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:01:26,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:01:26,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-03 00:01:26,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388069230] [2021-05-03 00:01:26,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-03 00:01:26,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:01:26,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-03 00:01:26,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2021-05-03 00:01:26,257 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand has 58 states, 58 states have (on average 2.8620689655172415) internal successors, (166), 57 states have internal predecessors, (166), 2 states have call successors, (3), 3 states have call 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:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:01:36,140 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2021-05-03 00:01:36,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-03 00:01:36,142 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.8620689655172415) internal successors, (166), 57 states have internal predecessors, (166), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 170 [2021-05-03 00:01:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:01:36,142 INFO L225 Difference]: With dead ends: 184 [2021-05-03 00:01:36,142 INFO L226 Difference]: Without dead ends: 176 [2021-05-03 00:01:36,143 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 6 SyntacticMatches, 107 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 10657.9ms TimeCoverageRelationStatistics Valid=442, Invalid=12214, Unknown=0, NotChecked=0, Total=12656 [2021-05-03 00:01:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-05-03 00:01:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2021-05-03 00:01:36,165 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:01:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2021-05-03 00:01:36,166 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 170 [2021-05-03 00:01:36,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:01:36,166 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2021-05-03 00:01:36,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 58 states, 58 states have (on average 2.8620689655172415) internal successors, (166), 57 states have internal predecessors, (166), 2 states have call successors, (3), 3 states have call 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:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2021-05-03 00:01:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-05-03 00:01:36,167 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:01:36,167 INFO L523 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:01:36,167 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-05-03 00:01:36,167 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:01:36,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:01:36,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1087718717, now seen corresponding path program 54 times [2021-05-03 00:01:36,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:01:36,167 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1949839634] [2021-05-03 00:01:36,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:01:36,185 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1703 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1703} OutVars{main_~x~0=v_main_~x~0_1703} AuxVars[] AssignedVars[] [2021-05-03 00:01:36,187 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:01:36,213 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:36,249 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:01:36,286 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:01:36,351 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:36,355 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1705 4294967296) 500000) (< (mod (+ v_main_~x~0_1705 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_1705} OutVars{main_~x~0=v_main_~x~0_1705} AuxVars[] AssignedVars[] [2021-05-03 00:01:36,357 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:01:36,368 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:36,371 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:36,494 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:01:36,562 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:01:36,573 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:01:36,673 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:01:36,737 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:36,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:01:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:36,873 INFO 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:47,456 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:01:47,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1949839634] [2021-05-03 00:01:47,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1949839634] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:01:47,456 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:01:47,456 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [112] imperfect sequences [] total 112 [2021-05-03 00:01:47,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312102465] [2021-05-03 00:01:47,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 112 states [2021-05-03 00:01:47,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:01:47,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2021-05-03 00:01:47,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=12546, Unknown=0, NotChecked=0, Total=12882 [2021-05-03 00:01:47,458 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand has 112 states, 112 states have (on average 1.5089285714285714) internal successors, (169), 111 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:02:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:02:04,909 INFO L93 Difference]: Finished difference Result 186 states and 190 transitions. [2021-05-03 00:02:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2021-05-03 00:02:04,910 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 1.5089285714285714) internal successors, (169), 111 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:02:04,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:02:04,911 INFO L225 Difference]: With dead ends: 186 [2021-05-03 00:02:04,911 INFO L226 Difference]: Without dead ends: 178 [2021-05-03 00:02:04,914 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 7 SyntacticMatches, 55 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6209 ImplicationChecksByTransitivity, 19992.7ms TimeCoverageRelationStatistics Valid=881, Invalid=48625, Unknown=0, NotChecked=0, Total=49506 [2021-05-03 00:02:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-05-03 00:02:04,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2021-05-03 00:02:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 173 states have (on average 1.0115606936416186) internal successors, (175), 173 states have internal predecessors, (175), 3 states have call successors, (3), 3 states have call 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:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2021-05-03 00:02:04,937 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 173 [2021-05-03 00:02:04,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:02:04,937 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2021-05-03 00:02:04,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 112 states, 112 states have (on average 1.5089285714285714) internal successors, (169), 111 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:02:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2021-05-03 00:02:04,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-05-03 00:02:04,938 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:02:04,938 INFO L523 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:02:04,938 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-05-03 00:02:04,938 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:02:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:02:04,939 INFO L82 PathProgramCache]: Analyzing trace with hash -410223477, now seen corresponding path program 55 times [2021-05-03 00:02:04,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:02:04,939 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1293418514] [2021-05-03 00:02:04,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:02:04,945 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1762 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1762} OutVars{main_~x~0=v_main_~x~0_1762} AuxVars[] AssignedVars[] [2021-05-03 00:02:04,947 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:02:04,947 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:04,971 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:02:05,001 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:02:05,033 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:05,035 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1764 4294967296) 500000) (< (mod (+ v_main_~x~0_1764 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_1764} OutVars{main_~x~0=v_main_~x~0_1764} AuxVars[] AssignedVars[] [2021-05-03 00:02:05,036 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:02:05,059 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:05,061 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:05,133 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:02:05,140 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:02:05,177 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:02:05,207 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:05,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:02:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:05,310 INFO 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:10,359 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:02:10,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1293418514] [2021-05-03 00:02:10,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1293418514] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:02:10,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:02:10,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2021-05-03 00:02:10,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346448518] [2021-05-03 00:02:10,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2021-05-03 00:02:10,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:02:10,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-05-03 00:02:10,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2021-05-03 00:02:10,360 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand has 60 states, 60 states have (on average 2.8666666666666667) internal successors, (172), 59 states have internal predecessors, (172), 2 states have call successors, (3), 3 states have call 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:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:02:17,829 INFO L93 Difference]: Finished difference Result 190 states and 194 transitions. [2021-05-03 00:02:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-03 00:02:17,830 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.8666666666666667) internal successors, (172), 59 states have internal predecessors, (172), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 176 [2021-05-03 00:02:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:02:17,831 INFO L225 Difference]: With dead ends: 190 [2021-05-03 00:02:17,831 INFO L226 Difference]: Without dead ends: 182 [2021-05-03 00:02:17,832 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 6 SyntacticMatches, 111 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1869 ImplicationChecksByTransitivity, 7819.2ms TimeCoverageRelationStatistics Valid=458, Invalid=13114, Unknown=0, NotChecked=0, Total=13572 [2021-05-03 00:02:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-05-03 00:02:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2021-05-03 00:02:17,868 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:02:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2021-05-03 00:02:17,869 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 176 [2021-05-03 00:02:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:02:17,869 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2021-05-03 00:02:17,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 60 states, 60 states have (on average 2.8666666666666667) internal successors, (172), 59 states have internal predecessors, (172), 2 states have call successors, (3), 3 states have call 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:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2021-05-03 00:02:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-05-03 00:02:17,870 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:02:17,870 INFO L523 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:02:17,870 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-05-03 00:02:17,870 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:02:17,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:02:17,871 INFO L82 PathProgramCache]: Analyzing trace with hash 799147459, now seen corresponding path program 56 times [2021-05-03 00:02:17,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:02:17,871 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [195786861] [2021-05-03 00:02:17,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:02:17,878 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1822 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1822} OutVars{main_~x~0=v_main_~x~0_1822} AuxVars[] AssignedVars[] [2021-05-03 00:02:17,880 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:02:17,882 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:17,907 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:02:17,952 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:02:17,993 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:17,995 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1824 1) 4294967296) 1000000) (< (mod v_main_~x~0_1824 4294967296) 500000)) InVars {main_~x~0=v_main_~x~0_1824} OutVars{main_~x~0=v_main_~x~0_1824} AuxVars[] AssignedVars[] [2021-05-03 00:02:17,997 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:02:17,999 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:18,000 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:20,161 WARN L205 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:02:20,190 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:02:20,196 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:02:20,257 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:02:20,288 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:20,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:02:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:20,382 INFO 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:31,381 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:02:31,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [195786861] [2021-05-03 00:02:31,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [195786861] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:02:31,382 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:02:31,382 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [116] imperfect sequences [] total 116 [2021-05-03 00:02:31,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589411210] [2021-05-03 00:02:31,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states [2021-05-03 00:02:31,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:02:31,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2021-05-03 00:02:31,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=13458, Unknown=0, NotChecked=0, Total=13806 [2021-05-03 00:02:31,383 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand has 116 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 115 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:02:50,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:02:50,202 INFO L93 Difference]: Finished difference Result 192 states and 196 transitions. [2021-05-03 00:02:50,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2021-05-03 00:02:50,203 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 115 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:02:50,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:02:50,203 INFO L225 Difference]: With dead ends: 192 [2021-05-03 00:02:50,204 INFO L226 Difference]: Without dead ends: 184 [2021-05-03 00:02:50,206 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 7 SyntacticMatches, 57 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6663 ImplicationChecksByTransitivity, 21014.1ms TimeCoverageRelationStatistics Valid=913, Invalid=52217, Unknown=0, NotChecked=0, Total=53130 [2021-05-03 00:02:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-05-03 00:02:50,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2021-05-03 00:02:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 179 states have (on average 1.011173184357542) internal successors, (181), 179 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2021-05-03 00:02:50,237 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 179 [2021-05-03 00:02:50,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:02:50,237 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2021-05-03 00:02:50,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 116 states, 116 states have (on average 1.5086206896551724) internal successors, (175), 115 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:02:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2021-05-03 00:02:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-05-03 00:02:50,238 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:02:50,238 INFO L523 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:02:50,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-05-03 00:02:50,239 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:02:50,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:02:50,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1311944309, now seen corresponding path program 57 times [2021-05-03 00:02:50,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:02:50,239 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [404666779] [2021-05-03 00:02:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:02:50,246 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1883 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1883} OutVars{main_~x~0=v_main_~x~0_1883} AuxVars[] AssignedVars[] [2021-05-03 00:02:50,247 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:02:50,248 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:50,271 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:02:50,313 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:02:50,348 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:50,350 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1885 4294967296) 500000) (< (mod (+ v_main_~x~0_1885 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_1885} OutVars{main_~x~0=v_main_~x~0_1885} AuxVars[] AssignedVars[] [2021-05-03 00:02:50,352 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:02:50,353 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:50,354 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:50,427 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:02:50,433 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:02:50,503 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:02:50,536 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:50,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:02:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:50,600 INFO 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:56,076 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:02:56,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [404666779] [2021-05-03 00:02:56,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [404666779] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:02:56,077 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:02:56,077 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2021-05-03 00:02:56,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162373479] [2021-05-03 00:02:56,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2021-05-03 00:02:56,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:02:56,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-05-03 00:02:56,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2021-05-03 00:02:56,078 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand has 62 states, 62 states have (on average 2.870967741935484) internal successors, (178), 61 states have internal predecessors, (178), 2 states have call successors, (3), 3 states have call 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:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:04,117 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2021-05-03 00:03:04,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-05-03 00:03:04,117 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.870967741935484) internal successors, (178), 61 states have internal predecessors, (178), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 182 [2021-05-03 00:03:04,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:04,118 INFO L225 Difference]: With dead ends: 196 [2021-05-03 00:03:04,118 INFO L226 Difference]: Without dead ends: 188 [2021-05-03 00:03:04,119 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 6 SyntacticMatches, 115 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 8395.8ms TimeCoverageRelationStatistics Valid=474, Invalid=14046, Unknown=0, NotChecked=0, Total=14520 [2021-05-03 00:03:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-05-03 00:03:04,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2021-05-03 00:03:04,145 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:03:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2021-05-03 00:03:04,145 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 182 [2021-05-03 00:03:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:04,145 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2021-05-03 00:03:04,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 62 states, 62 states have (on average 2.870967741935484) internal successors, (178), 61 states have internal predecessors, (178), 2 states have call successors, (3), 3 states have call 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:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2021-05-03 00:03:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-05-03 00:03:04,146 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:04,147 INFO L523 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:04,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-05-03 00:03:04,147 INFO L428 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:04,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:04,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1640689469, now seen corresponding path program 58 times [2021-05-03 00:03:04,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:04,147 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1578532954] [2021-05-03 00:03:04,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:04,156 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1945 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_1945} OutVars{main_~x~0=v_main_~x~0_1945} AuxVars[] AssignedVars[] [2021-05-03 00:03:04,157 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:03:04,172 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:04,189 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:03:04,206 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:03:04,240 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:04,242 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1947 4294967296) 500000) (< (mod (+ v_main_~x~0_1947 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_1947} OutVars{main_~x~0=v_main_~x~0_1947} AuxVars[] AssignedVars[] [2021-05-03 00:03:04,244 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:03:04,266 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:04,276 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:04,315 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:03:04,319 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:03:04,347 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:03:04,382 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:04,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:04,446 INFO 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:10,359 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:10,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1578532954] [2021-05-03 00:03:10,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1578532954] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:10,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:10,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2021-05-03 00:03:10,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607145938] [2021-05-03 00:03:10,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2021-05-03 00:03:10,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:10,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-05-03 00:03:10,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2021-05-03 00:03:10,360 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand has 63 states, 63 states have (on average 2.873015873015873) internal successors, (181), 62 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:03:18,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:18,802 INFO L93 Difference]: Finished difference Result 199 states and 203 transitions. [2021-05-03 00:03:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-05-03 00:03:18,803 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.873015873015873) internal successors, (181), 62 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:03:18,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:18,804 INFO L225 Difference]: With dead ends: 199 [2021-05-03 00:03:18,804 INFO L226 Difference]: Without dead ends: 191 [2021-05-03 00:03:18,805 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 6 SyntacticMatches, 117 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 8964.9ms TimeCoverageRelationStatistics Valid=482, Invalid=14524, Unknown=0, NotChecked=0, Total=15006 [2021-05-03 00:03:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-05-03 00:03:18,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2021-05-03 00:03:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 185 states have (on average 1.0108108108108107) internal successors, (187), 185 states have internal predecessors, (187), 3 states have call successors, (3), 3 states have call 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:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2021-05-03 00:03:18,839 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 185 [2021-05-03 00:03:18,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:18,844 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2021-05-03 00:03:18,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 63 states, 63 states have (on average 2.873015873015873) internal successors, (181), 62 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:03:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2021-05-03 00:03:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-05-03 00:03:18,845 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:18,845 INFO L523 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:18,845 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-05-03 00:03:18,845 INFO L428 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:18,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1532651147, now seen corresponding path program 59 times [2021-05-03 00:03:18,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:18,846 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1732666294] [2021-05-03 00:03:18,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:18,852 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2008 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_2008} OutVars{main_~x~0=v_main_~x~0_2008} AuxVars[] AssignedVars[] [2021-05-03 00:03:18,853 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:03:18,867 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:18,887 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:03:18,907 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:03:18,936 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:18,938 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2010 4294967296) 500000) (< (mod (+ v_main_~x~0_2010 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_2010} OutVars{main_~x~0=v_main_~x~0_2010} AuxVars[] AssignedVars[] [2021-05-03 00:03:18,940 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:03:18,960 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:18,963 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:19,008 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:03:19,028 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:03:19,087 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:03:19,118 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:19,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:03:25,211 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:25,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1732666294] [2021-05-03 00:03:25,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1732666294] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:25,211 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:25,211 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2021-05-03 00:03:25,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388998385] [2021-05-03 00:03:25,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-03 00:03:25,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:25,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-03 00:03:25,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:03:25,212 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand has 64 states, 64 states have (on average 2.875) internal successors, (184), 63 states have internal predecessors, (184), 2 states have call successors, (3), 3 states have call 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:34,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:34,142 INFO L93 Difference]: Finished difference Result 202 states and 206 transitions. [2021-05-03 00:03:34,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-05-03 00:03:34,147 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.875) internal successors, (184), 63 states have internal predecessors, (184), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 188 [2021-05-03 00:03:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:34,148 INFO L225 Difference]: With dead ends: 202 [2021-05-03 00:03:34,148 INFO L226 Difference]: Without dead ends: 194 [2021-05-03 00:03:34,149 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 6 SyntacticMatches, 119 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2123 ImplicationChecksByTransitivity, 9264.4ms TimeCoverageRelationStatistics Valid=490, Invalid=15010, Unknown=0, NotChecked=0, Total=15500 [2021-05-03 00:03:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-05-03 00:03:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2021-05-03 00:03:34,175 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:03:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2021-05-03 00:03:34,176 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 188 [2021-05-03 00:03:34,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:34,176 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2021-05-03 00:03:34,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 64 states have (on average 2.875) internal successors, (184), 63 states have internal predecessors, (184), 2 states have call successors, (3), 3 states have call 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:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2021-05-03 00:03:34,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-05-03 00:03:34,177 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:34,177 INFO L523 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:34,177 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-05-03 00:03:34,177 INFO L428 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:34,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:34,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1997790147, now seen corresponding path program 60 times [2021-05-03 00:03:34,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:34,178 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1957175171] [2021-05-03 00:03:34,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:34,185 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2072 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_2072} OutVars{main_~x~0=v_main_~x~0_2072} AuxVars[] AssignedVars[] [2021-05-03 00:03:34,186 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:03:34,187 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:34,221 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:03:34,256 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:03:34,286 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:34,289 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2074 1) 4294967296) 1000000) (< (mod v_main_~x~0_2074 4294967296) 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:03:34,291 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:03:34,313 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:34,315 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:34,489 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:03:34,530 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:03:34,535 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:03:34,581 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:03:34,618 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:34,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:34,691 INFO 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:41,082 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:41,082 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1957175171] [2021-05-03 00:03:41,082 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1957175171] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:41,082 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:41,082 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2021-05-03 00:03:41,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587786565] [2021-05-03 00:03:41,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-05-03 00:03:41,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:41,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-05-03 00:03:41,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2021-05-03 00:03:41,083 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand has 65 states, 65 states have (on average 2.876923076923077) internal successors, (187), 64 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:03:50,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:50,315 INFO L93 Difference]: Finished difference Result 205 states and 209 transitions. [2021-05-03 00:03:50,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-05-03 00:03:50,315 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.876923076923077) internal successors, (187), 64 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:03:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:50,316 INFO L225 Difference]: With dead ends: 205 [2021-05-03 00:03:50,316 INFO L226 Difference]: Without dead ends: 197 [2021-05-03 00:03:50,317 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 6 SyntacticMatches, 121 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 9689.6ms TimeCoverageRelationStatistics Valid=498, Invalid=15504, Unknown=0, NotChecked=0, Total=16002 [2021-05-03 00:03:50,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-05-03 00:03:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2021-05-03 00:03:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 191 states have (on average 1.0104712041884816) internal successors, (193), 191 states have internal predecessors, (193), 3 states have call successors, (3), 3 states have call 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:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2021-05-03 00:03:50,351 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 191 [2021-05-03 00:03:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:50,352 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2021-05-03 00:03:50,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 65 states, 65 states have (on average 2.876923076923077) internal successors, (187), 64 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:03:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2021-05-03 00:03:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-05-03 00:03:50,353 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:50,353 INFO L523 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:50,353 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-05-03 00:03:50,353 INFO L428 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:50,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:50,353 INFO L82 PathProgramCache]: Analyzing trace with hash -905725045, now seen corresponding path program 61 times [2021-05-03 00:03:50,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:50,353 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [805668106] [2021-05-03 00:03:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:50,361 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2137 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_2137} OutVars{main_~x~0=v_main_~x~0_2137} AuxVars[] AssignedVars[] [2021-05-03 00:03:50,362 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:03:50,363 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:50,389 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:03:50,426 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:03:50,463 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:50,465 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2139 1) 4294967296) 1000000) (< (mod v_main_~x~0_2139 4294967296) 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:03:50,466 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:03:50,467 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:50,469 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:50,626 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:03:50,629 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:03:50,637 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:03:50,706 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:03:50,742 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:50,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:03:57,583 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:57,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [805668106] [2021-05-03 00:03:57,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [805668106] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:57,583 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:57,584 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2021-05-03 00:03:57,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617542609] [2021-05-03 00:03:57,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2021-05-03 00:03:57,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:57,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-05-03 00:03:57,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2021-05-03 00:03:57,585 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand has 66 states, 66 states have (on average 2.878787878787879) internal successors, (190), 65 states have internal predecessors, (190), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:07,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:07,372 INFO L93 Difference]: Finished difference Result 208 states and 212 transitions. [2021-05-03 00:04:07,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-05-03 00:04:07,373 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.878787878787879) internal successors, (190), 65 states have internal predecessors, (190), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 194 [2021-05-03 00:04:07,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:07,374 INFO L225 Difference]: With dead ends: 208 [2021-05-03 00:04:07,374 INFO L226 Difference]: Without dead ends: 200 [2021-05-03 00:04:07,375 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 6 SyntacticMatches, 123 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 10234.1ms TimeCoverageRelationStatistics Valid=506, Invalid=16006, Unknown=0, NotChecked=0, Total=16512 [2021-05-03 00:04:07,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-05-03 00:04:07,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2021-05-03 00:04:07,414 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:04:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2021-05-03 00:04:07,414 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 194 [2021-05-03 00:04:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:07,415 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2021-05-03 00:04:07,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 66 states, 66 states have (on average 2.878787878787879) internal successors, (190), 65 states have internal predecessors, (190), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2021-05-03 00:04:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2021-05-03 00:04:07,416 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:07,416 INFO L523 BasicCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:07,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-05-03 00:04:07,416 INFO L428 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:07,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:07,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1114531523, now seen corresponding path program 62 times [2021-05-03 00:04:07,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:07,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1612317926] [2021-05-03 00:04:07,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:07,424 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2203 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_2203} OutVars{main_~x~0=v_main_~x~0_2203} AuxVars[] AssignedVars[] [2021-05-03 00:04:07,426 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:04:07,427 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:07,447 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:04:07,494 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:04:07,531 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:07,533 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2205 1) 4294967296) 1000000) (< (mod v_main_~x~0_2205 4294967296) 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:04:07,535 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:04:07,556 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:07,558 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:09,756 WARN L205 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:04:09,787 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:04:09,795 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:04:09,833 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:04:09,865 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:09,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:09,937 INFO 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:16,835 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:16,835 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1612317926] [2021-05-03 00:04:16,835 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1612317926] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:16,835 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:16,835 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2021-05-03 00:04:16,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291236295] [2021-05-03 00:04:16,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2021-05-03 00:04:16,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:16,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-05-03 00:04:16,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2021-05-03 00:04:16,836 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand has 67 states, 67 states have (on average 2.8805970149253732) internal successors, (193), 66 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:04:27,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:27,416 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2021-05-03 00:04:27,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-05-03 00:04:27,417 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.8805970149253732) internal successors, (193), 66 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:04:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:27,418 INFO L225 Difference]: With dead ends: 211 [2021-05-03 00:04:27,418 INFO L226 Difference]: Without dead ends: 203 [2021-05-03 00:04:27,419 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 6 SyntacticMatches, 125 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 10622.0ms TimeCoverageRelationStatistics Valid=514, Invalid=16516, Unknown=0, NotChecked=0, Total=17030 [2021-05-03 00:04:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-05-03 00:04:27,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2021-05-03 00:04:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.0101522842639594) internal successors, (199), 197 states have internal predecessors, (199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2021-05-03 00:04:27,453 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 197 [2021-05-03 00:04:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:27,453 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2021-05-03 00:04:27,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 67 states, 67 states have (on average 2.8805970149253732) internal successors, (193), 66 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:04:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2021-05-03 00:04:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-05-03 00:04:27,454 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:27,454 INFO L523 BasicCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:27,454 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-05-03 00:04:27,454 INFO L428 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:27,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:27,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1201229963, now seen corresponding path program 63 times [2021-05-03 00:04:27,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:27,455 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2055994849] [2021-05-03 00:04:27,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:27,465 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2270 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_2270} OutVars{main_~x~0=v_main_~x~0_2270} AuxVars[] AssignedVars[] [2021-05-03 00:04:27,467 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:04:27,482 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:27,499 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:04:27,523 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:04:27,558 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:27,560 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2272 1) 4294967296) 1000000) (< (mod v_main_~x~0_2272 4294967296) 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:04:27,562 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:04:27,563 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:27,564 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:27,674 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:04:27,748 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:04:27,753 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:04:27,809 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:04:27,852 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:27,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:27,934 INFO 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:35,082 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:35,082 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2055994849] [2021-05-03 00:04:35,082 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2055994849] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:35,083 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:35,083 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2021-05-03 00:04:35,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852533805] [2021-05-03 00:04:35,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2021-05-03 00:04:35,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:35,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-05-03 00:04:35,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2021-05-03 00:04:35,084 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand has 68 states, 68 states have (on average 2.8823529411764706) internal successors, (196), 67 states have internal predecessors, (196), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:45,620 INFO L93 Difference]: Finished difference Result 214 states and 218 transitions. [2021-05-03 00:04:45,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-05-03 00:04:45,621 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.8823529411764706) internal successors, (196), 67 states have internal predecessors, (196), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 200 [2021-05-03 00:04:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:45,622 INFO L225 Difference]: With dead ends: 214 [2021-05-03 00:04:45,622 INFO L226 Difference]: Without dead ends: 206 [2021-05-03 00:04:45,623 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 6 SyntacticMatches, 127 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2393 ImplicationChecksByTransitivity, 10873.8ms TimeCoverageRelationStatistics Valid=522, Invalid=17034, Unknown=0, NotChecked=0, Total=17556 [2021-05-03 00:04:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-05-03 00:04:45,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2021-05-03 00:04:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.01) internal successors, (202), 200 states have internal predecessors, (202), 3 states have call successors, (3), 3 states have call 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:45,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2021-05-03 00:04:45,650 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 200 [2021-05-03 00:04:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:45,650 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2021-05-03 00:04:45,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 68 states, 68 states have (on average 2.8823529411764706) internal successors, (196), 67 states have internal predecessors, (196), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2021-05-03 00:04:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2021-05-03 00:04:45,651 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:45,651 INFO L523 BasicCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:45,652 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-05-03 00:04:45,652 INFO L428 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:45,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:45,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1535856189, now seen corresponding path program 64 times [2021-05-03 00:04:45,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:45,652 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [754210112] [2021-05-03 00:04:45,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:45,663 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2338 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_2338} OutVars{main_~x~0=v_main_~x~0_2338} AuxVars[] AssignedVars[] [2021-05-03 00:04:45,664 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:04:45,679 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:45,695 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:04:45,713 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:04:45,759 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:45,761 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2340 4294967296) 500000) (< (mod (+ v_main_~x~0_2340 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_2340} OutVars{main_~x~0=v_main_~x~0_2340} AuxVars[] AssignedVars[] [2021-05-03 00:04:45,763 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:04:45,764 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:45,766 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:45,833 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:04:45,847 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:04:45,905 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:04:45,939 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:46,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:46,038 INFO 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:53,517 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:53,518 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [754210112] [2021-05-03 00:04:53,518 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [754210112] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:53,518 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:53,518 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2021-05-03 00:04:53,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353418980] [2021-05-03 00:04:53,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2021-05-03 00:04:53,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:53,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-05-03 00:04:53,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2021-05-03 00:04:53,519 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand has 69 states, 69 states have (on average 2.8840579710144927) internal successors, (199), 68 states have internal predecessors, (199), 2 states have call successors, (3), 3 states have call 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:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:05,074 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2021-05-03 00:05:05,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-05-03 00:05:05,075 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.8840579710144927) internal successors, (199), 68 states have internal predecessors, (199), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 203 [2021-05-03 00:05:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:05,076 INFO L225 Difference]: With dead ends: 217 [2021-05-03 00:05:05,076 INFO L226 Difference]: Without dead ends: 209 [2021-05-03 00:05:05,077 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 6 SyntacticMatches, 129 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2463 ImplicationChecksByTransitivity, 11569.7ms TimeCoverageRelationStatistics Valid=530, Invalid=17560, Unknown=0, NotChecked=0, Total=18090 [2021-05-03 00:05:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-05-03 00:05:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2021-05-03 00:05:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.0098522167487685) internal successors, (205), 203 states have internal predecessors, (205), 3 states have call successors, (3), 3 states have call 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:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2021-05-03 00:05:05,123 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 203 [2021-05-03 00:05:05,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:05,123 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2021-05-03 00:05:05,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 69 states, 69 states have (on average 2.8840579710144927) internal successors, (199), 68 states have internal predecessors, (199), 2 states have call successors, (3), 3 states have call 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:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2021-05-03 00:05:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2021-05-03 00:05:05,124 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:05,125 INFO L523 BasicCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:05,125 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-05-03 00:05:05,125 INFO L428 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:05,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2115295861, now seen corresponding path program 65 times [2021-05-03 00:05:05,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:05,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1411905661] [2021-05-03 00:05:05,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:05,140 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2407 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_2407} OutVars{main_~x~0=v_main_~x~0_2407} AuxVars[] AssignedVars[] [2021-05-03 00:05:05,142 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:05:05,147 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:05,163 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:05:05,202 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:05:05,235 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:05,238 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2409 4294967296) 500000) (< (mod (+ v_main_~x~0_2409 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_2409} OutVars{main_~x~0=v_main_~x~0_2409} AuxVars[] AssignedVars[] [2021-05-03 00:05:05,240 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:05:05,263 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:05,266 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:07,286 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:05:07,441 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:05:07,465 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:05:07,470 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:05:07,513 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:05:07,552 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:07,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:07,633 INFO 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:15,924 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:15,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1411905661] [2021-05-03 00:05:15,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1411905661] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:15,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:15,925 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2021-05-03 00:05:15,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130981948] [2021-05-03 00:05:15,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2021-05-03 00:05:15,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:15,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-05-03 00:05:15,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:05:15,926 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand has 70 states, 70 states have (on average 2.8857142857142857) internal successors, (202), 69 states have internal predecessors, (202), 2 states have call successors, (3), 3 states have call 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:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:28,266 INFO L93 Difference]: Finished difference Result 220 states and 224 transitions. [2021-05-03 00:05:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-05-03 00:05:28,268 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.8857142857142857) internal successors, (202), 69 states have internal predecessors, (202), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 206 [2021-05-03 00:05:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:28,268 INFO L225 Difference]: With dead ends: 220 [2021-05-03 00:05:28,268 INFO L226 Difference]: Without dead ends: 212 [2021-05-03 00:05:28,269 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 6 SyntacticMatches, 131 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2534 ImplicationChecksByTransitivity, 12504.6ms TimeCoverageRelationStatistics Valid=538, Invalid=18094, Unknown=0, NotChecked=0, Total=18632 [2021-05-03 00:05:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-05-03 00:05:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2021-05-03 00:05:28,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.0097087378640777) internal successors, (208), 206 states have internal predecessors, (208), 3 states have call successors, (3), 3 states have call 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:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2021-05-03 00:05:28,298 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 206 [2021-05-03 00:05:28,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:28,298 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2021-05-03 00:05:28,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 70 states, 70 states have (on average 2.8857142857142857) internal successors, (202), 69 states have internal predecessors, (202), 2 states have call successors, (3), 3 states have call 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:28,298 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2021-05-03 00:05:28,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-05-03 00:05:28,299 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:28,299 INFO L523 BasicCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:28,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-05-03 00:05:28,299 INFO L428 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:28,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:28,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1565965507, now seen corresponding path program 66 times [2021-05-03 00:05:28,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:28,300 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [666410401] [2021-05-03 00:05:28,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:28,312 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2477 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_2477} OutVars{main_~x~0=v_main_~x~0_2477} AuxVars[] AssignedVars[] [2021-05-03 00:05:28,314 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:05:28,315 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:28,337 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:05:28,384 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:05:28,419 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:28,421 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2479 4294967296) 500000) (< (mod (+ v_main_~x~0_2479 1) 4294967296) 1000000)) InVars {main_~x~0=v_main_~x~0_2479} OutVars{main_~x~0=v_main_~x~0_2479} AuxVars[] AssignedVars[] [2021-05-03 00:05:28,423 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:05:28,424 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:28,425 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:28,970 WARN L205 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:05:29,007 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:05:29,013 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:05:29,085 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:05:29,122 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:29,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:05:37,868 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:37,868 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [666410401] [2021-05-03 00:05:37,868 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [666410401] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:37,868 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:37,868 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2021-05-03 00:05:37,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551772814] [2021-05-03 00:05:37,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2021-05-03 00:05:37,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:37,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-05-03 00:05:37,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2021-05-03 00:05:37,869 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 70 states have internal predecessors, (205), 2 states have call successors, (3), 3 states have call 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:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:50,734 INFO L93 Difference]: Finished difference Result 223 states and 227 transitions. [2021-05-03 00:05:50,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-05-03 00:05:50,735 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 70 states have internal predecessors, (205), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 209 [2021-05-03 00:05:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:50,736 INFO L225 Difference]: With dead ends: 223 [2021-05-03 00:05:50,736 INFO L226 Difference]: Without dead ends: 215 [2021-05-03 00:05:50,737 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 6 SyntacticMatches, 133 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2606 ImplicationChecksByTransitivity, 13084.4ms TimeCoverageRelationStatistics Valid=546, Invalid=18636, Unknown=0, NotChecked=0, Total=19182 [2021-05-03 00:05:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-05-03 00:05:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2021-05-03 00:05:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 209 states have (on average 1.0095693779904307) internal successors, (211), 209 states have internal predecessors, (211), 3 states have call successors, (3), 3 states have call 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:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2021-05-03 00:05:50,781 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 209 [2021-05-03 00:05:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:50,782 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 215 transitions. [2021-05-03 00:05:50,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 71 states, 71 states have (on average 2.887323943661972) internal successors, (205), 70 states have internal predecessors, (205), 2 states have call successors, (3), 3 states have call 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:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2021-05-03 00:05:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-05-03 00:05:50,783 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:50,783 INFO L523 BasicCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:50,783 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-05-03 00:05:50,783 INFO L428 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:50,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:50,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1966523765, now seen corresponding path program 67 times [2021-05-03 00:05:50,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:50,783 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1548490244] [2021-05-03 00:05:50,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:50,791 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2548 4294967296) 500000) InVars {main_~x~0=v_main_~x~0_2548} OutVars{main_~x~0=v_main_~x~0_2548} AuxVars[] AssignedVars[] [2021-05-03 00:05:50,792 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size [2021-05-03 00:05:50,810 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:50,829 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:05:50,854 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 94.3 percent of original size 66 [2021-05-03 00:05:50,890 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:50,892 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2550 1) 4294967296) 1000000) (< (mod v_main_~x~0_2550 4294967296) 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:05:50,894 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size [2021-05-03 00:05:50,916 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:50,918 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:50,982 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:05:50,993 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:05:51,030 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 94.3 percent of original size 99 [2021-05-03 00:05:51,067 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:51,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:00,111 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:00,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1548490244] [2021-05-03 00:06:00,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1548490244] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:00,112 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:00,112 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2021-05-03 00:06:00,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109925674] [2021-05-03 00:06:00,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2021-05-03 00:06:00,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:00,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-05-03 00:06:00,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2021-05-03 00:06:00,113 INFO L87 Difference]: Start difference. First operand 214 states and 215 transitions. Second operand has 72 states, 72 states have (on average 2.888888888888889) internal successors, (208), 71 states have internal predecessors, (208), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)