/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:04:47,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:04:47,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:04:47,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:04:47,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:04:47,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:04:47,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:04:47,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:04:47,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:04:47,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:04:47,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:04:47,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:04:47,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:04:47,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:04:47,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:04:47,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:04:47,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:04:47,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:04:47,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:04:47,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:04:47,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:04:47,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:04:47,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:04:47,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:04:47,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:04:47,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:04:47,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:04:47,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:04:47,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:04:47,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:04:47,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:04:47,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:04:47,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:04:47,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:04:47,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:04:47,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:04:47,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:04:47,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:04:47,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:04:47,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:04:47,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:04:47,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-03 00:04:47,419 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:04:47,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:04:47,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:04:47,421 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:04:47,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:04:47,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:04:47,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:04:47,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:04:47,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:04:47,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:04:47,422 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:04:47,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:04:47,422 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:04:47,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:04:47,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:04:47,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:04:47,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:04:47,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:04:47,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:04:47,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:04:47,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:04:47,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:04:47,424 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:04:47,424 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-03 00:04:47,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:04:47,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:04:47,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:04:47,690 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:04:47,691 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:04:47,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c [2021-05-03 00:04:47,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feaadd399/cf1041cf832c4411a1dc0becfd749748/FLAG652490fb9 [2021-05-03 00:04:48,026 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:04:48,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c [2021-05-03 00:04:48,033 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feaadd399/cf1041cf832c4411a1dc0becfd749748/FLAG652490fb9 [2021-05-03 00:04:48,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feaadd399/cf1041cf832c4411a1dc0becfd749748 [2021-05-03 00:04:48,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:04:48,472 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:04:48,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:04:48,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:04:48,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:04:48,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:04:48" (1/1) ... [2021-05-03 00:04:48,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8357d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:04:48, skipping insertion in model container [2021-05-03 00:04:48,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:04:48" (1/1) ... [2021-05-03 00:04:48,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:04:48,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:04:48,568 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c[319,332] [2021-05-03 00:04:48,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:04:48,580 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:04:48,588 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_10.c[319,332] [2021-05-03 00:04:48,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:04:48,598 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:04:48,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:04:48 WrapperNode [2021-05-03 00:04:48,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:04:48,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:04:48,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:04:48,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:04:48,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:04:48" (1/1) ... [2021-05-03 00:04:48,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:04:48" (1/1) ... [2021-05-03 00:04:48,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:04:48" (1/1) ... [2021-05-03 00:04:48,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:04:48" (1/1) ... [2021-05-03 00:04:48,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:04:48" (1/1) ... [2021-05-03 00:04:48,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:04:48" (1/1) ... [2021-05-03 00:04:48,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:04:48" (1/1) ... [2021-05-03 00:04:48,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:04:48,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:04:48,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:04:48,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:04:48,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:04:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:04:48,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:04:48,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:04:48,704 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:04:48,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-03 00:04:48,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:04:48,704 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-03 00:04:48,704 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:04:48,704 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:04:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:04:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-03 00:04:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:04:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:04:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:04:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:04:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:04:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:04:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:04:48,917 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:04:48,917 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-03 00:04:48,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:04:48 BoogieIcfgContainer [2021-05-03 00:04:48,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:04:48,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:04:48,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:04:48,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:04:48,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:04:48" (1/3) ... [2021-05-03 00:04:48,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c60fa86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:04:48, skipping insertion in model container [2021-05-03 00:04:48,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:04:48" (2/3) ... [2021-05-03 00:04:48,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c60fa86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:04:48, skipping insertion in model container [2021-05-03 00:04:48,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:04:48" (3/3) ... [2021-05-03 00:04:48,923 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_10.c [2021-05-03 00:04:48,927 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:04:48,929 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:04:48,939 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:04:48,958 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:04:48,959 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:04:48,959 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:04:48,959 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:04:48,959 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:04:48,959 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:04:48,959 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:04:48,959 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:04:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-03 00:04:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-03 00:04:48,976 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:48,976 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:48,976 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:48,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:48,980 INFO L82 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 1 times [2021-05-03 00:04:48,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:48,985 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [207958320] [2021-05-03 00:04:48,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:49,025 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:04:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:49,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:49,137 INFO L134 CoverageAnalysis]: 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:49,138 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:49,139 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [207958320] [2021-05-03 00:04:49,140 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [207958320] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:49,140 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:49,140 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-03 00:04:49,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024561900] [2021-05-03 00:04:49,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-03 00:04:49,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:49,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-03 00:04:49,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:04:49,152 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:49,226 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-05-03 00:04:49,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-03 00:04:49,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-03 00:04:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:49,232 INFO L225 Difference]: With dead ends: 33 [2021-05-03 00:04:49,232 INFO L226 Difference]: Without dead ends: 14 [2021-05-03 00:04:49,236 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-03 00:04:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-05-03 00:04:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-05-03 00:04:49,264 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-03 00:04:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-05-03 00:04:49,267 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-05-03 00:04:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:49,267 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-05-03 00:04:49,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:49,267 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-05-03 00:04:49,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-03 00:04:49,268 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:49,268 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:49,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:04:49,269 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:49,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:49,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 1 times [2021-05-03 00:04:49,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:49,270 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [494631660] [2021-05-03 00:04:49,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:49,280 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:04:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:49,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:04:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:04:49,460 INFO L134 CoverageAnalysis]: 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:49,460 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:04:49,460 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [494631660] [2021-05-03 00:04:49,460 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [494631660] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:04:49,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:04:49,461 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-03 00:04:49,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166850236] [2021-05-03 00:04:49,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-03 00:04:49,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:04:49,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-03 00:04:49,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-03 00:04:49,464 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-03 00:04:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:04:49,557 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2021-05-03 00:04:49,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-03 00:04:49,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-03 00:04:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:04:49,558 INFO L225 Difference]: With dead ends: 25 [2021-05-03 00:04:49,558 INFO L226 Difference]: Without dead ends: 17 [2021-05-03 00:04:49,558 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 111.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-03 00:04:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-03 00:04:49,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-05-03 00:04:49,562 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-03 00:04:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-05-03 00:04:49,563 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2021-05-03 00:04:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:04:49,563 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-05-03 00:04:49,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:04:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-05-03 00:04:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-03 00:04:49,564 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:04:49,564 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:04:49,564 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:04:49,564 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:04:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:04:49,564 INFO L82 PathProgramCache]: Analyzing trace with hash -79339060, now seen corresponding path program 1 times [2021-05-03 00:04:49,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:04:49,565 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [752046150] [2021-05-03 00:04:49,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:04:49,589 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_11 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_4 4294967296)))) InVars {main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_4} OutVars{main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_4} AuxVars[] AssignedVars[] [2021-05-03 00:04:49,597 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:04:49,624 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:49,637 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:04:53,680 WARN L205 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 16 [2021-05-03 00:04:56,585 WARN L205 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:04:59,811 WARN L205 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:04:59,837 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:04:59,846 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:04:59,885 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:04:59,957 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:04:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:00,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:00,216 INFO L134 CoverageAnalysis]: 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:00,325 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:00,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [752046150] [2021-05-03 00:05:00,326 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [752046150] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:00,326 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:00,326 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-03 00:05:00,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103936119] [2021-05-03 00:05:00,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-03 00:05:00,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:00,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-03 00:05:00,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-03 00:05:00,327 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-03 00:05:00,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:00,418 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-05-03 00:05:00,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-03 00:05:00,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-03 00:05:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:00,419 INFO L225 Difference]: With dead ends: 28 [2021-05-03 00:05:00,419 INFO L226 Difference]: Without dead ends: 20 [2021-05-03 00:05:00,419 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 173.0ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:05:00,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-05-03 00:05:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-05-03 00:05:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-05-03 00:05:00,429 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2021-05-03 00:05:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:00,430 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-05-03 00:05:00,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2021-05-03 00:05:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-03 00:05:00,430 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:00,431 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:00,431 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-03 00:05:00,431 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2084821988, now seen corresponding path program 2 times [2021-05-03 00:05:00,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:00,432 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1489759740] [2021-05-03 00:05:00,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:00,441 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_15 1) 4294967296) (mod v_main_~y~0_5 4294967296)) (< (mod v_main_~x~0_15 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_5} OutVars{main_~x~0=v_main_~x~0_15, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[] [2021-05-03 00:05:00,449 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:00,452 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:00,463 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:00,570 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:00,596 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:01,152 WARN L205 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:05:01,255 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:01,339 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:01,342 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_17 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_6 4294967296)))) InVars {main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_17, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] [2021-05-03 00:05:01,349 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:01,350 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:01,353 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:02,087 WARN L205 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:05:02,146 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:02,155 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:02,214 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:02,252 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:02,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:05:02,478 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:02,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1489759740] [2021-05-03 00:05:02,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1489759740] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:02,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:02,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-03 00:05:02,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195620150] [2021-05-03 00:05:02,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-03 00:05:02,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:02,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-03 00:05:02,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-05-03 00:05:02,480 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:02,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:02,609 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-05-03 00:05:02,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-03 00:05:02,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-03 00:05:02,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:02,611 INFO L225 Difference]: With dead ends: 31 [2021-05-03 00:05:02,611 INFO L226 Difference]: Without dead ends: 23 [2021-05-03 00:05:02,612 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 191.3ms TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:05:02,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-03 00:05:02,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-05-03 00:05:02,618 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-03 00:05:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2021-05-03 00:05:02,619 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2021-05-03 00:05:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:02,619 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2021-05-03 00:05:02,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:02,620 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2021-05-03 00:05:02,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-03 00:05:02,620 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:02,620 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:02,620 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-03 00:05:02,621 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:02,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:02,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1442444596, now seen corresponding path program 3 times [2021-05-03 00:05:02,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:02,622 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1919408406] [2021-05-03 00:05:02,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:02,632 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_22 1) 4294967296) (mod v_main_~y~0_7 4294967296)) (< (mod v_main_~x~0_22 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_22, main_~y~0=v_main_~y~0_7} AuxVars[] AssignedVars[] [2021-05-03 00:05:02,642 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:02,662 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:02,669 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:02,755 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:02,783 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:02,870 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:03,293 WARN L205 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:05:03,297 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:03,300 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_24 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_8 4294967296)))) InVars {main_~x~0=v_main_~x~0_24, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_24, main_~y~0=v_main_~y~0_8} AuxVars[] AssignedVars[] [2021-05-03 00:05:03,302 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:03,316 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:03,318 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:03,506 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:03,515 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:03,548 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:03,607 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:03,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:03,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:05:03,948 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:03,948 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1919408406] [2021-05-03 00:05:03,948 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1919408406] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:03,949 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:03,953 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-03 00:05:03,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177813041] [2021-05-03 00:05:03,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-03 00:05:03,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:03,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-03 00:05:03,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-03 00:05:03,954 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-03 00:05:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:04,132 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-05-03 00:05:04,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-03 00:05:04,133 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-03 00:05:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:04,134 INFO L225 Difference]: With dead ends: 34 [2021-05-03 00:05:04,134 INFO L226 Difference]: Without dead ends: 26 [2021-05-03 00:05:04,134 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 270.5ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:05:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-05-03 00:05:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-05-03 00:05:04,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-05-03 00:05:04,145 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2021-05-03 00:05:04,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:04,145 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-05-03 00:05:04,146 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-03 00:05:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-05-03 00:05:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-03 00:05:04,147 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:04,147 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:04,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-03 00:05:04,147 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:04,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:04,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1571384604, now seen corresponding path program 4 times [2021-05-03 00:05:04,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:04,149 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1259062484] [2021-05-03 00:05:04,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:04,159 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_30 1) 4294967296) (mod v_main_~y~0_9 4294967296)) (< (mod v_main_~x~0_30 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_30, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_30, main_~y~0=v_main_~y~0_9} AuxVars[] AssignedVars[] [2021-05-03 00:05:04,163 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:04,178 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:04,180 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:04,390 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:04,429 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:04,778 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:05:04,854 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:04,949 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:04,952 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_32 4294967296))) (and (< .cse0 (mod v_main_~y~0_10 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_32, main_~y~0=v_main_~y~0_10} OutVars{main_~x~0=v_main_~x~0_32, main_~y~0=v_main_~y~0_10} AuxVars[] AssignedVars[] [2021-05-03 00:05:04,956 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:04,968 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:04,970 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:05,262 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:05:05,276 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:05,286 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:05,322 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:05,358 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:05,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:05,458 INFO L134 CoverageAnalysis]: 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:05,617 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:05,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1259062484] [2021-05-03 00:05:05,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1259062484] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:05,617 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:05,617 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-03 00:05:05,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717172662] [2021-05-03 00:05:05,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-03 00:05:05,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:05,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-03 00:05:05,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-03 00:05:05,618 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-03 00:05:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:05,821 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2021-05-03 00:05:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-03 00:05:05,821 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-03 00:05:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:05,822 INFO L225 Difference]: With dead ends: 37 [2021-05-03 00:05:05,822 INFO L226 Difference]: Without dead ends: 29 [2021-05-03 00:05:05,822 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 249.3ms TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:05:05,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-03 00:05:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-05-03 00:05:05,825 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-03 00:05:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2021-05-03 00:05:05,826 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 23 [2021-05-03 00:05:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:05,826 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-05-03 00:05:05,826 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-03 00:05:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2021-05-03 00:05:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-03 00:05:05,827 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:05,827 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:05,827 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-03 00:05:05,827 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:05,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:05,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1172566988, now seen corresponding path program 5 times [2021-05-03 00:05:05,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:05,827 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2084512290] [2021-05-03 00:05:05,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:05,832 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_39 1) 4294967296) (mod v_main_~y~0_11 4294967296)) (< (mod v_main_~x~0_39 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_39, main_~y~0=v_main_~y~0_11} AuxVars[] AssignedVars[] [2021-05-03 00:05:05,835 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:05,836 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:05,845 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:06,101 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:05:06,135 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:06,171 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:06,257 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:06,334 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:06,336 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_41 4294967296))) (and (< .cse0 (mod v_main_~y~0_12 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_41, main_~y~0=v_main_~y~0_12} OutVars{main_~x~0=v_main_~x~0_41, main_~y~0=v_main_~y~0_12} AuxVars[] AssignedVars[] [2021-05-03 00:05:06,338 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:06,351 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:06,355 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:06,424 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:06,431 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:06,456 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:06,488 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:06,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:06,581 INFO L134 CoverageAnalysis]: 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:06,764 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:06,764 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2084512290] [2021-05-03 00:05:06,764 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2084512290] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:06,764 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:06,764 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-03 00:05:06,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070709490] [2021-05-03 00:05:06,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-03 00:05:06,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:06,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-03 00:05:06,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:05:06,766 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-03 00:05:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:07,036 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-05-03 00:05:07,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-03 00:05:07,036 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-03 00:05:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:07,037 INFO L225 Difference]: With dead ends: 40 [2021-05-03 00:05:07,037 INFO L226 Difference]: Without dead ends: 32 [2021-05-03 00:05:07,037 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 11 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 302.8ms TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:05:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-05-03 00:05:07,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-05-03 00:05:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-05-03 00:05:07,041 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2021-05-03 00:05:07,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:07,041 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-05-03 00:05:07,041 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-03 00:05:07,042 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-05-03 00:05:07,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-03 00:05:07,042 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:07,042 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:07,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-03 00:05:07,042 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:07,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:07,042 INFO L82 PathProgramCache]: Analyzing trace with hash 121899492, now seen corresponding path program 6 times [2021-05-03 00:05:07,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:07,043 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [866244232] [2021-05-03 00:05:07,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:07,048 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_49 1) 4294967296) (mod v_main_~y~0_13 4294967296)) (< (mod v_main_~x~0_49 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_49, main_~y~0=v_main_~y~0_13} OutVars{main_~x~0=v_main_~x~0_49, main_~y~0=v_main_~y~0_13} AuxVars[] AssignedVars[] [2021-05-03 00:05:07,049 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:07,064 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:07,066 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:07,200 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:05:07,277 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:07,293 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:07,675 WARN L205 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2021-05-03 00:05:07,926 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:05:07,932 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:08,031 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:08,033 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_51 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_14 4294967296)))) InVars {main_~x~0=v_main_~x~0_51, main_~y~0=v_main_~y~0_14} OutVars{main_~x~0=v_main_~x~0_51, main_~y~0=v_main_~y~0_14} AuxVars[] AssignedVars[] [2021-05-03 00:05:08,035 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:08,044 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:08,049 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:08,199 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:05:08,256 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:08,267 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:08,320 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:08,356 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:08,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:05:08,685 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:08,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [866244232] [2021-05-03 00:05:08,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [866244232] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:08,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:08,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-03 00:05:08,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525467146] [2021-05-03 00:05:08,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-03 00:05:08,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:08,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-03 00:05:08,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:05:08,687 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-03 00:05:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:09,004 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2021-05-03 00:05:09,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-03 00:05:09,004 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-03 00:05:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:09,005 INFO L225 Difference]: With dead ends: 43 [2021-05-03 00:05:09,005 INFO L226 Difference]: Without dead ends: 35 [2021-05-03 00:05:09,005 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 13 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 417.3ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:05:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-03 00:05:09,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-05-03 00:05:09,009 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-03 00:05:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2021-05-03 00:05:09,010 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2021-05-03 00:05:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:09,010 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-05-03 00:05:09,010 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-03 00:05:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2021-05-03 00:05:09,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-03 00:05:09,011 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:09,011 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:09,011 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-03 00:05:09,011 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:09,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:09,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1408179404, now seen corresponding path program 7 times [2021-05-03 00:05:09,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:09,011 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1853670624] [2021-05-03 00:05:09,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:09,015 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_60 1) 4294967296) (mod v_main_~y~0_15 4294967296)) (< (mod v_main_~x~0_60 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_60, main_~y~0=v_main_~y~0_15} OutVars{main_~x~0=v_main_~x~0_60, main_~y~0=v_main_~y~0_15} AuxVars[] AssignedVars[] [2021-05-03 00:05:09,018 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:09,032 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:09,034 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:09,201 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:09,216 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:09,313 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:09,388 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:09,389 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_62 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_16 4294967296)))) InVars {main_~x~0=v_main_~x~0_62, main_~y~0=v_main_~y~0_16} OutVars{main_~x~0=v_main_~x~0_62, main_~y~0=v_main_~y~0_16} AuxVars[] AssignedVars[] [2021-05-03 00:05:09,391 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:09,391 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:09,393 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:09,447 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:09,454 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:09,499 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:09,545 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:09,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:09,627 INFO L134 CoverageAnalysis]: 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:09,904 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:09,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1853670624] [2021-05-03 00:05:09,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1853670624] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:09,905 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:09,905 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-03 00:05:09,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108761583] [2021-05-03 00:05:09,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-03 00:05:09,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:09,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-03 00:05:09,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:05:09,906 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-03 00:05:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:10,317 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-05-03 00:05:10,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-03 00:05:10,317 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-03 00:05:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:10,318 INFO L225 Difference]: With dead ends: 46 [2021-05-03 00:05:10,318 INFO L226 Difference]: Without dead ends: 38 [2021-05-03 00:05:10,318 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 15 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 474.9ms TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:05:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-05-03 00:05:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2021-05-03 00:05:10,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-05-03 00:05:10,324 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2021-05-03 00:05:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:10,324 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-05-03 00:05:10,324 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-03 00:05:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-05-03 00:05:10,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-03 00:05:10,324 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:10,324 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:10,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-03 00:05:10,325 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:10,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:10,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1274822884, now seen corresponding path program 8 times [2021-05-03 00:05:10,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:10,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [750076828] [2021-05-03 00:05:10,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:10,330 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_72 1) 4294967296) (mod v_main_~y~0_17 4294967296)) (< (mod v_main_~x~0_72 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_72, main_~y~0=v_main_~y~0_17} OutVars{main_~x~0=v_main_~x~0_72, main_~y~0=v_main_~y~0_17} AuxVars[] AssignedVars[] [2021-05-03 00:05:10,332 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:10,346 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:10,347 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:11,663 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:05:11,721 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:11,738 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:12,544 WARN L205 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:05:12,625 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:12,727 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:05:12,729 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:12,731 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_74 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_18 4294967296)))) InVars {main_~x~0=v_main_~x~0_74, main_~y~0=v_main_~y~0_18} OutVars{main_~x~0=v_main_~x~0_74, main_~y~0=v_main_~y~0_18} AuxVars[] AssignedVars[] [2021-05-03 00:05:12,732 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:12,733 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:12,734 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:12,777 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:12,785 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:12,834 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:12,868 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:12,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:13,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-03 00:05:13,286 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:13,286 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [750076828] [2021-05-03 00:05:13,287 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [750076828] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:13,287 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:13,287 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-03 00:05:13,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825903677] [2021-05-03 00:05:13,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-03 00:05:13,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:13,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-03 00:05:13,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-05-03 00:05:13,288 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-03 00:05:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:13,728 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-05-03 00:05:13,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:05:13,729 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-03 00:05:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:13,729 INFO L225 Difference]: With dead ends: 49 [2021-05-03 00:05:13,729 INFO L226 Difference]: Without dead ends: 41 [2021-05-03 00:05:13,730 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 18 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 539.3ms TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:05:13,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-03 00:05:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2021-05-03 00:05:13,734 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-03 00:05:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2021-05-03 00:05:13,735 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 35 [2021-05-03 00:05:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:13,735 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-05-03 00:05:13,735 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-03 00:05:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2021-05-03 00:05:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-03 00:05:13,736 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:13,736 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:13,736 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-03 00:05:13,736 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:13,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1295484364, now seen corresponding path program 9 times [2021-05-03 00:05:13,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:13,737 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1952921478] [2021-05-03 00:05:13,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:13,741 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_85 1) 4294967296) (mod v_main_~y~0_19 4294967296)) (< (mod v_main_~x~0_85 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_85, main_~y~0=v_main_~y~0_19} OutVars{main_~x~0=v_main_~x~0_85, main_~y~0=v_main_~y~0_19} AuxVars[] AssignedVars[] [2021-05-03 00:05:13,743 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:13,744 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:13,746 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:13,898 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:05:13,963 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:13,994 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:14,125 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:14,496 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:05:14,497 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:14,499 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_87 4294967296))) (and (< .cse0 (mod v_main_~y~0_20 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_87, main_~y~0=v_main_~y~0_20} OutVars{main_~x~0=v_main_~x~0_87, main_~y~0=v_main_~y~0_20} AuxVars[] AssignedVars[] [2021-05-03 00:05:14,500 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:14,511 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:14,513 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:14,559 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:14,576 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:14,612 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:14,644 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:14,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:14,742 INFO L134 CoverageAnalysis]: 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,051 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:15,051 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1952921478] [2021-05-03 00:05:15,051 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1952921478] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:15,051 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:15,051 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-03 00:05:15,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53806200] [2021-05-03 00:05:15,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-03 00:05:15,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:15,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-03 00:05:15,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-05-03 00:05:15,052 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-03 00:05:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:15,544 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-05-03 00:05:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-03 00:05:15,545 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-03 00:05:15,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:15,545 INFO L225 Difference]: With dead ends: 52 [2021-05-03 00:05:15,545 INFO L226 Difference]: Without dead ends: 44 [2021-05-03 00:05:15,546 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 19 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 579.0ms TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:05:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-05-03 00:05:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2021-05-03 00:05:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-05-03 00:05:15,551 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2021-05-03 00:05:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:15,551 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-05-03 00:05:15,551 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-03 00:05:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-05-03 00:05:15,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-03 00:05:15,552 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:15,552 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:15,552 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-05-03 00:05:15,552 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:15,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:15,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1653655580, now seen corresponding path program 10 times [2021-05-03 00:05:15,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:15,552 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [101790158] [2021-05-03 00:05:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:15,556 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_99 1) 4294967296) (mod v_main_~y~0_21 4294967296)) (< (mod v_main_~x~0_99 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_99, main_~y~0=v_main_~y~0_21} OutVars{main_~x~0=v_main_~x~0_99, main_~y~0=v_main_~y~0_21} AuxVars[] AssignedVars[] [2021-05-03 00:05:15,558 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:15,559 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:15,560 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:17,335 WARN L205 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:05:17,405 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:17,429 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:17,520 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:17,576 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:17,578 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_101 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_22 4294967296)))) InVars {main_~x~0=v_main_~x~0_101, main_~y~0=v_main_~y~0_22} OutVars{main_~x~0=v_main_~x~0_101, main_~y~0=v_main_~y~0_22} AuxVars[] AssignedVars[] [2021-05-03 00:05:17,579 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:17,580 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:17,582 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:18,762 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:05:18,877 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:05:18,890 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:18,897 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:18,953 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:18,995 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:19,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:19,098 INFO L134 CoverageAnalysis]: 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:19,500 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:19,500 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [101790158] [2021-05-03 00:05:19,500 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [101790158] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:19,500 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:19,501 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-03 00:05:19,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128875894] [2021-05-03 00:05:19,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-03 00:05:19,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:19,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-03 00:05:19,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-05-03 00:05:19,502 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-03 00:05:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:20,069 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2021-05-03 00:05:20,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:05:20,069 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-03 00:05:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:20,070 INFO L225 Difference]: With dead ends: 55 [2021-05-03 00:05:20,070 INFO L226 Difference]: Without dead ends: 47 [2021-05-03 00:05:20,071 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 21 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 690.6ms TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:05:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-03 00:05:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-05-03 00:05:20,075 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-03 00:05:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2021-05-03 00:05:20,076 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 41 [2021-05-03 00:05:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:20,076 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2021-05-03 00:05:20,076 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-03 00:05:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2021-05-03 00:05:20,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-03 00:05:20,077 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:20,077 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:20,077 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-03 00:05:20,077 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:20,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1630720308, now seen corresponding path program 11 times [2021-05-03 00:05:20,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:20,078 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [556505704] [2021-05-03 00:05:20,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:20,091 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_114 4294967296) 5000000) (< (mod (+ v_main_~x~0_114 1) 4294967296) (mod v_main_~y~0_23 4294967296))) InVars {main_~x~0=v_main_~x~0_114, main_~y~0=v_main_~y~0_23} OutVars{main_~x~0=v_main_~x~0_114, main_~y~0=v_main_~y~0_23} AuxVars[] AssignedVars[] [2021-05-03 00:05:20,092 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:20,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:20,109 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:20,213 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:20,234 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:20,815 WARN L205 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:05:20,873 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:21,035 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:05:21,037 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:21,039 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_116 4294967296))) (and (< .cse0 (mod v_main_~y~0_24 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_116, main_~y~0=v_main_~y~0_24} OutVars{main_~x~0=v_main_~x~0_116, main_~y~0=v_main_~y~0_24} AuxVars[] AssignedVars[] [2021-05-03 00:05:21,040 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:21,052 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:21,054 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:21,101 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:21,110 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:21,144 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:21,189 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:21,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:05:21,763 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:21,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [556505704] [2021-05-03 00:05:21,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [556505704] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:21,763 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:21,763 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-03 00:05:21,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13828866] [2021-05-03 00:05:21,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-03 00:05:21,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:21,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-03 00:05:21,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:05:21,765 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-03 00:05:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:22,441 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-05-03 00:05:22,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-03 00:05:22,442 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-03 00:05:22,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:22,442 INFO L225 Difference]: With dead ends: 58 [2021-05-03 00:05:22,442 INFO L226 Difference]: Without dead ends: 50 [2021-05-03 00:05:22,443 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 23 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 802.8ms TimeCoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:05:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-05-03 00:05:22,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2021-05-03 00:05:22,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:22,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2021-05-03 00:05:22,451 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2021-05-03 00:05:22,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:22,451 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2021-05-03 00:05:22,451 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-03 00:05:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2021-05-03 00:05:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-03 00:05:22,452 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:22,452 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:22,452 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-05-03 00:05:22,452 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:22,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:22,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1265832220, now seen corresponding path program 12 times [2021-05-03 00:05:22,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:22,453 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2072000253] [2021-05-03 00:05:22,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:22,457 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_130 4294967296) 5000000) (< (mod (+ v_main_~x~0_130 1) 4294967296) (mod v_main_~y~0_25 4294967296))) InVars {main_~x~0=v_main_~x~0_130, main_~y~0=v_main_~y~0_25} OutVars{main_~x~0=v_main_~x~0_130, main_~y~0=v_main_~y~0_25} AuxVars[] AssignedVars[] [2021-05-03 00:05:22,459 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:22,460 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:22,461 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:22,624 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:05:23,813 WARN L205 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 17 [2021-05-03 00:05:23,814 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:23,848 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:23,959 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:24,222 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:05:24,224 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:24,225 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_132 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_26 4294967296)))) InVars {main_~x~0=v_main_~x~0_132, main_~y~0=v_main_~y~0_26} OutVars{main_~x~0=v_main_~x~0_132, main_~y~0=v_main_~y~0_26} AuxVars[] AssignedVars[] [2021-05-03 00:05:24,227 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:24,239 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:24,242 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:24,366 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:24,376 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:24,422 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:24,463 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:24,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:24,562 INFO L134 CoverageAnalysis]: 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:25,057 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:25,057 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2072000253] [2021-05-03 00:05:25,057 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2072000253] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:25,057 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:25,057 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:05:25,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60827549] [2021-05-03 00:05:25,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:05:25,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:25,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:05:25,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-05-03 00:05:25,059 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:25,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:25,816 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2021-05-03 00:05:25,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-03 00:05:25,816 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2021-05-03 00:05:25,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:25,817 INFO L225 Difference]: With dead ends: 61 [2021-05-03 00:05:25,817 INFO L226 Difference]: Without dead ends: 53 [2021-05-03 00:05:25,817 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 26 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 868.8ms TimeCoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:05:25,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-03 00:05:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2021-05-03 00:05:25,822 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-03 00:05:25,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2021-05-03 00:05:25,823 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 47 [2021-05-03 00:05:25,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:25,823 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2021-05-03 00:05:25,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2021-05-03 00:05:25,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-05-03 00:05:25,823 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:25,823 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:25,824 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-03 00:05:25,824 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:25,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:25,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1447028788, now seen corresponding path program 13 times [2021-05-03 00:05:25,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:25,824 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [327164541] [2021-05-03 00:05:25,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:25,829 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_147 1) 4294967296) (mod v_main_~y~0_27 4294967296)) (< (mod v_main_~x~0_147 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_147, main_~y~0=v_main_~y~0_27} OutVars{main_~x~0=v_main_~x~0_147, main_~y~0=v_main_~y~0_27} AuxVars[] AssignedVars[] [2021-05-03 00:05:25,830 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:25,844 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:25,846 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:25,943 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:25,977 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:26,085 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:26,296 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:05:26,298 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:26,300 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_149 4294967296))) (and (< .cse0 (mod v_main_~y~0_28 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_149, main_~y~0=v_main_~y~0_28} OutVars{main_~x~0=v_main_~x~0_149, main_~y~0=v_main_~y~0_28} AuxVars[] AssignedVars[] [2021-05-03 00:05:26,301 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:26,314 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:26,315 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:27,007 WARN L205 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:05:27,107 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:27,117 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:27,152 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:27,222 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:27,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:27,328 INFO L134 CoverageAnalysis]: 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:27,948 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:27,949 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [327164541] [2021-05-03 00:05:27,949 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [327164541] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:27,949 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:27,949 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-03 00:05:27,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738500032] [2021-05-03 00:05:27,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-03 00:05:27,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:27,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-03 00:05:27,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-05-03 00:05:27,950 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-03 00:05:28,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:28,674 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-05-03 00:05:28,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-03 00:05:28,675 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-03 00:05:28,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:28,675 INFO L225 Difference]: With dead ends: 64 [2021-05-03 00:05:28,675 INFO L226 Difference]: Without dead ends: 56 [2021-05-03 00:05:28,676 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 27 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 984.7ms TimeCoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:05:28,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-05-03 00:05:28,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2021-05-03 00:05:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-05-03 00:05:28,683 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2021-05-03 00:05:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:28,683 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-05-03 00:05:28,683 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-03 00:05:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-05-03 00:05:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-03 00:05:28,684 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:28,684 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:28,684 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-05-03 00:05:28,684 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:28,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash -700095004, now seen corresponding path program 14 times [2021-05-03 00:05:28,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:28,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1466770018] [2021-05-03 00:05:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:28,689 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_165 1) 4294967296) (mod v_main_~y~0_29 4294967296)) (< (mod v_main_~x~0_165 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_165, main_~y~0=v_main_~y~0_29} OutVars{main_~x~0=v_main_~x~0_165, main_~y~0=v_main_~y~0_29} AuxVars[] AssignedVars[] [2021-05-03 00:05:28,691 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:28,691 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:28,694 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:28,771 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:28,819 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:28,920 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:29,258 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:05:29,259 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:29,261 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_167 4294967296))) (and (< .cse0 (mod v_main_~y~0_30 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_167, main_~y~0=v_main_~y~0_30} OutVars{main_~x~0=v_main_~x~0_167, main_~y~0=v_main_~y~0_30} AuxVars[] AssignedVars[] [2021-05-03 00:05:29,262 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:29,263 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:29,264 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:29,359 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:29,367 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:29,412 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:29,451 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:29,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:05:30,095 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:30,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1466770018] [2021-05-03 00:05:30,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1466770018] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:30,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:30,095 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-03 00:05:30,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269302977] [2021-05-03 00:05:30,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-03 00:05:30,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:30,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-03 00:05:30,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:05:30,096 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:30,928 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2021-05-03 00:05:30,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-03 00:05:30,928 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2021-05-03 00:05:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:30,929 INFO L225 Difference]: With dead ends: 67 [2021-05-03 00:05:30,929 INFO L226 Difference]: Without dead ends: 59 [2021-05-03 00:05:30,929 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 7 SyntacticMatches, 29 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 972.9ms TimeCoverageRelationStatistics Valid=130, Invalid=1060, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:05:30,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-03 00:05:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2021-05-03 00:05:30,935 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-03 00:05:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2021-05-03 00:05:30,935 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2021-05-03 00:05:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:30,936 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2021-05-03 00:05:30,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2021-05-03 00:05:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-05-03 00:05:30,936 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:30,936 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:30,936 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-03 00:05:30,936 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:30,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:30,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1021296436, now seen corresponding path program 15 times [2021-05-03 00:05:30,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:30,937 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1827873618] [2021-05-03 00:05:30,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:30,943 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_184 4294967296) 5000000) (< (mod (+ v_main_~x~0_184 1) 4294967296) (mod v_main_~y~0_31 4294967296))) InVars {main_~x~0=v_main_~x~0_184, main_~y~0=v_main_~y~0_31} OutVars{main_~x~0=v_main_~x~0_184, main_~y~0=v_main_~y~0_31} AuxVars[] AssignedVars[] [2021-05-03 00:05:30,946 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:30,960 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:30,962 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:31,115 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:31,132 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:31,213 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:31,347 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:05:31,348 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:31,350 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_186 4294967296))) (and (< .cse0 (mod v_main_~y~0_32 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_186, main_~y~0=v_main_~y~0_32} OutVars{main_~x~0=v_main_~x~0_186, main_~y~0=v_main_~y~0_32} AuxVars[] AssignedVars[] [2021-05-03 00:05:31,351 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:31,362 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:31,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:31,425 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:31,438 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:31,462 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:31,497 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:31,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:31,611 INFO L134 CoverageAnalysis]: 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:32,179 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:32,179 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1827873618] [2021-05-03 00:05:32,179 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1827873618] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:32,179 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:32,179 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-03 00:05:32,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006378376] [2021-05-03 00:05:32,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-03 00:05:32,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:32,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-03 00:05:32,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:05:32,180 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-03 00:05:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:33,011 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-05-03 00:05:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:05:33,011 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-03 00:05:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:33,011 INFO L225 Difference]: With dead ends: 70 [2021-05-03 00:05:33,012 INFO L226 Difference]: Without dead ends: 62 [2021-05-03 00:05:33,012 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 7 SyntacticMatches, 31 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1018.7ms TimeCoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:05:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-05-03 00:05:33,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2021-05-03 00:05:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2021-05-03 00:05:33,018 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 56 [2021-05-03 00:05:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:33,018 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2021-05-03 00:05:33,018 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-03 00:05:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2021-05-03 00:05:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-03 00:05:33,019 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:33,019 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:33,019 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-05-03 00:05:33,019 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:33,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:33,019 INFO L82 PathProgramCache]: Analyzing trace with hash -746021660, now seen corresponding path program 16 times [2021-05-03 00:05:33,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:33,020 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1465614320] [2021-05-03 00:05:33,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:33,027 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_204 1) 4294967296) (mod v_main_~y~0_33 4294967296)) (< (mod v_main_~x~0_204 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_204, main_~y~0=v_main_~y~0_33} OutVars{main_~x~0=v_main_~x~0_204, main_~y~0=v_main_~y~0_33} AuxVars[] AssignedVars[] [2021-05-03 00:05:33,028 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:33,042 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:33,044 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:33,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:33,152 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:33,199 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:33,331 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:05:33,333 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:33,334 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_206 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_34 4294967296)))) InVars {main_~x~0=v_main_~x~0_206, main_~y~0=v_main_~y~0_34} OutVars{main_~x~0=v_main_~x~0_206, main_~y~0=v_main_~y~0_34} AuxVars[] AssignedVars[] [2021-05-03 00:05:33,336 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:33,349 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:33,351 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:33,511 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:05:33,542 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:33,553 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:33,587 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:33,626 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:33,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:33,719 INFO L134 CoverageAnalysis]: 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:34,459 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:34,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1465614320] [2021-05-03 00:05:34,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1465614320] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:34,459 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:34,460 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-03 00:05:34,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41340067] [2021-05-03 00:05:34,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-03 00:05:34,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:34,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-03 00:05:34,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2021-05-03 00:05:34,460 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-03 00:05:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:35,423 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2021-05-03 00:05:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-03 00:05:35,424 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-03 00:05:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:35,424 INFO L225 Difference]: With dead ends: 73 [2021-05-03 00:05:35,424 INFO L226 Difference]: Without dead ends: 65 [2021-05-03 00:05:35,425 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 7 SyntacticMatches, 33 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1204.3ms TimeCoverageRelationStatistics Valid=146, Invalid=1336, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:05:35,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-03 00:05:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-05-03 00:05:35,431 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-03 00:05:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2021-05-03 00:05:35,432 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 59 [2021-05-03 00:05:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:35,432 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2021-05-03 00:05:35,432 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-03 00:05:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2021-05-03 00:05:35,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-03 00:05:35,432 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:35,432 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:35,433 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-03 00:05:35,433 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:35,433 INFO L82 PathProgramCache]: Analyzing trace with hash 872262092, now seen corresponding path program 17 times [2021-05-03 00:05:35,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:35,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2114637746] [2021-05-03 00:05:35,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:35,438 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_225 4294967296) 5000000) (< (mod (+ v_main_~x~0_225 1) 4294967296) (mod v_main_~y~0_35 4294967296))) InVars {main_~x~0=v_main_~x~0_225, main_~y~0=v_main_~y~0_35} OutVars{main_~x~0=v_main_~x~0_225, main_~y~0=v_main_~y~0_35} AuxVars[] AssignedVars[] [2021-05-03 00:05:35,440 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:35,452 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:35,454 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:35,584 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:35,616 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:35,892 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:05:35,893 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:35,973 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:35,975 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_227 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_36 4294967296)))) InVars {main_~x~0=v_main_~x~0_227, main_~y~0=v_main_~y~0_36} OutVars{main_~x~0=v_main_~x~0_227, main_~y~0=v_main_~y~0_36} AuxVars[] AssignedVars[] [2021-05-03 00:05:35,976 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:35,987 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:35,989 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:36,089 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:36,096 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:36,121 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:36,152 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:36,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:36,214 INFO L134 CoverageAnalysis]: 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:36,954 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:36,954 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2114637746] [2021-05-03 00:05:36,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2114637746] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:36,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:36,954 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-03 00:05:36,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916044207] [2021-05-03 00:05:36,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-03 00:05:36,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:36,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-03 00:05:36,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2021-05-03 00:05:36,955 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-03 00:05:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:37,960 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-05-03 00:05:37,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-03 00:05:37,960 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-03 00:05:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:37,961 INFO L225 Difference]: With dead ends: 76 [2021-05-03 00:05:37,961 INFO L226 Difference]: Without dead ends: 68 [2021-05-03 00:05:37,962 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 7 SyntacticMatches, 35 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1231.1ms TimeCoverageRelationStatistics Valid=154, Invalid=1486, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:05:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-03 00:05:37,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2021-05-03 00:05:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2021-05-03 00:05:37,968 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2021-05-03 00:05:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:37,968 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2021-05-03 00:05:37,969 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-03 00:05:37,969 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2021-05-03 00:05:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-03 00:05:37,969 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:37,969 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:37,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-05-03 00:05:37,969 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:37,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:37,969 INFO L82 PathProgramCache]: Analyzing trace with hash 155620324, now seen corresponding path program 18 times [2021-05-03 00:05:37,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:37,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [907355855] [2021-05-03 00:05:37,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:37,977 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_247 4294967296) 5000000) (< (mod (+ v_main_~x~0_247 1) 4294967296) (mod v_main_~y~0_37 4294967296))) InVars {main_~x~0=v_main_~x~0_247, main_~y~0=v_main_~y~0_37} OutVars{main_~x~0=v_main_~x~0_247, main_~y~0=v_main_~y~0_37} AuxVars[] AssignedVars[] [2021-05-03 00:05:37,978 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:37,992 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:37,994 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:38,306 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:05:38,465 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:05:38,495 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:38,524 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:38,758 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:38,851 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:38,852 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_249 4294967296))) (and (< .cse0 (mod v_main_~y~0_38 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_249, main_~y~0=v_main_~y~0_38} OutVars{main_~x~0=v_main_~x~0_249, main_~y~0=v_main_~y~0_38} AuxVars[] AssignedVars[] [2021-05-03 00:05:38,854 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:38,865 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:38,866 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:38,989 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:38,995 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:39,016 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:39,071 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:39,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:05:39,990 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:39,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [907355855] [2021-05-03 00:05:39,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [907355855] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:39,990 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:39,990 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-03 00:05:39,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499316307] [2021-05-03 00:05:39,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-03 00:05:39,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:39,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-03 00:05:39,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-05-03 00:05:39,991 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:41,140 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2021-05-03 00:05:41,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-03 00:05:41,140 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-05-03 00:05:41,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:41,141 INFO L225 Difference]: With dead ends: 79 [2021-05-03 00:05:41,141 INFO L226 Difference]: Without dead ends: 71 [2021-05-03 00:05:41,141 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 7 SyntacticMatches, 37 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1391.5ms TimeCoverageRelationStatistics Valid=162, Invalid=1644, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:05:41,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-03 00:05:41,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2021-05-03 00:05:41,148 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-03 00:05:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2021-05-03 00:05:41,148 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 65 [2021-05-03 00:05:41,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:41,149 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2021-05-03 00:05:41,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2021-05-03 00:05:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-03 00:05:41,149 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:41,149 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:41,149 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-05-03 00:05:41,149 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash 963138252, now seen corresponding path program 19 times [2021-05-03 00:05:41,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:41,150 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1703799300] [2021-05-03 00:05:41,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:41,156 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_270 1) 4294967296) (mod v_main_~y~0_39 4294967296)) (< (mod v_main_~x~0_270 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_270, main_~y~0=v_main_~y~0_39} OutVars{main_~x~0=v_main_~x~0_270, main_~y~0=v_main_~y~0_39} AuxVars[] AssignedVars[] [2021-05-03 00:05:41,157 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:41,173 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:41,174 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:41,271 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:41,289 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:41,393 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:41,528 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:05:41,529 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:41,531 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_272 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_40 4294967296)))) InVars {main_~x~0=v_main_~x~0_272, main_~y~0=v_main_~y~0_40} OutVars{main_~x~0=v_main_~x~0_272, main_~y~0=v_main_~y~0_40} AuxVars[] AssignedVars[] [2021-05-03 00:05:41,533 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:41,544 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:41,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:41,601 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:41,609 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:41,641 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:41,684 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:41,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:41,774 INFO L134 CoverageAnalysis]: 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:42,644 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:42,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1703799300] [2021-05-03 00:05:42,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1703799300] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:42,645 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:42,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-03 00:05:42,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9118556] [2021-05-03 00:05:42,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-03 00:05:42,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:42,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-03 00:05:42,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2021-05-03 00:05:42,646 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-03 00:05:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:43,801 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2021-05-03 00:05:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-03 00:05:43,801 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-03 00:05:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:43,802 INFO L225 Difference]: With dead ends: 82 [2021-05-03 00:05:43,802 INFO L226 Difference]: Without dead ends: 74 [2021-05-03 00:05:43,802 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 6 SyntacticMatches, 40 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1411.5ms TimeCoverageRelationStatistics Valid=170, Invalid=1810, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:05:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-03 00:05:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2021-05-03 00:05:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2021-05-03 00:05:43,810 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 68 [2021-05-03 00:05:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:43,810 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2021-05-03 00:05:43,810 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-03 00:05:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2021-05-03 00:05:43,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-03 00:05:43,810 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:43,810 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:43,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-05-03 00:05:43,810 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:43,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:43,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1617906404, now seen corresponding path program 20 times [2021-05-03 00:05:43,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:43,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1379523166] [2021-05-03 00:05:43,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:43,823 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_294 4294967296) 5000000) (< (mod (+ v_main_~x~0_294 1) 4294967296) (mod v_main_~y~0_41 4294967296))) InVars {main_~x~0=v_main_~x~0_294, main_~y~0=v_main_~y~0_41} OutVars{main_~x~0=v_main_~x~0_294, main_~y~0=v_main_~y~0_41} AuxVars[] AssignedVars[] [2021-05-03 00:05:43,824 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:43,836 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:43,838 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:43,978 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:43,997 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:44,098 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2021-05-03 00:05:44,283 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:05:44,284 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:44,397 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:05:44,398 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:44,399 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_296 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_42 4294967296)))) InVars {main_~x~0=v_main_~x~0_296, main_~y~0=v_main_~y~0_42} OutVars{main_~x~0=v_main_~x~0_296, main_~y~0=v_main_~y~0_42} AuxVars[] AssignedVars[] [2021-05-03 00:05:44,400 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:44,412 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:44,413 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:44,540 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:44,547 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:44,579 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:44,614 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:44,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:05:45,643 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:45,644 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1379523166] [2021-05-03 00:05:45,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1379523166] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:45,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:45,644 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-03 00:05:45,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035617208] [2021-05-03 00:05:45,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-03 00:05:45,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:45,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-03 00:05:45,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2021-05-03 00:05:45,645 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-03 00:05:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:46,922 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2021-05-03 00:05:46,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-03 00:05:46,922 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-03 00:05:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:46,923 INFO L225 Difference]: With dead ends: 85 [2021-05-03 00:05:46,923 INFO L226 Difference]: Without dead ends: 77 [2021-05-03 00:05:46,923 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 6 SyntacticMatches, 42 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1533.5ms TimeCoverageRelationStatistics Valid=178, Invalid=1984, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:05:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-03 00:05:46,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2021-05-03 00:05:46,931 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-03 00:05:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2021-05-03 00:05:46,931 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2021-05-03 00:05:46,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:46,931 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2021-05-03 00:05:46,931 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-03 00:05:46,931 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2021-05-03 00:05:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-03 00:05:46,932 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:46,932 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:46,932 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-03 00:05:46,932 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:46,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:46,932 INFO L82 PathProgramCache]: Analyzing trace with hash 74464204, now seen corresponding path program 21 times [2021-05-03 00:05:46,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:46,932 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1094457504] [2021-05-03 00:05:46,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:46,937 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_319 4294967296) 5000000) (< (mod (+ v_main_~x~0_319 1) 4294967296) (mod v_main_~y~0_43 4294967296))) InVars {main_~x~0=v_main_~x~0_319, main_~y~0=v_main_~y~0_43} OutVars{main_~x~0=v_main_~x~0_319, main_~y~0=v_main_~y~0_43} AuxVars[] AssignedVars[] [2021-05-03 00:05:46,938 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:46,951 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:46,954 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:47,009 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:47,033 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:47,209 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:47,300 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:47,301 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_321 4294967296))) (and (< .cse0 (mod v_main_~y~0_44 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_321, main_~y~0=v_main_~y~0_44} OutVars{main_~x~0=v_main_~x~0_321, main_~y~0=v_main_~y~0_44} AuxVars[] AssignedVars[] [2021-05-03 00:05:47,302 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:47,315 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:47,316 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:47,387 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:47,395 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:47,420 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:47,459 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:47,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:05:48,532 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:48,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1094457504] [2021-05-03 00:05:48,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1094457504] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:48,533 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:48,533 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-03 00:05:48,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196908133] [2021-05-03 00:05:48,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-03 00:05:48,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:48,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-03 00:05:48,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2021-05-03 00:05:48,534 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-03 00:05:49,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:49,888 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2021-05-03 00:05:49,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-03 00:05:49,889 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-03 00:05:49,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:49,890 INFO L225 Difference]: With dead ends: 88 [2021-05-03 00:05:49,890 INFO L226 Difference]: Without dead ends: 80 [2021-05-03 00:05:49,890 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 6 SyntacticMatches, 44 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1624.2ms TimeCoverageRelationStatistics Valid=186, Invalid=2166, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:05:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-05-03 00:05:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2021-05-03 00:05:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2021-05-03 00:05:49,898 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2021-05-03 00:05:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:49,898 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2021-05-03 00:05:49,898 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-03 00:05:49,898 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2021-05-03 00:05:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-03 00:05:49,899 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:49,899 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:49,899 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-05-03 00:05:49,899 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:49,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:49,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1307754980, now seen corresponding path program 22 times [2021-05-03 00:05:49,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:49,899 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2133258625] [2021-05-03 00:05:49,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:49,907 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_345 1) 4294967296) (mod v_main_~y~0_45 4294967296)) (< (mod v_main_~x~0_345 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_345, main_~y~0=v_main_~y~0_45} OutVars{main_~x~0=v_main_~x~0_345, main_~y~0=v_main_~y~0_45} AuxVars[] AssignedVars[] [2021-05-03 00:05:49,909 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:49,923 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:49,925 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:49,997 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:50,032 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:50,160 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:50,313 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:05:50,315 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:50,316 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_347 4294967296))) (and (< .cse0 (mod v_main_~y~0_46 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_347, main_~y~0=v_main_~y~0_46} OutVars{main_~x~0=v_main_~x~0_347, main_~y~0=v_main_~y~0_46} AuxVars[] AssignedVars[] [2021-05-03 00:05:50,318 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:50,333 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:50,345 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:50,388 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:50,394 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:50,446 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:50,481 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:50,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:50,589 INFO L134 CoverageAnalysis]: 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:51,708 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:51,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2133258625] [2021-05-03 00:05:51,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2133258625] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:51,709 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:51,709 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-03 00:05:51,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128811115] [2021-05-03 00:05:51,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-03 00:05:51,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:51,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-03 00:05:51,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2021-05-03 00:05:51,710 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:53,237 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-05-03 00:05:53,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-03 00:05:53,237 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2021-05-03 00:05:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:53,238 INFO L225 Difference]: With dead ends: 91 [2021-05-03 00:05:53,238 INFO L226 Difference]: Without dead ends: 83 [2021-05-03 00:05:53,239 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 7 SyntacticMatches, 45 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1869.8ms TimeCoverageRelationStatistics Valid=194, Invalid=2356, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:05:53,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-03 00:05:53,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2021-05-03 00:05:53,247 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-03 00:05:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2021-05-03 00:05:53,247 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 77 [2021-05-03 00:05:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:53,247 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2021-05-03 00:05:53,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2021-05-03 00:05:53,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-03 00:05:53,248 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:53,248 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:53,248 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-03 00:05:53,248 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:53,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:53,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1171954484, now seen corresponding path program 23 times [2021-05-03 00:05:53,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:53,249 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1151668242] [2021-05-03 00:05:53,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:53,254 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_372 4294967296) 5000000) (< (mod (+ v_main_~x~0_372 1) 4294967296) (mod v_main_~y~0_47 4294967296))) InVars {main_~x~0=v_main_~x~0_372, main_~y~0=v_main_~y~0_47} OutVars{main_~x~0=v_main_~x~0_372, main_~y~0=v_main_~y~0_47} AuxVars[] AssignedVars[] [2021-05-03 00:05:53,256 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:53,256 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:53,258 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:55,287 WARN L205 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:05:55,385 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:55,437 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:55,567 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:55,654 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:55,655 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_374 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_48 4294967296)))) InVars {main_~x~0=v_main_~x~0_374, main_~y~0=v_main_~y~0_48} OutVars{main_~x~0=v_main_~x~0_374, main_~y~0=v_main_~y~0_48} AuxVars[] AssignedVars[] [2021-05-03 00:05:55,657 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:55,659 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:55,660 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:55,698 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:55,704 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:55,766 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:55,802 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:55,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:55,893 INFO L134 CoverageAnalysis]: 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:57,128 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:05:57,128 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1151668242] [2021-05-03 00:05:57,128 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1151668242] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:05:57,129 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:05:57,129 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-03 00:05:57,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793053495] [2021-05-03 00:05:57,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-03 00:05:57,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:05:57,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-03 00:05:57,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2021-05-03 00:05:57,130 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-03 00:05:58,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:05:58,762 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-05-03 00:05:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-03 00:05:58,762 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-03 00:05:58,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:05:58,763 INFO L225 Difference]: With dead ends: 94 [2021-05-03 00:05:58,763 INFO L226 Difference]: Without dead ends: 86 [2021-05-03 00:05:58,763 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 6 SyntacticMatches, 48 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 2025.3ms TimeCoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2021-05-03 00:05:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-05-03 00:05:58,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2021-05-03 00:05:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:05:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2021-05-03 00:05:58,773 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 80 [2021-05-03 00:05:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:05:58,773 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2021-05-03 00:05:58,773 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-03 00:05:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2021-05-03 00:05:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-03 00:05:58,774 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:05:58,774 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:05:58,774 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-05-03 00:05:58,774 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:05:58,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:05:58,774 INFO L82 PathProgramCache]: Analyzing trace with hash -759105308, now seen corresponding path program 24 times [2021-05-03 00:05:58,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:05:58,774 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [89971792] [2021-05-03 00:05:58,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:05:58,779 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_400 4294967296) 5000000) (< (mod (+ v_main_~x~0_400 1) 4294967296) (mod v_main_~y~0_49 4294967296))) InVars {main_~x~0=v_main_~x~0_400, main_~y~0=v_main_~y~0_49} OutVars{main_~x~0=v_main_~x~0_400, main_~y~0=v_main_~y~0_49} AuxVars[] AssignedVars[] [2021-05-03 00:05:58,780 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:05:58,794 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:58,795 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:58,875 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:05:58,919 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:05:59,080 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:05:59,154 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:59,156 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_402 4294967296))) (and (< .cse0 (mod v_main_~y~0_50 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_402, main_~y~0=v_main_~y~0_50} OutVars{main_~x~0=v_main_~x~0_402, main_~y~0=v_main_~y~0_50} AuxVars[] AssignedVars[] [2021-05-03 00:05:59,157 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:05:59,172 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:59,174 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:05:59,264 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:05:59,270 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:05:59,296 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:05:59,333 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:05:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:59,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:05:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:05:59,408 INFO L134 CoverageAnalysis]: 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,687 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:00,687 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [89971792] [2021-05-03 00:06:00,687 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [89971792] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:00,688 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:00,688 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-03 00:06:00,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567573762] [2021-05-03 00:06:00,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-03 00:06:00,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:00,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-03 00:06:00,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:06:00,689 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-03 00:06:02,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:02,432 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2021-05-03 00:06:02,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-03 00:06:02,432 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-03 00:06:02,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:02,433 INFO L225 Difference]: With dead ends: 97 [2021-05-03 00:06:02,433 INFO L226 Difference]: Without dead ends: 89 [2021-05-03 00:06:02,433 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 7 SyntacticMatches, 49 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2103.4ms TimeCoverageRelationStatistics Valid=210, Invalid=2760, Unknown=0, NotChecked=0, Total=2970 [2021-05-03 00:06:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-03 00:06:02,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-05-03 00:06:02,443 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-03 00:06:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2021-05-03 00:06:02,443 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 83 [2021-05-03 00:06:02,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:02,443 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2021-05-03 00:06:02,443 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-03 00:06:02,443 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2021-05-03 00:06:02,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-05-03 00:06:02,444 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:02,444 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:02,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-05-03 00:06:02,444 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:02,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:02,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1939328460, now seen corresponding path program 25 times [2021-05-03 00:06:02,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:02,444 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1113886225] [2021-05-03 00:06:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:02,457 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_429 1) 4294967296) (mod v_main_~y~0_51 4294967296)) (< (mod v_main_~x~0_429 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_429, main_~y~0=v_main_~y~0_51} OutVars{main_~x~0=v_main_~x~0_429, main_~y~0=v_main_~y~0_51} AuxVars[] AssignedVars[] [2021-05-03 00:06:02,458 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:06:02,471 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:02,473 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:02,583 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:06:02,654 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:06:02,723 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:06:02,872 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:06:02,874 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:02,875 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_431 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_52 4294967296)))) InVars {main_~x~0=v_main_~x~0_431, main_~y~0=v_main_~y~0_52} OutVars{main_~x~0=v_main_~x~0_431, main_~y~0=v_main_~y~0_52} AuxVars[] AssignedVars[] [2021-05-03 00:06:02,876 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:06:02,877 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:02,878 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:02,939 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:06:02,946 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:06:02,989 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:06:03,031 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:03,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:06:04,482 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:04,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1113886225] [2021-05-03 00:06:04,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1113886225] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:04,482 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:04,482 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-03 00:06:04,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690047073] [2021-05-03 00:06:04,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-03 00:06:04,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:04,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-03 00:06:04,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2021-05-03 00:06:04,484 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-03 00:06:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:06,283 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2021-05-03 00:06:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-03 00:06:06,283 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-03 00:06:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:06,284 INFO L225 Difference]: With dead ends: 100 [2021-05-03 00:06:06,284 INFO L226 Difference]: Without dead ends: 92 [2021-05-03 00:06:06,284 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 6 SyntacticMatches, 52 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 2172.9ms TimeCoverageRelationStatistics Valid=218, Invalid=2974, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:06:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-05-03 00:06:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2021-05-03 00:06:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:06,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2021-05-03 00:06:06,294 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2021-05-03 00:06:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:06,294 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2021-05-03 00:06:06,294 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-03 00:06:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2021-05-03 00:06:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-03 00:06:06,295 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:06,295 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:06,295 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-05-03 00:06:06,295 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:06,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:06,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2076831716, now seen corresponding path program 26 times [2021-05-03 00:06:06,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:06,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [426646791] [2021-05-03 00:06:06,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:06,299 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_459 4294967296) 5000000) (< (mod (+ v_main_~x~0_459 1) 4294967296) (mod v_main_~y~0_53 4294967296))) InVars {main_~x~0=v_main_~x~0_459, main_~y~0=v_main_~y~0_53} OutVars{main_~x~0=v_main_~x~0_459, main_~y~0=v_main_~y~0_53} AuxVars[] AssignedVars[] [2021-05-03 00:06:06,300 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:06:06,314 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:06,315 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:06,397 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:06:06,426 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:06:06,538 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:06:06,639 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:06:06,641 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:06,642 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_461 4294967296))) (and (< .cse0 (mod v_main_~y~0_54 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_461, main_~y~0=v_main_~y~0_54} OutVars{main_~x~0=v_main_~x~0_461, main_~y~0=v_main_~y~0_54} AuxVars[] AssignedVars[] [2021-05-03 00:06:06,644 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:06:06,644 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:06,651 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:06,708 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:06:06,715 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:06:06,755 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:06:07,127 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:06:07,128 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:07,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:07,241 INFO L134 CoverageAnalysis]: 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:08,770 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:08,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [426646791] [2021-05-03 00:06:08,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [426646791] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:08,771 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:08,771 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-03 00:06:08,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739728151] [2021-05-03 00:06:08,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-03 00:06:08,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:08,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-03 00:06:08,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-05-03 00:06:08,772 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-03 00:06:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:10,796 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2021-05-03 00:06:10,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-03 00:06:10,796 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-03 00:06:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:10,797 INFO L225 Difference]: With dead ends: 103 [2021-05-03 00:06:10,797 INFO L226 Difference]: Without dead ends: 95 [2021-05-03 00:06:10,798 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 7 SyntacticMatches, 53 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2513.1ms TimeCoverageRelationStatistics Valid=226, Invalid=3196, Unknown=0, NotChecked=0, Total=3422 [2021-05-03 00:06:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-03 00:06:10,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2021-05-03 00:06:10,809 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-03 00:06:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2021-05-03 00:06:10,810 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 89 [2021-05-03 00:06:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:10,810 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2021-05-03 00:06:10,810 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-03 00:06:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2021-05-03 00:06:10,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-05-03 00:06:10,810 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:10,811 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:10,811 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-05-03 00:06:10,811 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:10,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:10,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1037530828, now seen corresponding path program 27 times [2021-05-03 00:06:10,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:10,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2027655197] [2021-05-03 00:06:10,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:10,816 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_490 1) 4294967296) (mod v_main_~y~0_55 4294967296)) (< (mod v_main_~x~0_490 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_490, main_~y~0=v_main_~y~0_55} OutVars{main_~x~0=v_main_~x~0_490, main_~y~0=v_main_~y~0_55} AuxVars[] AssignedVars[] [2021-05-03 00:06:10,818 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:06:10,819 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:10,821 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:10,896 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:06:10,912 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:06:10,996 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:06:11,311 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:06:11,313 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:11,314 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_492 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_56 4294967296)))) InVars {main_~x~0=v_main_~x~0_492, main_~y~0=v_main_~y~0_56} OutVars{main_~x~0=v_main_~x~0_492, main_~y~0=v_main_~y~0_56} AuxVars[] AssignedVars[] [2021-05-03 00:06:11,315 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:06:11,316 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:11,317 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:11,445 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:06:11,453 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:06:11,492 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:06:11,531 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:11,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:11,619 INFO L134 CoverageAnalysis]: 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:13,214 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:13,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2027655197] [2021-05-03 00:06:13,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2027655197] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:13,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:13,214 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-03 00:06:13,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004603841] [2021-05-03 00:06:13,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-03 00:06:13,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:13,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-03 00:06:13,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2021-05-03 00:06:13,215 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-03 00:06:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:15,380 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-05-03 00:06:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-03 00:06:15,381 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-03 00:06:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:15,381 INFO L225 Difference]: With dead ends: 106 [2021-05-03 00:06:15,381 INFO L226 Difference]: Without dead ends: 98 [2021-05-03 00:06:15,383 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 6 SyntacticMatches, 56 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 2595.3ms TimeCoverageRelationStatistics Valid=234, Invalid=3426, Unknown=0, NotChecked=0, Total=3660 [2021-05-03 00:06:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-03 00:06:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2021-05-03 00:06:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2021-05-03 00:06:15,393 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 92 [2021-05-03 00:06:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:15,393 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2021-05-03 00:06:15,393 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-03 00:06:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2021-05-03 00:06:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-03 00:06:15,394 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:15,394 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:15,394 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-05-03 00:06:15,394 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:15,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:15,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1644013284, now seen corresponding path program 28 times [2021-05-03 00:06:15,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:15,394 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1679524246] [2021-05-03 00:06:15,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:15,399 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_522 4294967296) 5000000) (< (mod (+ v_main_~x~0_522 1) 4294967296) (mod v_main_~y~0_57 4294967296))) InVars {main_~x~0=v_main_~x~0_522, main_~y~0=v_main_~y~0_57} OutVars{main_~x~0=v_main_~x~0_522, main_~y~0=v_main_~y~0_57} AuxVars[] AssignedVars[] [2021-05-03 00:06:15,400 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:06:15,403 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:15,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:15,823 WARN L205 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:06:15,867 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:06:15,896 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:06:16,039 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:06:16,108 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:06:16,214 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:06:16,216 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:16,217 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_524 4294967296))) (and (< .cse0 (mod v_main_~y~0_58 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_524, main_~y~0=v_main_~y~0_58} OutVars{main_~x~0=v_main_~x~0_524, main_~y~0=v_main_~y~0_58} AuxVars[] AssignedVars[] [2021-05-03 00:06:16,218 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:06:16,232 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:16,233 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:16,368 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:06:16,550 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:06:16,569 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:06:16,576 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:06:16,604 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:06:16,651 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:16,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:16,779 INFO L134 CoverageAnalysis]: 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:18,387 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:18,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1679524246] [2021-05-03 00:06:18,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1679524246] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:18,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:18,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-03 00:06:18,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132789511] [2021-05-03 00:06:18,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-03 00:06:18,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:18,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-03 00:06:18,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2021-05-03 00:06:18,388 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-03 00:06:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:20,559 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2021-05-03 00:06:20,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-03 00:06:20,560 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-03 00:06:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:20,560 INFO L225 Difference]: With dead ends: 109 [2021-05-03 00:06:20,560 INFO L226 Difference]: Without dead ends: 101 [2021-05-03 00:06:20,562 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 7 SyntacticMatches, 57 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 2595.3ms TimeCoverageRelationStatistics Valid=242, Invalid=3664, Unknown=0, NotChecked=0, Total=3906 [2021-05-03 00:06:20,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-03 00:06:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2021-05-03 00:06:20,572 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-03 00:06:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2021-05-03 00:06:20,572 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 95 [2021-05-03 00:06:20,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:20,573 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2021-05-03 00:06:20,573 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-03 00:06:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2021-05-03 00:06:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-05-03 00:06:20,573 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:20,573 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:20,573 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-05-03 00:06:20,573 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:20,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:20,573 INFO L82 PathProgramCache]: Analyzing trace with hash 435445708, now seen corresponding path program 29 times [2021-05-03 00:06:20,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:20,574 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1446643057] [2021-05-03 00:06:20,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:20,578 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_555 1) 4294967296) (mod v_main_~y~0_59 4294967296)) (< (mod v_main_~x~0_555 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_555, main_~y~0=v_main_~y~0_59} OutVars{main_~x~0=v_main_~x~0_555, main_~y~0=v_main_~y~0_59} AuxVars[] AssignedVars[] [2021-05-03 00:06:20,581 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:06:20,582 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:20,583 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:20,713 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:06:20,736 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:06:20,830 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:06:20,934 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:06:20,936 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:20,937 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_557 4294967296))) (and (< .cse0 (mod v_main_~y~0_60 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_557, main_~y~0=v_main_~y~0_60} OutVars{main_~x~0=v_main_~x~0_557, main_~y~0=v_main_~y~0_60} AuxVars[] AssignedVars[] [2021-05-03 00:06:20,938 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:06:20,964 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:20,966 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:21,027 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:06:21,039 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:06:21,080 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:06:21,117 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:21,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:21,185 INFO L134 CoverageAnalysis]: 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:22,961 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:22,961 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1446643057] [2021-05-03 00:06:22,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1446643057] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:22,961 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:22,962 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-03 00:06:22,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080975938] [2021-05-03 00:06:22,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-03 00:06:22,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:22,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-03 00:06:22,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2021-05-03 00:06:22,962 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-03 00:06:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:25,370 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2021-05-03 00:06:25,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-03 00:06:25,371 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-03 00:06:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:25,372 INFO L225 Difference]: With dead ends: 112 [2021-05-03 00:06:25,372 INFO L226 Difference]: Without dead ends: 104 [2021-05-03 00:06:25,373 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 7 SyntacticMatches, 59 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2861.6ms TimeCoverageRelationStatistics Valid=250, Invalid=3910, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:06:25,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-05-03 00:06:25,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2021-05-03 00:06:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:25,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2021-05-03 00:06:25,384 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2021-05-03 00:06:25,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:25,388 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2021-05-03 00:06:25,388 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-03 00:06:25,388 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2021-05-03 00:06:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-05-03 00:06:25,388 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:25,388 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:25,388 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2021-05-03 00:06:25,388 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:25,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:25,389 INFO L82 PathProgramCache]: Analyzing trace with hash 709631460, now seen corresponding path program 30 times [2021-05-03 00:06:25,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:25,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [400549394] [2021-05-03 00:06:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:25,393 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_589 4294967296) 5000000) (< (mod (+ v_main_~x~0_589 1) 4294967296) (mod v_main_~y~0_61 4294967296))) InVars {main_~x~0=v_main_~x~0_589, main_~y~0=v_main_~y~0_61} OutVars{main_~x~0=v_main_~x~0_589, main_~y~0=v_main_~y~0_61} AuxVars[] AssignedVars[] [2021-05-03 00:06:25,394 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:06:25,395 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:25,397 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:25,474 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:06:25,490 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:06:25,570 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:06:25,897 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:06:25,898 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:25,900 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_591 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_62 4294967296)))) InVars {main_~x~0=v_main_~x~0_591, main_~y~0=v_main_~y~0_62} OutVars{main_~x~0=v_main_~x~0_591, main_~y~0=v_main_~y~0_62} AuxVars[] AssignedVars[] [2021-05-03 00:06:25,901 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:06:25,902 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:25,910 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:26,203 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:06:26,234 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:06:26,241 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:06:26,276 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:06:26,311 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:26,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:26,412 INFO L134 CoverageAnalysis]: 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:28,174 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:28,174 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [400549394] [2021-05-03 00:06:28,174 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [400549394] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:28,174 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:28,174 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-03 00:06:28,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294461829] [2021-05-03 00:06:28,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-03 00:06:28,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:28,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-03 00:06:28,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2021-05-03 00:06:28,175 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-03 00:06:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:30,656 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2021-05-03 00:06:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-03 00:06:30,657 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-03 00:06:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:30,657 INFO L225 Difference]: With dead ends: 115 [2021-05-03 00:06:30,657 INFO L226 Difference]: Without dead ends: 107 [2021-05-03 00:06:30,658 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 7 SyntacticMatches, 61 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 2857.5ms TimeCoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2021-05-03 00:06:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-03 00:06:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2021-05-03 00:06:30,670 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-03 00:06:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2021-05-03 00:06:30,671 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 101 [2021-05-03 00:06:30,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:30,671 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2021-05-03 00:06:30,671 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-03 00:06:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2021-05-03 00:06:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-05-03 00:06:30,672 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:30,672 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:30,672 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-05-03 00:06:30,672 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:30,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:30,672 INFO L82 PathProgramCache]: Analyzing trace with hash -50427700, now seen corresponding path program 31 times [2021-05-03 00:06:30,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:30,672 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [211025769] [2021-05-03 00:06:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:30,677 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_624 1) 4294967296) (mod v_main_~y~0_63 4294967296)) (< (mod v_main_~x~0_624 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_624, main_~y~0=v_main_~y~0_63} OutVars{main_~x~0=v_main_~x~0_624, main_~y~0=v_main_~y~0_63} AuxVars[] AssignedVars[] [2021-05-03 00:06:30,679 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:06:30,694 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:30,695 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:30,822 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:06:30,845 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:06:30,903 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:06:30,993 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:30,994 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_626 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_64 4294967296)))) InVars {main_~x~0=v_main_~x~0_626, main_~y~0=v_main_~y~0_64} OutVars{main_~x~0=v_main_~x~0_626, main_~y~0=v_main_~y~0_64} AuxVars[] AssignedVars[] [2021-05-03 00:06:30,995 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:06:31,009 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:31,010 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:31,065 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:06:31,073 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:06:31,106 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:06:31,146 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:31,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:31,225 INFO L134 CoverageAnalysis]: 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:33,302 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:33,302 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [211025769] [2021-05-03 00:06:33,302 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [211025769] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:33,302 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:33,302 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-03 00:06:33,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579042502] [2021-05-03 00:06:33,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-03 00:06:33,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:33,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-03 00:06:33,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2021-05-03 00:06:33,304 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-03 00:06:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:36,062 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2021-05-03 00:06:36,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-03 00:06:36,063 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-03 00:06:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:36,064 INFO L225 Difference]: With dead ends: 118 [2021-05-03 00:06:36,064 INFO L226 Difference]: Without dead ends: 110 [2021-05-03 00:06:36,064 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 7 SyntacticMatches, 63 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 3308.6ms TimeCoverageRelationStatistics Valid=266, Invalid=4426, Unknown=0, NotChecked=0, Total=4692 [2021-05-03 00:06:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-05-03 00:06:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2021-05-03 00:06:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2021-05-03 00:06:36,077 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2021-05-03 00:06:36,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:36,077 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2021-05-03 00:06:36,077 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-03 00:06:36,077 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2021-05-03 00:06:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-03 00:06:36,077 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:36,077 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:36,077 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-05-03 00:06:36,077 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:36,078 INFO L82 PathProgramCache]: Analyzing trace with hash 94721252, now seen corresponding path program 32 times [2021-05-03 00:06:36,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:36,078 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1624109655] [2021-05-03 00:06:36,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:36,085 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_660 4294967296) 5000000) (< (mod (+ v_main_~x~0_660 1) 4294967296) (mod v_main_~y~0_65 4294967296))) InVars {main_~x~0=v_main_~x~0_660, main_~y~0=v_main_~y~0_65} OutVars{main_~x~0=v_main_~x~0_660, main_~y~0=v_main_~y~0_65} AuxVars[] AssignedVars[] [2021-05-03 00:06:36,086 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:06:36,087 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:36,089 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:36,205 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:06:36,225 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:06:36,318 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:06:38,435 WARN L205 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:06:38,437 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:38,438 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_662 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_66 4294967296)))) InVars {main_~x~0=v_main_~x~0_662, main_~y~0=v_main_~y~0_66} OutVars{main_~x~0=v_main_~x~0_662, main_~y~0=v_main_~y~0_66} AuxVars[] AssignedVars[] [2021-05-03 00:06:38,439 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:06:38,440 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:38,441 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:38,707 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:06:38,743 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:06:38,752 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:06:38,795 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:06:38,840 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:38,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:38,931 INFO L134 CoverageAnalysis]: 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:40,989 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:40,989 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1624109655] [2021-05-03 00:06:40,989 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1624109655] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:40,989 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:40,989 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-03 00:06:40,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149014302] [2021-05-03 00:06:40,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-03 00:06:40,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:40,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-03 00:06:40,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2021-05-03 00:06:40,990 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-03 00:06:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:43,760 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2021-05-03 00:06:43,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-03 00:06:43,761 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-03 00:06:43,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:43,762 INFO L225 Difference]: With dead ends: 121 [2021-05-03 00:06:43,762 INFO L226 Difference]: Without dead ends: 113 [2021-05-03 00:06:43,762 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 6 SyntacticMatches, 66 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 3258.9ms TimeCoverageRelationStatistics Valid=274, Invalid=4696, Unknown=0, NotChecked=0, Total=4970 [2021-05-03 00:06:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-03 00:06:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2021-05-03 00:06:43,775 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-03 00:06:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2021-05-03 00:06:43,775 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 107 [2021-05-03 00:06:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:43,775 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2021-05-03 00:06:43,776 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-03 00:06:43,776 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2021-05-03 00:06:43,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-05-03 00:06:43,776 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:43,776 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:43,776 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-05-03 00:06:43,776 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:43,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:43,776 INFO L82 PathProgramCache]: Analyzing trace with hash -804916788, now seen corresponding path program 33 times [2021-05-03 00:06:43,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:43,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1954517442] [2021-05-03 00:06:43,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:43,782 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_697 1) 4294967296) (mod v_main_~y~0_67 4294967296)) (< (mod v_main_~x~0_697 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_697, main_~y~0=v_main_~y~0_67} OutVars{main_~x~0=v_main_~x~0_697, main_~y~0=v_main_~y~0_67} AuxVars[] AssignedVars[] [2021-05-03 00:06:43,785 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:06:43,786 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:43,788 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:43,856 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:06:43,885 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:06:43,954 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:06:44,046 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:44,047 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_699 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_68 4294967296)))) InVars {main_~x~0=v_main_~x~0_699, main_~y~0=v_main_~y~0_68} OutVars{main_~x~0=v_main_~x~0_699, main_~y~0=v_main_~y~0_68} AuxVars[] AssignedVars[] [2021-05-03 00:06:44,049 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:06:44,060 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:44,062 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:44,106 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:06:44,114 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:06:44,139 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:06:44,196 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:44,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:44,281 INFO L134 CoverageAnalysis]: 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:46,598 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:46,598 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1954517442] [2021-05-03 00:06:46,598 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1954517442] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:46,598 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:46,598 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-03 00:06:46,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643614028] [2021-05-03 00:06:46,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-03 00:06:46,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:46,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-03 00:06:46,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2021-05-03 00:06:46,599 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-03 00:06:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:49,722 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2021-05-03 00:06:49,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-03 00:06:49,722 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-03 00:06:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:49,723 INFO L225 Difference]: With dead ends: 124 [2021-05-03 00:06:49,723 INFO L226 Difference]: Without dead ends: 116 [2021-05-03 00:06:49,723 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 6 SyntacticMatches, 68 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 3688.1ms TimeCoverageRelationStatistics Valid=282, Invalid=4974, Unknown=0, NotChecked=0, Total=5256 [2021-05-03 00:06:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-05-03 00:06:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-05-03 00:06:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2021-05-03 00:06:49,737 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2021-05-03 00:06:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:49,737 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2021-05-03 00:06:49,737 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-03 00:06:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2021-05-03 00:06:49,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-03 00:06:49,738 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:49,738 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:49,738 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-05-03 00:06:49,738 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:49,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:49,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1325839388, now seen corresponding path program 34 times [2021-05-03 00:06:49,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:49,739 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [835897993] [2021-05-03 00:06:49,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:49,754 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_735 4294967296) 5000000) (< (mod (+ v_main_~x~0_735 1) 4294967296) (mod v_main_~y~0_69 4294967296))) InVars {main_~x~0=v_main_~x~0_735, main_~y~0=v_main_~y~0_69} OutVars{main_~x~0=v_main_~x~0_735, main_~y~0=v_main_~y~0_69} AuxVars[] AssignedVars[] [2021-05-03 00:06:49,756 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:06:49,774 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:49,775 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:49,912 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:06:49,933 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:06:50,034 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:06:50,163 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:06:50,164 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:50,166 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_737 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_70 4294967296)))) InVars {main_~x~0=v_main_~x~0_737, main_~y~0=v_main_~y~0_70} OutVars{main_~x~0=v_main_~x~0_737, main_~y~0=v_main_~y~0_70} AuxVars[] AssignedVars[] [2021-05-03 00:06:50,167 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:06:50,179 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:50,181 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:50,308 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:06:50,316 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:06:50,347 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:06:50,398 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:50,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:50,553 INFO L134 CoverageAnalysis]: 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:52,877 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:06:52,877 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [835897993] [2021-05-03 00:06:52,877 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [835897993] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:06:52,877 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:06:52,877 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-03 00:06:52,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801598231] [2021-05-03 00:06:52,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-03 00:06:52,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:06:52,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-03 00:06:52,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2021-05-03 00:06:52,878 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 38 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:06:56,088 INFO L93 Difference]: Finished difference Result 127 states and 131 transitions. [2021-05-03 00:06:56,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-03 00:06:56,089 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 38 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2021-05-03 00:06:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:06:56,089 INFO L225 Difference]: With dead ends: 127 [2021-05-03 00:06:56,090 INFO L226 Difference]: Without dead ends: 119 [2021-05-03 00:06:56,090 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 6 SyntacticMatches, 70 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 3764.7ms TimeCoverageRelationStatistics Valid=290, Invalid=5260, Unknown=0, NotChecked=0, Total=5550 [2021-05-03 00:06:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-03 00:06:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2021-05-03 00:06:56,104 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-03 00:06:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2021-05-03 00:06:56,104 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 113 [2021-05-03 00:06:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:06:56,105 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2021-05-03 00:06:56,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 2.7948717948717947) internal successors, (109), 38 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:06:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2021-05-03 00:06:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-05-03 00:06:56,105 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:06:56,105 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:06:56,105 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-05-03 00:06:56,105 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:06:56,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:06:56,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1880791756, now seen corresponding path program 35 times [2021-05-03 00:06:56,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:06:56,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [324441307] [2021-05-03 00:06:56,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:06:56,112 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_774 1) 4294967296) (mod v_main_~y~0_71 4294967296)) (< (mod v_main_~x~0_774 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_774, main_~y~0=v_main_~y~0_71} OutVars{main_~x~0=v_main_~x~0_774, main_~y~0=v_main_~y~0_71} AuxVars[] AssignedVars[] [2021-05-03 00:06:56,113 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:06:56,127 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:56,129 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:56,200 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:06:56,223 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:06:56,496 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:06:56,503 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:06:56,583 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:56,584 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_776 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_72 4294967296)))) InVars {main_~x~0=v_main_~x~0_776, main_~y~0=v_main_~y~0_72} OutVars{main_~x~0=v_main_~x~0_776, main_~y~0=v_main_~y~0_72} AuxVars[] AssignedVars[] [2021-05-03 00:06:56,592 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:06:56,607 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:56,616 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:06:58,719 WARN L205 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:06:58,741 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:06:58,749 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:06:58,782 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:06:58,833 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:06:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:58,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:06:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:06:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:01,450 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:01,450 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [324441307] [2021-05-03 00:07:01,450 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [324441307] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:01,450 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:01,450 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-03 00:07:01,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719591984] [2021-05-03 00:07:01,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-03 00:07:01,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:01,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-03 00:07:01,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2021-05-03 00:07:01,451 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-03 00:07:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:04,875 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2021-05-03 00:07:04,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-03 00:07:04,876 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-03 00:07:04,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:04,877 INFO L225 Difference]: With dead ends: 130 [2021-05-03 00:07:04,877 INFO L226 Difference]: Without dead ends: 122 [2021-05-03 00:07:04,877 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 7 SyntacticMatches, 71 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 3967.9ms TimeCoverageRelationStatistics Valid=298, Invalid=5554, Unknown=0, NotChecked=0, Total=5852 [2021-05-03 00:07:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-05-03 00:07:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2021-05-03 00:07:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2021-05-03 00:07:04,892 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 116 [2021-05-03 00:07:04,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:04,892 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2021-05-03 00:07:04,892 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-03 00:07:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2021-05-03 00:07:04,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-05-03 00:07:04,893 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:04,893 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:04,893 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-05-03 00:07:04,893 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:04,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:04,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1966605028, now seen corresponding path program 36 times [2021-05-03 00:07:04,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:04,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1372822472] [2021-05-03 00:07:04,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:04,900 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_814 4294967296) 5000000) (< (mod (+ v_main_~x~0_814 1) 4294967296) (mod v_main_~y~0_73 4294967296))) InVars {main_~x~0=v_main_~x~0_814, main_~y~0=v_main_~y~0_73} OutVars{main_~x~0=v_main_~x~0_814, main_~y~0=v_main_~y~0_73} AuxVars[] AssignedVars[] [2021-05-03 00:07:04,901 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:07:04,915 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:04,917 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:05,345 WARN L205 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:07:05,400 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:07:05,429 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:07:05,619 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:07:05,689 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:05,690 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_816 4294967296))) (and (< .cse0 (mod v_main_~y~0_74 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_816, main_~y~0=v_main_~y~0_74} OutVars{main_~x~0=v_main_~x~0_816, main_~y~0=v_main_~y~0_74} AuxVars[] AssignedVars[] [2021-05-03 00:07:05,691 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:07:05,692 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:05,693 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:05,801 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:07:05,808 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:07:05,862 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:07:05,906 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:06,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:08,650 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:08,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1372822472] [2021-05-03 00:07:08,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1372822472] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:08,651 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:08,651 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-03 00:07:08,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249706202] [2021-05-03 00:07:08,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-03 00:07:08,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:08,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-03 00:07:08,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2021-05-03 00:07:08,652 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 41 states, 41 states have (on average 2.8048780487804876) internal successors, (115), 40 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:12,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:12,332 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2021-05-03 00:07:12,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-03 00:07:12,333 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.8048780487804876) internal successors, (115), 40 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2021-05-03 00:07:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:12,335 INFO L225 Difference]: With dead ends: 133 [2021-05-03 00:07:12,335 INFO L226 Difference]: Without dead ends: 125 [2021-05-03 00:07:12,335 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 6 SyntacticMatches, 74 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 4207.8ms TimeCoverageRelationStatistics Valid=306, Invalid=5856, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:07:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-05-03 00:07:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2021-05-03 00:07:12,350 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-03 00:07:12,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2021-05-03 00:07:12,351 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 119 [2021-05-03 00:07:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:12,351 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2021-05-03 00:07:12,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 2.8048780487804876) internal successors, (115), 40 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:12,351 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2021-05-03 00:07:12,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-05-03 00:07:12,351 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:12,351 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:12,351 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-05-03 00:07:12,352 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:12,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:12,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1370717236, now seen corresponding path program 37 times [2021-05-03 00:07:12,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:12,352 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1214755078] [2021-05-03 00:07:12,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:12,361 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_855 1) 4294967296) (mod v_main_~y~0_75 4294967296)) (< (mod v_main_~x~0_855 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_855, main_~y~0=v_main_~y~0_75} OutVars{main_~x~0=v_main_~x~0_855, main_~y~0=v_main_~y~0_75} AuxVars[] AssignedVars[] [2021-05-03 00:07:12,362 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:07:12,363 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:12,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:12,475 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:07:12,511 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:07:12,688 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:07:12,808 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:07:12,810 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:12,812 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_857 4294967296))) (and (< .cse0 (mod v_main_~y~0_76 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_857, main_~y~0=v_main_~y~0_76} OutVars{main_~x~0=v_main_~x~0_857, main_~y~0=v_main_~y~0_76} AuxVars[] AssignedVars[] [2021-05-03 00:07:12,813 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:07:12,828 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:12,830 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:13,284 WARN L205 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:07:13,308 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:07:13,317 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:07:13,381 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:07:13,425 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:13,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:16,864 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:16,865 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1214755078] [2021-05-03 00:07:16,865 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1214755078] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:16,865 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:16,865 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-03 00:07:16,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301090639] [2021-05-03 00:07:16,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-03 00:07:16,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:16,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-03 00:07:16,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2021-05-03 00:07:16,866 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-03 00:07:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:21,353 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-05-03 00:07:21,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-03 00:07:21,353 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-03 00:07:21,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:21,354 INFO L225 Difference]: With dead ends: 136 [2021-05-03 00:07:21,354 INFO L226 Difference]: Without dead ends: 128 [2021-05-03 00:07:21,354 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 7 SyntacticMatches, 75 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 5237.0ms TimeCoverageRelationStatistics Valid=314, Invalid=6166, Unknown=0, NotChecked=0, Total=6480 [2021-05-03 00:07:21,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-05-03 00:07:21,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2021-05-03 00:07:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2021-05-03 00:07:21,370 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2021-05-03 00:07:21,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:21,370 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2021-05-03 00:07:21,370 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-03 00:07:21,370 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2021-05-03 00:07:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-03 00:07:21,371 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:21,371 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:21,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-05-03 00:07:21,371 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:21,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:21,371 INFO L82 PathProgramCache]: Analyzing trace with hash 659651044, now seen corresponding path program 38 times [2021-05-03 00:07:21,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:21,371 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [26803932] [2021-05-03 00:07:21,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:21,376 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_897 4294967296) 5000000) (< (mod (+ v_main_~x~0_897 1) 4294967296) (mod v_main_~y~0_77 4294967296))) InVars {main_~x~0=v_main_~x~0_897, main_~y~0=v_main_~y~0_77} OutVars{main_~x~0=v_main_~x~0_897, main_~y~0=v_main_~y~0_77} AuxVars[] AssignedVars[] [2021-05-03 00:07:21,378 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:07:21,379 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:21,380 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:21,454 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:07:21,471 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:07:21,560 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:07:21,668 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:07:21,670 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:21,671 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_899 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_78 4294967296)))) InVars {main_~x~0=v_main_~x~0_899, main_~y~0=v_main_~y~0_78} OutVars{main_~x~0=v_main_~x~0_899, main_~y~0=v_main_~y~0_78} AuxVars[] AssignedVars[] [2021-05-03 00:07:21,672 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:07:21,673 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:21,675 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:21,723 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:07:21,732 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:07:21,799 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:07:21,846 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:21,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:21,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:07:25,072 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:25,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [26803932] [2021-05-03 00:07:25,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [26803932] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:25,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:25,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-03 00:07:25,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597401120] [2021-05-03 00:07:25,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-03 00:07:25,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:25,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-03 00:07:25,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2021-05-03 00:07:25,074 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-03 00:07:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:29,185 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2021-05-03 00:07:29,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-03 00:07:29,186 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-03 00:07:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:29,187 INFO L225 Difference]: With dead ends: 139 [2021-05-03 00:07:29,187 INFO L226 Difference]: Without dead ends: 131 [2021-05-03 00:07:29,187 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 6 SyntacticMatches, 78 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 4904.1ms TimeCoverageRelationStatistics Valid=322, Invalid=6484, Unknown=0, NotChecked=0, Total=6806 [2021-05-03 00:07:29,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-03 00:07:29,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2021-05-03 00:07:29,203 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-03 00:07:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2021-05-03 00:07:29,204 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 125 [2021-05-03 00:07:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:29,204 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2021-05-03 00:07:29,204 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-03 00:07:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2021-05-03 00:07:29,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-05-03 00:07:29,205 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:29,205 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:29,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-05-03 00:07:29,205 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:29,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:29,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1336650956, now seen corresponding path program 39 times [2021-05-03 00:07:29,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:29,205 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [378022188] [2021-05-03 00:07:29,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:29,211 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_940 4294967296) 5000000) (< (mod (+ v_main_~x~0_940 1) 4294967296) (mod v_main_~y~0_79 4294967296))) InVars {main_~x~0=v_main_~x~0_940, main_~y~0=v_main_~y~0_79} OutVars{main_~x~0=v_main_~x~0_940, main_~y~0=v_main_~y~0_79} AuxVars[] AssignedVars[] [2021-05-03 00:07:29,213 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:07:29,213 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:29,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:29,337 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:07:29,367 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:07:29,471 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:07:29,572 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:29,573 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_942 4294967296))) (and (< .cse0 (mod v_main_~y~0_80 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_942, main_~y~0=v_main_~y~0_80} OutVars{main_~x~0=v_main_~x~0_942, main_~y~0=v_main_~y~0_80} AuxVars[] AssignedVars[] [2021-05-03 00:07:29,575 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:07:29,588 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:29,589 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:29,671 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:07:29,679 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:07:29,704 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:07:29,741 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:29,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:33,227 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:33,227 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [378022188] [2021-05-03 00:07:33,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [378022188] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:33,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:33,228 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-03 00:07:33,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789477422] [2021-05-03 00:07:33,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-03 00:07:33,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:33,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-03 00:07:33,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2021-05-03 00:07:33,229 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-03 00:07:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:37,784 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2021-05-03 00:07:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-03 00:07:37,784 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-03 00:07:37,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:37,785 INFO L225 Difference]: With dead ends: 142 [2021-05-03 00:07:37,785 INFO L226 Difference]: Without dead ends: 134 [2021-05-03 00:07:37,786 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 7 SyntacticMatches, 79 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 5305.9ms TimeCoverageRelationStatistics Valid=330, Invalid=6810, Unknown=0, NotChecked=0, Total=7140 [2021-05-03 00:07:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-05-03 00:07:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2021-05-03 00:07:37,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:37,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2021-05-03 00:07:37,803 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 128 [2021-05-03 00:07:37,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:37,803 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2021-05-03 00:07:37,803 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-03 00:07:37,803 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2021-05-03 00:07:37,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-05-03 00:07:37,804 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:37,804 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:37,804 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-05-03 00:07:37,804 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:37,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:37,804 INFO L82 PathProgramCache]: Analyzing trace with hash 674607332, now seen corresponding path program 40 times [2021-05-03 00:07:37,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:37,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1784062235] [2021-05-03 00:07:37,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:37,810 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_984 4294967296) 5000000) (< (mod (+ v_main_~x~0_984 1) 4294967296) (mod v_main_~y~0_81 4294967296))) InVars {main_~x~0=v_main_~x~0_984, main_~y~0=v_main_~y~0_81} OutVars{main_~x~0=v_main_~x~0_984, main_~y~0=v_main_~y~0_81} AuxVars[] AssignedVars[] [2021-05-03 00:07:37,812 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:07:37,834 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:37,836 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:38,048 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:07:38,094 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:07:38,228 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-05-03 00:07:38,228 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:07:38,426 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:07:38,658 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:07:38,659 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:38,661 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_986 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_82 4294967296)))) InVars {main_~x~0=v_main_~x~0_986, main_~y~0=v_main_~y~0_82} OutVars{main_~x~0=v_main_~x~0_986, main_~y~0=v_main_~y~0_82} AuxVars[] AssignedVars[] [2021-05-03 00:07:38,662 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:07:38,676 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:38,677 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:38,802 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:07:38,874 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:07:38,883 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:07:38,913 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:07:38,954 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:39,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:39,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-03 00:07:42,889 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:42,889 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1784062235] [2021-05-03 00:07:42,889 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1784062235] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:42,889 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:42,889 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-03 00:07:42,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276849197] [2021-05-03 00:07:42,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-03 00:07:42,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:42,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-03 00:07:42,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2021-05-03 00:07:42,890 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-03 00:07:48,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:48,235 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2021-05-03 00:07:48,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-03 00:07:48,236 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-03 00:07:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:48,237 INFO L225 Difference]: With dead ends: 145 [2021-05-03 00:07:48,237 INFO L226 Difference]: Without dead ends: 137 [2021-05-03 00:07:48,238 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 6 SyntacticMatches, 82 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 6038.4ms TimeCoverageRelationStatistics Valid=338, Invalid=7144, Unknown=0, NotChecked=0, Total=7482 [2021-05-03 00:07:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-03 00:07:48,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2021-05-03 00:07:48,255 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-03 00:07:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2021-05-03 00:07:48,256 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 131 [2021-05-03 00:07:48,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:48,256 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2021-05-03 00:07:48,256 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-03 00:07:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2021-05-03 00:07:48,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-05-03 00:07:48,256 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:48,257 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:48,257 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-05-03 00:07:48,257 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:48,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:48,257 INFO L82 PathProgramCache]: Analyzing trace with hash 222827980, now seen corresponding path program 41 times [2021-05-03 00:07:48,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:48,257 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [352489749] [2021-05-03 00:07:48,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:48,264 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1029 1) 4294967296) (mod v_main_~y~0_83 4294967296)) (< (mod v_main_~x~0_1029 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1029, main_~y~0=v_main_~y~0_83} OutVars{main_~x~0=v_main_~x~0_1029, main_~y~0=v_main_~y~0_83} AuxVars[] AssignedVars[] [2021-05-03 00:07:48,265 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:07:48,266 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:48,268 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:48,401 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:07:48,421 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:07:48,635 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:07:48,763 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:07:48,764 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:48,766 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1031 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_84 4294967296)))) InVars {main_~x~0=v_main_~x~0_1031, main_~y~0=v_main_~y~0_84} OutVars{main_~x~0=v_main_~x~0_1031, main_~y~0=v_main_~y~0_84} AuxVars[] AssignedVars[] [2021-05-03 00:07:48,768 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:07:48,785 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:48,795 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:48,893 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:07:48,902 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:07:48,944 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:07:49,161 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:07:49,163 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:49,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:07:53,275 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:07:53,275 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [352489749] [2021-05-03 00:07:53,276 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [352489749] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:07:53,276 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:07:53,276 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-03 00:07:53,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499754785] [2021-05-03 00:07:53,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-03 00:07:53,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:07:53,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-03 00:07:53,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2021-05-03 00:07:53,277 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand has 46 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 45 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-03 00:07:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:07:58,712 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2021-05-03 00:07:58,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-03 00:07:58,713 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 45 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-03 00:07:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:07:58,714 INFO L225 Difference]: With dead ends: 148 [2021-05-03 00:07:58,714 INFO L226 Difference]: Without dead ends: 140 [2021-05-03 00:07:58,715 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 6 SyntacticMatches, 84 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 6142.9ms TimeCoverageRelationStatistics Valid=346, Invalid=7486, Unknown=0, NotChecked=0, Total=7832 [2021-05-03 00:07:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-05-03 00:07:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2021-05-03 00:07:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:07:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2021-05-03 00:07:58,734 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2021-05-03 00:07:58,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:07:58,734 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2021-05-03 00:07:58,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 2.8260869565217392) internal successors, (130), 45 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-03 00:07:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2021-05-03 00:07:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-05-03 00:07:58,735 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:07:58,735 INFO L523 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:07:58,735 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-05-03 00:07:58,735 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:07:58,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:07:58,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1691658212, now seen corresponding path program 42 times [2021-05-03 00:07:58,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:07:58,736 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1756893231] [2021-05-03 00:07:58,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:07:58,743 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1075 1) 4294967296) (mod v_main_~y~0_85 4294967296)) (< (mod v_main_~x~0_1075 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1075, main_~y~0=v_main_~y~0_85} OutVars{main_~x~0=v_main_~x~0_1075, main_~y~0=v_main_~y~0_85} AuxVars[] AssignedVars[] [2021-05-03 00:07:58,744 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:07:58,746 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:58,748 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:58,845 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:07:58,865 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:07:59,015 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:07:59,151 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:07:59,153 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:59,155 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1077 4294967296))) (and (< .cse0 (mod v_main_~y~0_86 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1077, main_~y~0=v_main_~y~0_86} OutVars{main_~x~0=v_main_~x~0_1077, main_~y~0=v_main_~y~0_86} AuxVars[] AssignedVars[] [2021-05-03 00:07:59,156 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:07:59,174 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:59,176 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:07:59,448 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:07:59,449 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:07:59,487 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:07:59,529 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:07:59,592 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:07:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:59,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:07:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:07:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:08:04,352 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:04,353 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1756893231] [2021-05-03 00:08:04,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1756893231] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:04,353 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:04,353 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-03 00:08:04,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13156087] [2021-05-03 00:08:04,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-03 00:08:04,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:04,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-03 00:08:04,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2021-05-03 00:08:04,354 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-03 00:08:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:10,782 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2021-05-03 00:08:10,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-03 00:08:10,783 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-03 00:08:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:10,783 INFO L225 Difference]: With dead ends: 151 [2021-05-03 00:08:10,784 INFO L226 Difference]: Without dead ends: 143 [2021-05-03 00:08:10,784 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 6 SyntacticMatches, 86 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 7297.4ms TimeCoverageRelationStatistics Valid=354, Invalid=7836, Unknown=0, NotChecked=0, Total=8190 [2021-05-03 00:08:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-03 00:08:10,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2021-05-03 00:08:10,803 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-03 00:08:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2021-05-03 00:08:10,803 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 137 [2021-05-03 00:08:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:10,803 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2021-05-03 00:08:10,803 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-03 00:08:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2021-05-03 00:08:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-05-03 00:08:10,804 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:10,804 INFO L523 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:10,804 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-05-03 00:08:10,804 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:10,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:10,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1808679220, now seen corresponding path program 43 times [2021-05-03 00:08:10,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:10,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1359091864] [2021-05-03 00:08:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:10,811 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1122 4294967296) 5000000) (< (mod (+ v_main_~x~0_1122 1) 4294967296) (mod v_main_~y~0_87 4294967296))) InVars {main_~x~0=v_main_~x~0_1122, main_~y~0=v_main_~y~0_87} OutVars{main_~x~0=v_main_~x~0_1122, main_~y~0=v_main_~y~0_87} AuxVars[] AssignedVars[] [2021-05-03 00:08:10,813 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:08:10,814 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:10,816 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:10,940 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:08:10,995 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:08:11,200 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2021-05-03 00:08:11,260 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:08:11,514 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:08:11,516 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:11,518 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1124 4294967296))) (and (< .cse0 (mod v_main_~y~0_88 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1124, main_~y~0=v_main_~y~0_88} OutVars{main_~x~0=v_main_~x~0_1124, main_~y~0=v_main_~y~0_88} AuxVars[] AssignedVars[] [2021-05-03 00:08:11,520 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:08:11,521 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:11,522 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:11,591 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:08:11,604 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:08:11,677 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:08:11,734 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:11,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:08:16,960 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:16,960 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1359091864] [2021-05-03 00:08:16,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1359091864] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:16,961 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:16,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-03 00:08:16,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650350745] [2021-05-03 00:08:16,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-03 00:08:16,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:16,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-03 00:08:16,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2021-05-03 00:08:16,962 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-03 00:08:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:23,795 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2021-05-03 00:08:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-03 00:08:23,796 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-03 00:08:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:23,797 INFO L225 Difference]: With dead ends: 154 [2021-05-03 00:08:23,797 INFO L226 Difference]: Without dead ends: 146 [2021-05-03 00:08:23,797 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 7 SyntacticMatches, 87 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 7835.4ms TimeCoverageRelationStatistics Valid=362, Invalid=8194, Unknown=0, NotChecked=0, Total=8556 [2021-05-03 00:08:23,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-05-03 00:08:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2021-05-03 00:08:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2021-05-03 00:08:23,818 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 140 [2021-05-03 00:08:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:23,818 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2021-05-03 00:08:23,818 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-03 00:08:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2021-05-03 00:08:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-03 00:08:23,818 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:23,819 INFO L523 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:23,819 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2021-05-03 00:08:23,819 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:23,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1444830948, now seen corresponding path program 44 times [2021-05-03 00:08:23,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:23,819 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1744784013] [2021-05-03 00:08:23,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:23,837 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1170 1) 4294967296) (mod v_main_~y~0_89 4294967296)) (< (mod v_main_~x~0_1170 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1170, main_~y~0=v_main_~y~0_89} OutVars{main_~x~0=v_main_~x~0_1170, main_~y~0=v_main_~y~0_89} AuxVars[] AssignedVars[] [2021-05-03 00:08:23,839 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:08:23,840 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:23,842 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:23,965 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:08:24,008 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:08:24,161 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:08:24,287 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:08:24,289 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:24,291 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1172 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_90 4294967296)))) InVars {main_~x~0=v_main_~x~0_1172, main_~y~0=v_main_~y~0_90} OutVars{main_~x~0=v_main_~x~0_1172, main_~y~0=v_main_~y~0_90} AuxVars[] AssignedVars[] [2021-05-03 00:08:24,292 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:08:24,293 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:24,295 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:24,436 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:08:24,451 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:08:24,579 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:08:24,645 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:24,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:08:29,821 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:29,821 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1744784013] [2021-05-03 00:08:29,821 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1744784013] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:29,821 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:29,821 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-03 00:08:29,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841799560] [2021-05-03 00:08:29,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-03 00:08:29,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:29,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-03 00:08:29,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2021-05-03 00:08:29,822 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-03 00:08:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:36,841 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2021-05-03 00:08:36,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-03 00:08:36,842 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-03 00:08:36,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:36,843 INFO L225 Difference]: With dead ends: 157 [2021-05-03 00:08:36,843 INFO L226 Difference]: Without dead ends: 149 [2021-05-03 00:08:36,843 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 6 SyntacticMatches, 90 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 7699.4ms TimeCoverageRelationStatistics Valid=370, Invalid=8560, Unknown=0, NotChecked=0, Total=8930 [2021-05-03 00:08:36,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-05-03 00:08:36,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2021-05-03 00:08:36,864 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-03 00:08:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2021-05-03 00:08:36,864 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 143 [2021-05-03 00:08:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:36,864 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2021-05-03 00:08:36,864 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-03 00:08:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2021-05-03 00:08:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-05-03 00:08:36,865 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:36,865 INFO L523 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:36,865 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-05-03 00:08:36,865 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:36,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:36,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2055690292, now seen corresponding path program 45 times [2021-05-03 00:08:36,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:36,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1526828864] [2021-05-03 00:08:36,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:36,875 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1219 1) 4294967296) (mod v_main_~y~0_91 4294967296)) (< (mod v_main_~x~0_1219 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1219, main_~y~0=v_main_~y~0_91} OutVars{main_~x~0=v_main_~x~0_1219, main_~y~0=v_main_~y~0_91} AuxVars[] AssignedVars[] [2021-05-03 00:08:36,877 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:08:36,898 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:36,900 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:36,992 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:08:37,010 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:08:37,080 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:08:37,291 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:08:37,294 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:37,296 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1221 4294967296))) (and (< .cse0 (mod v_main_~y~0_92 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1221, main_~y~0=v_main_~y~0_92} OutVars{main_~x~0=v_main_~x~0_1221, main_~y~0=v_main_~y~0_92} AuxVars[] AssignedVars[] [2021-05-03 00:08:37,298 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:08:37,300 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:37,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:37,774 WARN L205 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:08:37,792 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:08:37,803 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:08:37,862 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:08:37,931 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:38,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:08:43,886 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:08:43,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1526828864] [2021-05-03 00:08:43,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1526828864] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:08:43,887 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:08:43,887 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-03 00:08:43,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274550049] [2021-05-03 00:08:43,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-03 00:08:43,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:08:43,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-03 00:08:43,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2021-05-03 00:08:43,888 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand has 50 states, 50 states have (on average 2.84) internal successors, (142), 49 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-03 00:08:52,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:08:52,921 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2021-05-03 00:08:52,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-03 00:08:52,923 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 49 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-03 00:08:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:08:52,923 INFO L225 Difference]: With dead ends: 160 [2021-05-03 00:08:52,923 INFO L226 Difference]: Without dead ends: 152 [2021-05-03 00:08:52,924 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 6 SyntacticMatches, 92 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 9325.2ms TimeCoverageRelationStatistics Valid=378, Invalid=8934, Unknown=0, NotChecked=0, Total=9312 [2021-05-03 00:08:52,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-05-03 00:08:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2021-05-03 00:08:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:08:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2021-05-03 00:08:52,978 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 146 [2021-05-03 00:08:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:08:52,979 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2021-05-03 00:08:52,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 50 states have (on average 2.84) internal successors, (142), 49 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-03 00:08:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2021-05-03 00:08:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-05-03 00:08:52,979 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:08:52,979 INFO L523 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:08:52,979 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-05-03 00:08:52,979 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:08:52,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:08:52,980 INFO L82 PathProgramCache]: Analyzing trace with hash 16963044, now seen corresponding path program 46 times [2021-05-03 00:08:52,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:08:52,980 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1490282614] [2021-05-03 00:08:52,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:08:53,001 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1269 4294967296) 5000000) (< (mod (+ v_main_~x~0_1269 1) 4294967296) (mod v_main_~y~0_93 4294967296))) InVars {main_~x~0=v_main_~x~0_1269, main_~y~0=v_main_~y~0_93} OutVars{main_~x~0=v_main_~x~0_1269, main_~y~0=v_main_~y~0_93} AuxVars[] AssignedVars[] [2021-05-03 00:08:53,003 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:08:53,036 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:53,039 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:53,249 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:08:53,295 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:08:53,348 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:08:53,499 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:08:53,981 WARN L205 SmtUtils]: Spent 481.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:08:53,983 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:53,986 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1271 4294967296))) (and (< .cse0 (mod v_main_~y~0_94 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1271, main_~y~0=v_main_~y~0_94} OutVars{main_~x~0=v_main_~x~0_1271, main_~y~0=v_main_~y~0_94} AuxVars[] AssignedVars[] [2021-05-03 00:08:53,988 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:08:54,010 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:54,012 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:08:54,136 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:08:54,150 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:08:54,208 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:08:54,296 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:08:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:54,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:08:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:08:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:09:00,910 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:00,910 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1490282614] [2021-05-03 00:09:00,911 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1490282614] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:00,911 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:00,911 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-05-03 00:09:00,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749007016] [2021-05-03 00:09:00,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-05-03 00:09:00,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:00,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-05-03 00:09:00,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2021-05-03 00:09:00,912 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 51 states, 51 states have (on average 2.843137254901961) internal successors, (145), 50 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:09,913 INFO L93 Difference]: Finished difference Result 163 states and 167 transitions. [2021-05-03 00:09:09,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-03 00:09:09,915 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.843137254901961) internal successors, (145), 50 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2021-05-03 00:09:09,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:09,916 INFO L225 Difference]: With dead ends: 163 [2021-05-03 00:09:09,916 INFO L226 Difference]: Without dead ends: 155 [2021-05-03 00:09:09,916 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 6 SyntacticMatches, 94 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 9880.6ms TimeCoverageRelationStatistics Valid=386, Invalid=9316, Unknown=0, NotChecked=0, Total=9702 [2021-05-03 00:09:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-05-03 00:09:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2021-05-03 00:09:09,938 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-03 00:09:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2021-05-03 00:09:09,938 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 149 [2021-05-03 00:09:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:09,939 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2021-05-03 00:09:09,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 51 states, 51 states have (on average 2.843137254901961) internal successors, (145), 50 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2021-05-03 00:09:09,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-05-03 00:09:09,939 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:09,939 INFO L523 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:09,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-05-03 00:09:09,939 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:09,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:09,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1982648524, now seen corresponding path program 47 times [2021-05-03 00:09:09,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:09,940 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [19995119] [2021-05-03 00:09:09,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:09,946 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1320 1) 4294967296) (mod v_main_~y~0_95 4294967296)) (< (mod v_main_~x~0_1320 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1320, main_~y~0=v_main_~y~0_95} OutVars{main_~x~0=v_main_~x~0_1320, main_~y~0=v_main_~y~0_95} AuxVars[] AssignedVars[] [2021-05-03 00:09:09,948 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:09:09,971 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:09,973 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:10,108 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-05-03 00:09:10,178 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:09:10,218 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:09:10,359 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:09:10,513 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:09:10,516 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:10,518 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1322 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_96 4294967296)))) InVars {main_~x~0=v_main_~x~0_1322, main_~y~0=v_main_~y~0_96} OutVars{main_~x~0=v_main_~x~0_1322, main_~y~0=v_main_~y~0_96} AuxVars[] AssignedVars[] [2021-05-03 00:09:10,520 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:09:10,521 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:10,523 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:10,656 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:09:10,668 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:09:10,758 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:09:10,842 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:10,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:09:18,428 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:18,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [19995119] [2021-05-03 00:09:18,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [19995119] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:18,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:18,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-03 00:09:18,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925207287] [2021-05-03 00:09:18,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-03 00:09:18,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:18,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-03 00:09:18,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2021-05-03 00:09:18,429 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-03 00:09:29,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:29,732 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2021-05-03 00:09:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-03 00:09:29,734 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-03 00:09:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:29,735 INFO L225 Difference]: With dead ends: 166 [2021-05-03 00:09:29,735 INFO L226 Difference]: Without dead ends: 158 [2021-05-03 00:09:29,735 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 7 SyntacticMatches, 95 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 11454.8ms TimeCoverageRelationStatistics Valid=394, Invalid=9706, Unknown=0, NotChecked=0, Total=10100 [2021-05-03 00:09:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-05-03 00:09:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2021-05-03 00:09:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:09:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2021-05-03 00:09:29,758 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 152 [2021-05-03 00:09:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:29,759 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2021-05-03 00:09:29,759 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-03 00:09:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2021-05-03 00:09:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-05-03 00:09:29,759 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:29,759 INFO L523 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:29,759 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-05-03 00:09:29,759 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:29,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash -160297756, now seen corresponding path program 48 times [2021-05-03 00:09:29,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:29,760 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [92053664] [2021-05-03 00:09:29,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:29,771 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1372 4294967296) 5000000) (< (mod (+ v_main_~x~0_1372 1) 4294967296) (mod v_main_~y~0_97 4294967296))) InVars {main_~x~0=v_main_~x~0_1372, main_~y~0=v_main_~y~0_97} OutVars{main_~x~0=v_main_~x~0_1372, main_~y~0=v_main_~y~0_97} AuxVars[] AssignedVars[] [2021-05-03 00:09:29,773 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:09:29,800 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:29,802 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:30,385 WARN L205 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:09:30,462 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:09:30,495 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:09:30,614 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:09:30,817 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:09:30,820 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:30,822 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1374 4294967296))) (and (< .cse0 (mod v_main_~y~0_98 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1374, main_~y~0=v_main_~y~0_98} OutVars{main_~x~0=v_main_~x~0_1374, main_~y~0=v_main_~y~0_98} AuxVars[] AssignedVars[] [2021-05-03 00:09:30,824 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:09:30,845 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:30,848 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:31,185 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:09:31,218 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:09:31,232 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:09:31,282 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:09:31,350 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:31,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:09:40,115 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:09:40,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [92053664] [2021-05-03 00:09:40,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [92053664] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:09:40,115 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:09:40,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-05-03 00:09:40,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308763950] [2021-05-03 00:09:40,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-05-03 00:09:40,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:09:40,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-05-03 00:09:40,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2021-05-03 00:09:40,116 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-03 00:09:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:09:52,399 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2021-05-03 00:09:52,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-03 00:09:52,401 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-03 00:09:52,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:09:52,402 INFO L225 Difference]: With dead ends: 169 [2021-05-03 00:09:52,402 INFO L226 Difference]: Without dead ends: 161 [2021-05-03 00:09:52,403 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 7 SyntacticMatches, 97 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 13107.5ms TimeCoverageRelationStatistics Valid=402, Invalid=10104, Unknown=0, NotChecked=0, Total=10506 [2021-05-03 00:09:52,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-05-03 00:09:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2021-05-03 00:09:52,426 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-03 00:09:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2021-05-03 00:09:52,426 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 155 [2021-05-03 00:09:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:09:52,426 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2021-05-03 00:09:52,427 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-03 00:09:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2021-05-03 00:09:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-05-03 00:09:52,427 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:09:52,427 INFO L523 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:09:52,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2021-05-03 00:09:52,427 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:09:52,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:09:52,428 INFO L82 PathProgramCache]: Analyzing trace with hash -279037492, now seen corresponding path program 49 times [2021-05-03 00:09:52,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:09:52,428 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1649926725] [2021-05-03 00:09:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:09:52,435 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1425 4294967296) 5000000) (< (mod (+ v_main_~x~0_1425 1) 4294967296) (mod v_main_~y~0_99 4294967296))) InVars {main_~x~0=v_main_~x~0_1425, main_~y~0=v_main_~y~0_99} OutVars{main_~x~0=v_main_~x~0_1425, main_~y~0=v_main_~y~0_99} AuxVars[] AssignedVars[] [2021-05-03 00:09:52,437 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:09:52,470 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:52,474 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:54,609 WARN L205 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:09:54,690 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:09:54,734 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:09:54,929 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:09:55,127 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:09:55,130 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:55,133 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1427 4294967296))) (and (< .cse0 (mod v_main_~y~0_100 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1427, main_~y~0=v_main_~y~0_100} OutVars{main_~x~0=v_main_~x~0_1427, main_~y~0=v_main_~y~0_100} AuxVars[] AssignedVars[] [2021-05-03 00:09:55,135 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:09:55,137 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:55,139 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:09:55,226 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:09:55,243 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:09:55,333 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:09:55,429 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:09:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:55,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:09:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:09:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:09:55,781 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-05-03 00:10:06,655 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:06,656 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1649926725] [2021-05-03 00:10:06,656 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1649926725] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:06,656 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:06,656 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-03 00:10:06,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448262760] [2021-05-03 00:10:06,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-03 00:10:06,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:06,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-03 00:10:06,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2021-05-03 00:10:06,657 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-03 00:10:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:21,750 INFO L93 Difference]: Finished difference Result 172 states and 176 transitions. [2021-05-03 00:10:21,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-03 00:10:21,752 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-03 00:10:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:21,753 INFO L225 Difference]: With dead ends: 172 [2021-05-03 00:10:21,753 INFO L226 Difference]: Without dead ends: 164 [2021-05-03 00:10:21,754 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 7 SyntacticMatches, 99 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 16332.7ms TimeCoverageRelationStatistics Valid=410, Invalid=10510, Unknown=0, NotChecked=0, Total=10920 [2021-05-03 00:10:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-05-03 00:10:21,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2021-05-03 00:10:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 158 states have (on average 1.0126582278481013) internal successors, (160), 158 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:10:21,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2021-05-03 00:10:21,778 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 158 [2021-05-03 00:10:21,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:21,778 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2021-05-03 00:10:21,778 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-03 00:10:21,778 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2021-05-03 00:10:21,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-05-03 00:10:21,779 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:21,779 INFO L523 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:10:21,779 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2021-05-03 00:10:21,779 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:21,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:21,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1398539236, now seen corresponding path program 50 times [2021-05-03 00:10:21,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:21,779 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1861958127] [2021-05-03 00:10:21,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:21,788 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1479 4294967296) 5000000) (< (mod (+ v_main_~x~0_1479 1) 4294967296) (mod v_main_~y~0_101 4294967296))) InVars {main_~x~0=v_main_~x~0_1479, main_~y~0=v_main_~y~0_101} OutVars{main_~x~0=v_main_~x~0_1479, main_~y~0=v_main_~y~0_101} AuxVars[] AssignedVars[] [2021-05-03 00:10:21,790 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:10:21,792 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:21,794 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:22,064 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:10:22,176 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:10:22,225 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:10:22,370 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:10:22,497 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:10:22,734 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:10:22,737 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:10:22,741 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1481 4294967296))) (and (< .cse0 (mod v_main_~y~0_102 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1481, main_~y~0=v_main_~y~0_102} OutVars{main_~x~0=v_main_~x~0_1481, main_~y~0=v_main_~y~0_102} AuxVars[] AssignedVars[] [2021-05-03 00:10:22,743 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:10:22,772 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:22,775 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:22,970 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:10:23,004 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:10:23,025 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:10:23,178 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:10:23,276 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:10:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:23,478 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-05-03 00:10:23,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:10:23,650 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-05-03 00:10:35,131 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:10:35,131 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1861958127] [2021-05-03 00:10:35,131 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1861958127] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:10:35,131 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:10:35,131 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-03 00:10:35,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897233506] [2021-05-03 00:10:35,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-03 00:10:35,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:10:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-03 00:10:35,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2021-05-03 00:10:35,132 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:10:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:10:52,726 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2021-05-03 00:10:52,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-03 00:10:52,729 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:10:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:10:52,729 INFO L225 Difference]: With dead ends: 175 [2021-05-03 00:10:52,730 INFO L226 Difference]: Without dead ends: 167 [2021-05-03 00:10:52,730 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 6 SyntacticMatches, 102 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 17694.9ms TimeCoverageRelationStatistics Valid=418, Invalid=10924, Unknown=0, NotChecked=0, Total=11342 [2021-05-03 00:10:52,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-05-03 00:10:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2021-05-03 00:10:52,758 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:10:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2021-05-03 00:10:52,758 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 161 [2021-05-03 00:10:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:10:52,759 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2021-05-03 00:10:52,759 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:10:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2021-05-03 00:10:52,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-05-03 00:10:52,759 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:10:52,759 INFO L523 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:10:52,760 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-05-03 00:10:52,760 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:10:52,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:10:52,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1847386828, now seen corresponding path program 51 times [2021-05-03 00:10:52,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:10:52,760 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1580623484] [2021-05-03 00:10:52,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:10:52,774 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1534 1) 4294967296) (mod v_main_~y~0_103 4294967296)) (< (mod v_main_~x~0_1534 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1534, main_~y~0=v_main_~y~0_103} OutVars{main_~x~0=v_main_~x~0_1534, main_~y~0=v_main_~y~0_103} AuxVars[] AssignedVars[] [2021-05-03 00:10:52,776 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:10:52,778 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:52,784 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:52,902 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:10:52,949 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:10:53,198 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:10:53,443 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:10:53,447 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:10:53,450 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1536 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_104 4294967296)))) InVars {main_~x~0=v_main_~x~0_1536, main_~y~0=v_main_~y~0_104} OutVars{main_~x~0=v_main_~x~0_1536, main_~y~0=v_main_~y~0_104} AuxVars[] AssignedVars[] [2021-05-03 00:10:53,453 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:10:53,485 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:53,489 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:10:53,605 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:10:53,628 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:10:53,698 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:10:53,821 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:10:53,825 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:10:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:54,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:10:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:10:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:10:54,171 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-05-03 00:11:06,914 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:06,914 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1580623484] [2021-05-03 00:11:06,914 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1580623484] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:06,914 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:06,914 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2021-05-03 00:11:06,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511531335] [2021-05-03 00:11:06,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-05-03 00:11:06,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:06,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-05-03 00:11:06,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2021-05-03 00:11:06,915 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand has 56 states, 56 states have (on average 2.857142857142857) internal successors, (160), 55 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:11:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:11:26,277 INFO L93 Difference]: Finished difference Result 178 states and 182 transitions. [2021-05-03 00:11:26,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-03 00:11:26,280 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.857142857142857) internal successors, (160), 55 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:11:26,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:11:26,281 INFO L225 Difference]: With dead ends: 178 [2021-05-03 00:11:26,281 INFO L226 Difference]: Without dead ends: 170 [2021-05-03 00:11:26,282 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 6 SyntacticMatches, 104 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 19489.3ms TimeCoverageRelationStatistics Valid=426, Invalid=11346, Unknown=0, NotChecked=0, Total=11772 [2021-05-03 00:11:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-05-03 00:11:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2021-05-03 00:11:26,312 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:11:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2021-05-03 00:11:26,312 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2021-05-03 00:11:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:11:26,313 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2021-05-03 00:11:26,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 56 states, 56 states have (on average 2.857142857142857) internal successors, (160), 55 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:11:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2021-05-03 00:11:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-05-03 00:11:26,313 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:11:26,313 INFO L523 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:11:26,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2021-05-03 00:11:26,314 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:11:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:11:26,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1062159644, now seen corresponding path program 52 times [2021-05-03 00:11:26,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:11:26,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1141932203] [2021-05-03 00:11:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:11:26,328 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1590 4294967296) 5000000) (< (mod (+ v_main_~x~0_1590 1) 4294967296) (mod v_main_~y~0_105 4294967296))) InVars {main_~x~0=v_main_~x~0_1590, main_~y~0=v_main_~y~0_105} OutVars{main_~x~0=v_main_~x~0_1590, main_~y~0=v_main_~y~0_105} AuxVars[] AssignedVars[] [2021-05-03 00:11:26,330 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:11:26,331 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:26,334 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:26,495 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:11:26,607 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:11:26,785 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-05-03 00:11:26,960 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:11:27,136 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:11:27,140 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:27,145 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1592 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_106 4294967296)))) InVars {main_~x~0=v_main_~x~0_1592, main_~y~0=v_main_~y~0_106} OutVars{main_~x~0=v_main_~x~0_1592, main_~y~0=v_main_~y~0_106} AuxVars[] AssignedVars[] [2021-05-03 00:11:27,147 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:11:27,149 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:27,152 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:11:27,275 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:11:27,302 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:11:27,450 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:11:27,601 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:11:27,605 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:11:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:27,870 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2021-05-03 00:11:27,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:11:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:11:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:11:28,091 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2021-05-03 00:11:43,016 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:11:43,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1141932203] [2021-05-03 00:11:43,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1141932203] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:11:43,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:11:43,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2021-05-03 00:11:43,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930400215] [2021-05-03 00:11:43,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2021-05-03 00:11:43,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:11:43,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-05-03 00:11:43,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2021-05-03 00:11:43,017 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand has 57 states, 57 states have (on average 2.8596491228070176) internal successors, (163), 56 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:12:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:04,313 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2021-05-03 00:12:04,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-05-03 00:12:04,316 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.8596491228070176) internal successors, (163), 56 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:12:04,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:04,317 INFO L225 Difference]: With dead ends: 181 [2021-05-03 00:12:04,317 INFO L226 Difference]: Without dead ends: 173 [2021-05-03 00:12:04,317 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 6 SyntacticMatches, 106 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 22382.6ms TimeCoverageRelationStatistics Valid=434, Invalid=11776, Unknown=0, NotChecked=0, Total=12210 [2021-05-03 00:12:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-05-03 00:12:04,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2021-05-03 00:12:04,343 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:12:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2021-05-03 00:12:04,344 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 167 [2021-05-03 00:12:04,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:04,344 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2021-05-03 00:12:04,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 57 states, 57 states have (on average 2.8596491228070176) internal successors, (163), 56 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:12:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2021-05-03 00:12:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-05-03 00:12:04,344 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:04,345 INFO L523 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:04,345 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-05-03 00:12:04,345 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:04,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:04,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1668860876, now seen corresponding path program 53 times [2021-05-03 00:12:04,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:04,345 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99050609] [2021-05-03 00:12:04,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:04,365 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1647 1) 4294967296) (mod v_main_~y~0_107 4294967296)) (< (mod v_main_~x~0_1647 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1647, main_~y~0=v_main_~y~0_107} OutVars{main_~x~0=v_main_~x~0_1647, main_~y~0=v_main_~y~0_107} AuxVars[] AssignedVars[] [2021-05-03 00:12:04,367 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:04,412 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:04,415 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:04,578 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:04,632 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:04,762 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:05,037 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:05,040 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:05,044 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1649 4294967296))) (and (< .cse0 (mod v_main_~y~0_108 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1649, main_~y~0=v_main_~y~0_108} OutVars{main_~x~0=v_main_~x~0_1649, main_~y~0=v_main_~y~0_108} AuxVars[] AssignedVars[] [2021-05-03 00:12:05,046 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:05,048 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:05,051 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:05,794 WARN L205 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:12:05,898 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:05,924 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:06,035 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:06,165 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:12:06,169 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:06,407 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-05-03 00:12:06,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:06,598 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-05-03 00:12:21,512 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:12:21,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99050609] [2021-05-03 00:12:21,512 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [99050609] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:12:21,512 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:12:21,512 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-03 00:12:21,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805493484] [2021-05-03 00:12:21,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-03 00:12:21,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:12:21,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-03 00:12:21,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2021-05-03 00:12:21,513 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:12:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:12:44,770 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2021-05-03 00:12:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-03 00:12:44,774 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:12:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:12:44,775 INFO L225 Difference]: With dead ends: 184 [2021-05-03 00:12:44,775 INFO L226 Difference]: Without dead ends: 176 [2021-05-03 00:12:44,775 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 7 SyntacticMatches, 107 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1748 ImplicationChecksByTransitivity, 22983.1ms TimeCoverageRelationStatistics Valid=442, Invalid=12214, Unknown=0, NotChecked=0, Total=12656 [2021-05-03 00:12:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-05-03 00:12:44,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2021-05-03 00:12:44,802 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:12:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2021-05-03 00:12:44,802 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 170 [2021-05-03 00:12:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:12:44,803 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2021-05-03 00:12:44,803 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:12:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2021-05-03 00:12:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-05-03 00:12:44,803 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:12:44,803 INFO L523 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:12:44,803 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2021-05-03 00:12:44,803 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:12:44,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:12:44,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1935684068, now seen corresponding path program 54 times [2021-05-03 00:12:44,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:12:44,804 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [624260351] [2021-05-03 00:12:44,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:12:44,822 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1705 1) 4294967296) (mod v_main_~y~0_109 4294967296)) (< (mod v_main_~x~0_1705 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1705, main_~y~0=v_main_~y~0_109} OutVars{main_~x~0=v_main_~x~0_1705, main_~y~0=v_main_~y~0_109} AuxVars[] AssignedVars[] [2021-05-03 00:12:44,825 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:12:44,827 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:44,830 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:45,252 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:12:45,393 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:12:45,435 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:12:45,731 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:12:46,030 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:12:46,034 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:46,039 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1707 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_110 4294967296)))) InVars {main_~x~0=v_main_~x~0_1707, main_~y~0=v_main_~y~0_110} OutVars{main_~x~0=v_main_~x~0_1707, main_~y~0=v_main_~y~0_110} AuxVars[] AssignedVars[] [2021-05-03 00:12:46,041 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:12:46,085 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:46,089 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:12:46,220 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:12:46,246 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:12:46,343 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:12:46,481 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:12:46,485 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:12:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:46,726 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2021-05-03 00:12:46,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:12:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:12:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:12:46,978 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2021-05-03 00:13:03,447 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:03,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [624260351] [2021-05-03 00:13:03,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [624260351] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:03,447 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:03,448 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2021-05-03 00:13:03,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350674831] [2021-05-03 00:13:03,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-05-03 00:13:03,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:03,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-05-03 00:13:03,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2021-05-03 00:13:03,449 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand has 59 states, 59 states have (on average 2.864406779661017) internal successors, (169), 58 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:13:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:13:29,942 INFO L93 Difference]: Finished difference Result 187 states and 191 transitions. [2021-05-03 00:13:29,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-03 00:13:29,946 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.864406779661017) internal successors, (169), 58 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:13:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:13:29,947 INFO L225 Difference]: With dead ends: 187 [2021-05-03 00:13:29,947 INFO L226 Difference]: Without dead ends: 179 [2021-05-03 00:13:29,948 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 6 SyntacticMatches, 110 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 25389.9ms TimeCoverageRelationStatistics Valid=450, Invalid=12660, Unknown=0, NotChecked=0, Total=13110 [2021-05-03 00:13:29,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-05-03 00:13:29,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2021-05-03 00:13:29,987 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:13:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2021-05-03 00:13:29,987 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 173 [2021-05-03 00:13:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:13:29,987 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2021-05-03 00:13:29,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 59 states, 59 states have (on average 2.864406779661017) internal successors, (169), 58 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:13:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2021-05-03 00:13:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-05-03 00:13:29,988 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:13:29,988 INFO L523 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:13:29,988 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2021-05-03 00:13:29,988 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:13:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:13:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash 880932044, now seen corresponding path program 55 times [2021-05-03 00:13:29,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:13:29,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1826234250] [2021-05-03 00:13:29,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:13:30,001 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1764 1) 4294967296) (mod v_main_~y~0_111 4294967296)) (< (mod v_main_~x~0_1764 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1764, main_~y~0=v_main_~y~0_111} OutVars{main_~x~0=v_main_~x~0_1764, main_~y~0=v_main_~y~0_111} AuxVars[] AssignedVars[] [2021-05-03 00:13:30,004 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:13:30,058 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:30,062 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:31,451 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-03 00:13:31,649 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:13:31,726 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:13:31,995 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:13:32,283 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:13:32,287 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:32,292 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1766 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_112 4294967296)))) InVars {main_~x~0=v_main_~x~0_1766, main_~y~0=v_main_~y~0_112} OutVars{main_~x~0=v_main_~x~0_1766, main_~y~0=v_main_~y~0_112} AuxVars[] AssignedVars[] [2021-05-03 00:13:32,294 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:13:32,332 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:32,336 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:13:32,534 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:13:32,562 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:13:32,672 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:13:32,811 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:13:32,815 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:13:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:33,034 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 18 [2021-05-03 00:13:33,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:13:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:13:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:13:33,310 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2021-05-03 00:13:51,561 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:13:51,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1826234250] [2021-05-03 00:13:51,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1826234250] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:13:51,562 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:13:51,562 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2021-05-03 00:13:51,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115319774] [2021-05-03 00:13:51,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2021-05-03 00:13:51,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:13:51,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-05-03 00:13:51,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2021-05-03 00:13:51,563 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:14:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:14:17,830 INFO L93 Difference]: Finished difference Result 190 states and 194 transitions. [2021-05-03 00:14:17,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-03 00:14:17,836 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:14:17,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:14:17,844 INFO L225 Difference]: With dead ends: 190 [2021-05-03 00:14:17,844 INFO L226 Difference]: Without dead ends: 182 [2021-05-03 00:14:17,845 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 6 SyntacticMatches, 112 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1869 ImplicationChecksByTransitivity, 26911.6ms TimeCoverageRelationStatistics Valid=458, Invalid=13114, Unknown=0, NotChecked=0, Total=13572 [2021-05-03 00:14:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-05-03 00:14:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2021-05-03 00:14:17,886 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:14:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2021-05-03 00:14:17,886 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 176 [2021-05-03 00:14:17,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:14:17,886 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2021-05-03 00:14:17,887 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:14:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2021-05-03 00:14:17,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-05-03 00:14:17,887 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:14:17,887 INFO L523 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:14:17,887 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2021-05-03 00:14:17,887 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:14:17,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:14:17,888 INFO L82 PathProgramCache]: Analyzing trace with hash 744122596, now seen corresponding path program 56 times [2021-05-03 00:14:17,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:14:17,888 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [519967648] [2021-05-03 00:14:17,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:14:17,906 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1824 4294967296) 5000000) (< (mod (+ v_main_~x~0_1824 1) 4294967296) (mod v_main_~y~0_113 4294967296))) InVars {main_~x~0=v_main_~x~0_1824, main_~y~0=v_main_~y~0_113} OutVars{main_~x~0=v_main_~x~0_1824, main_~y~0=v_main_~y~0_113} AuxVars[] AssignedVars[] [2021-05-03 00:14:17,908 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:14:17,964 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:17,968 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:18,086 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:14:18,728 WARN L205 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:14:18,881 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:14:18,950 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:14:19,688 WARN L205 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-05-03 00:14:19,691 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:14:20,038 WARN L205 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:14:20,043 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:20,048 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1826 4294967296))) (and (< .cse0 (mod v_main_~y~0_114 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1826, main_~y~0=v_main_~y~0_114} OutVars{main_~x~0=v_main_~x~0_1826, main_~y~0=v_main_~y~0_114} AuxVars[] AssignedVars[] [2021-05-03 00:14:20,050 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:14:20,092 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:20,096 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:14:20,307 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:14:20,333 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:14:20,418 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:14:20,609 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:14:20,613 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:14:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:20,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:14:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:14:20,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:14:21,048 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-05-03 00:14:41,631 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:14:41,631 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [519967648] [2021-05-03 00:14:41,632 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [519967648] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:14:41,632 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:14:41,632 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2021-05-03 00:14:41,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57347786] [2021-05-03 00:14:41,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-03 00:14:41,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:14:41,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-03 00:14:41,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2021-05-03 00:14:41,633 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand has 61 states, 61 states have (on average 2.8688524590163933) internal successors, (175), 60 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:15:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:15:14,960 INFO L93 Difference]: Finished difference Result 193 states and 197 transitions. [2021-05-03 00:15:14,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-05-03 00:15:14,966 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.8688524590163933) internal successors, (175), 60 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:15:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:15:14,967 INFO L225 Difference]: With dead ends: 193 [2021-05-03 00:15:14,967 INFO L226 Difference]: Without dead ends: 185 [2021-05-03 00:15:14,968 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 6 SyntacticMatches, 114 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 31472.3ms TimeCoverageRelationStatistics Valid=466, Invalid=13576, Unknown=0, NotChecked=0, Total=14042 [2021-05-03 00:15:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-05-03 00:15:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2021-05-03 00:15:14,998 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:15:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2021-05-03 00:15:14,999 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 179 [2021-05-03 00:15:14,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:15:14,999 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2021-05-03 00:15:14,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 61 states, 61 states have (on average 2.8688524590163933) internal successors, (175), 60 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:15:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2021-05-03 00:15:15,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-05-03 00:15:15,000 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:15:15,000 INFO L523 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:15:15,000 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2021-05-03 00:15:15,000 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:15:15,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:15:15,001 INFO L82 PathProgramCache]: Analyzing trace with hash 977821132, now seen corresponding path program 57 times [2021-05-03 00:15:15,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:15:15,001 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [967276773] [2021-05-03 00:15:15,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:15:15,016 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1885 1) 4294967296) (mod v_main_~y~0_115 4294967296)) (< (mod v_main_~x~0_1885 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1885, main_~y~0=v_main_~y~0_115} OutVars{main_~x~0=v_main_~x~0_1885, main_~y~0=v_main_~y~0_115} AuxVars[] AssignedVars[] [2021-05-03 00:15:15,022 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:15:15,025 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:15,030 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:15,179 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:15:15,315 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:15:15,510 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:15:15,607 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:15:15,892 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2021-05-03 00:15:16,028 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:15:16,505 WARN L205 SmtUtils]: Spent 476.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:15:16,511 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:16,517 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1887 4294967296))) (and (< .cse0 5000000) (< .cse0 (mod v_main_~y~0_116 4294967296)))) InVars {main_~x~0=v_main_~x~0_1887, main_~y~0=v_main_~y~0_116} OutVars{main_~x~0=v_main_~x~0_1887, main_~y~0=v_main_~y~0_116} AuxVars[] AssignedVars[] [2021-05-03 00:15:16,520 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:15:16,523 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:16,528 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:15:16,735 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:15:16,770 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:15:17,070 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:15:17,275 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:15:17,280 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:15:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:17,455 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 11 [2021-05-03 00:15:17,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:15:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:15:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:15:17,830 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2021-05-03 00:15:41,914 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:15:41,914 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [967276773] [2021-05-03 00:15:41,914 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [967276773] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:15:41,914 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:15:41,915 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2021-05-03 00:15:41,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6526621] [2021-05-03 00:15:41,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2021-05-03 00:15:41,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:15:41,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-05-03 00:15:41,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2021-05-03 00:15:41,916 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:16:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:16:20,388 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2021-05-03 00:16:20,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-05-03 00:16:20,393 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:16:20,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:16:20,394 INFO L225 Difference]: With dead ends: 196 [2021-05-03 00:16:20,394 INFO L226 Difference]: Without dead ends: 188 [2021-05-03 00:16:20,395 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 7 SyntacticMatches, 115 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 36443.2ms TimeCoverageRelationStatistics Valid=474, Invalid=14046, Unknown=0, NotChecked=0, Total=14520 [2021-05-03 00:16:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-05-03 00:16:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2021-05-03 00:16:20,425 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:16:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2021-05-03 00:16:20,425 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 182 [2021-05-03 00:16:20,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:16:20,426 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2021-05-03 00:16:20,426 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:16:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2021-05-03 00:16:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-05-03 00:16:20,426 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:16:20,427 INFO L523 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:16:20,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2021-05-03 00:16:20,427 INFO L428 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:16:20,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:16:20,427 INFO L82 PathProgramCache]: Analyzing trace with hash 948920292, now seen corresponding path program 58 times [2021-05-03 00:16:20,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:16:20,427 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [692261716] [2021-05-03 00:16:20,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:16:20,444 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1947 1) 4294967296) (mod v_main_~y~0_117 4294967296)) (< (mod v_main_~x~0_1947 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_1947, main_~y~0=v_main_~y~0_117} OutVars{main_~x~0=v_main_~x~0_1947, main_~y~0=v_main_~y~0_117} AuxVars[] AssignedVars[] [2021-05-03 00:16:20,447 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:16:20,515 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:20,519 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:20,843 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:16:20,999 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:16:21,066 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:16:21,401 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:16:21,761 WARN L205 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:16:21,766 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:21,772 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_1949 4294967296))) (and (< .cse0 (mod v_main_~y~0_118 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_1949, main_~y~0=v_main_~y~0_118} OutVars{main_~x~0=v_main_~x~0_1949, main_~y~0=v_main_~y~0_118} AuxVars[] AssignedVars[] [2021-05-03 00:16:21,774 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:16:21,826 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:21,830 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:16:23,785 WARN L205 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-03 00:16:23,894 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-03 00:16:23,946 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:16:23,977 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:16:24,142 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:16:24,324 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:16:24,330 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:16:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:24,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:16:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:16:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:16:24,880 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-05-03 00:16:50,069 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:16:50,069 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [692261716] [2021-05-03 00:16:50,069 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [692261716] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:16:50,069 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:16:50,069 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2021-05-03 00:16:50,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458192100] [2021-05-03 00:16:50,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2021-05-03 00:16:50,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:16:50,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-05-03 00:16:50,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2021-05-03 00:16:50,070 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:17:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:17:32,192 INFO L93 Difference]: Finished difference Result 199 states and 203 transitions. [2021-05-03 00:17:32,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-05-03 00:17:32,198 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:17:32,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:17:32,199 INFO L225 Difference]: With dead ends: 199 [2021-05-03 00:17:32,199 INFO L226 Difference]: Without dead ends: 191 [2021-05-03 00:17:32,200 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 7 SyntacticMatches, 117 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 38621.4ms TimeCoverageRelationStatistics Valid=482, Invalid=14524, Unknown=0, NotChecked=0, Total=15006 [2021-05-03 00:17:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-05-03 00:17:32,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2021-05-03 00:17:32,231 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:17:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2021-05-03 00:17:32,232 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 185 [2021-05-03 00:17:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:17:32,232 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2021-05-03 00:17:32,232 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:17:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2021-05-03 00:17:32,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-05-03 00:17:32,233 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:17:32,233 INFO L523 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:17:32,233 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2021-05-03 00:17:32,233 INFO L428 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:17:32,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:17:32,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1042544948, now seen corresponding path program 59 times [2021-05-03 00:17:32,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:17:32,233 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [440149186] [2021-05-03 00:17:32,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:17:32,255 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2010 1) 4294967296) (mod v_main_~y~0_119 4294967296)) (< (mod v_main_~x~0_2010 4294967296) 5000000)) InVars {main_~x~0=v_main_~x~0_2010, main_~y~0=v_main_~y~0_119} OutVars{main_~x~0=v_main_~x~0_2010, main_~y~0=v_main_~y~0_119} AuxVars[] AssignedVars[] [2021-05-03 00:17:32,258 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size [2021-05-03 00:17:32,261 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:32,265 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:32,449 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:17:32,661 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-05-03 00:17:32,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-05-03 00:17:33,087 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2021-05-03 00:17:33,302 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 91.4 percent of original size 96 [2021-05-03 00:17:33,800 WARN L205 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-05-03 00:17:33,806 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:33,812 INFO L181 rdanLoopAcceleration]: Guard: Formula: (let ((.cse0 (mod v_main_~x~0_2012 4294967296))) (and (< .cse0 (mod v_main_~y~0_120 4294967296)) (< .cse0 5000000))) InVars {main_~x~0=v_main_~x~0_2012, main_~y~0=v_main_~y~0_120} OutVars{main_~x~0=v_main_~x~0_2012, main_~y~0=v_main_~y~0_120} AuxVars[] AssignedVars[] [2021-05-03 00:17:33,815 WARN L240 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size [2021-05-03 00:17:33,867 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:33,872 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:17:34,055 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-05-03 00:17:34,090 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-05-03 00:17:34,229 WARN L245 tifierPushTermWalker]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-05-03 00:17:34,473 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-03 00:17:34,479 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:17:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:34,634 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2021-05-03 00:17:34,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:17:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:17:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:17:35,077 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2021-05-03 00:18:06,989 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:18:06,989 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [440149186] [2021-05-03 00:18:06,989 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [440149186] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:18:06,989 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:18:06,989 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2021-05-03 00:18:06,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769717964] [2021-05-03 00:18:06,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-03 00:18:06,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:18:06,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-03 00:18:06,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2021-05-03 00:18:06,990 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:18:07,728 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-05-03 00:18:09,471 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:10,323 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:11,171 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:13,690 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:14,540 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:15,381 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:16,228 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:17,056 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:17,919 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:18,814 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:19,720 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:20,595 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:21,464 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:22,341 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:23,252 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-05-03 00:18:24,097 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 41