/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/Mono1_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:50:13,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:50:13,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:50:13,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:50:13,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:50:13,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:50:13,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:50:13,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:50:13,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:50:13,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:50:13,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:50:13,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:50:13,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:50:13,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:50:13,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:50:13,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:50:13,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:50:13,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:50:13,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:50:13,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:50:13,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:50:13,256 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:50:13,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:50:13,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:50:13,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:50:13,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:50:13,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:50:13,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:50:13,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:50:13,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:50:13,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:50:13,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:50:13,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:50:13,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:50:13,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:50:13,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:50:13,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:50:13,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:50:13,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:50:13,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:50:13,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:50:13,287 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:50:13,306 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:50:13,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:50:13,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:50:13,311 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:50:13,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:50:13,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:50:13,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:50:13,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:50:13,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:50:13,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:50:13,313 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:50:13,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:50:13,314 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:50:13,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:50:13,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:50:13,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:50:13,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:50:13,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:50:13,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:50:13,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:50:13,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:50:13,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:50:13,315 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:50:13,315 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 23:50:13,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:50:13,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:50:13,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:50:13,749 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:50:13,750 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:50:13,751 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c [2021-05-02 23:50:13,838 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911b808f3/d293ec842ef4474dbcc5d30d82ef81f2/FLAG0adb5d285 [2021-05-02 23:50:14,416 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:50:14,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c [2021-05-02 23:50:14,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911b808f3/d293ec842ef4474dbcc5d30d82ef81f2/FLAG0adb5d285 [2021-05-02 23:50:14,800 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911b808f3/d293ec842ef4474dbcc5d30d82ef81f2 [2021-05-02 23:50:14,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:50:14,807 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:50:14,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:50:14,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:50:14,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:50:14,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:50:14" (1/1) ... [2021-05-02 23:50:14,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425e0780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:14, skipping insertion in model container [2021-05-02 23:50:14,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:50:14" (1/1) ... [2021-05-02 23:50:14,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:50:14,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:50:14,972 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/Mono1_1-1.c[313,326] [2021-05-02 23:50:14,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:50:14,998 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:50:15,057 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/Mono1_1-1.c[313,326] [2021-05-02 23:50:15,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:50:15,076 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:50:15,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:15 WrapperNode [2021-05-02 23:50:15,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:50:15,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:50:15,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:50:15,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:50:15,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:15" (1/1) ... [2021-05-02 23:50:15,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:15" (1/1) ... [2021-05-02 23:50:15,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:15" (1/1) ... [2021-05-02 23:50:15,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:15" (1/1) ... [2021-05-02 23:50:15,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:15" (1/1) ... [2021-05-02 23:50:15,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:15" (1/1) ... [2021-05-02 23:50:15,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:15" (1/1) ... [2021-05-02 23:50:15,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:50:15,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:50:15,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:50:15,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:50:15,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:50:15,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:50:15,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:50:15,194 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:50:15,194 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:50:15,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:50:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:50:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:50:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:50:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:50:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:50:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:50:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:50:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:50:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:50:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:50:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:50:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:50:15,433 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:50:15,434 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 23:50:15,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:50:15 BoogieIcfgContainer [2021-05-02 23:50:15,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:50:15,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:50:15,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:50:15,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:50:15,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:50:14" (1/3) ... [2021-05-02 23:50:15,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66619cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:50:15, skipping insertion in model container [2021-05-02 23:50:15,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:50:15" (2/3) ... [2021-05-02 23:50:15,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66619cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:50:15, skipping insertion in model container [2021-05-02 23:50:15,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:50:15" (3/3) ... [2021-05-02 23:50:15,462 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-1.c [2021-05-02 23:50:15,469 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:50:15,473 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:50:15,487 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:50:15,508 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:50:15,508 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:50:15,508 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:50:15,508 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:50:15,509 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:50:15,509 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:50:15,509 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:50:15,509 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:50:15,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:50:15,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:50:15,538 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:15,539 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:15,540 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:15,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:15,545 INFO L82 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 1 times [2021-05-02 23:50:15,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:15,552 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1493889862] [2021-05-02 23:50:15,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:15,613 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:50:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:15,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:15,882 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:15,882 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1493889862] [2021-05-02 23:50:15,884 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1493889862] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:15,884 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:15,884 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 23:50:15,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286892023] [2021-05-02 23:50:15,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 23:50:15,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:15,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 23:50:15,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:50:15,900 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:15,956 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-05-02 23:50:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 23:50:15,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-02 23:50:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:15,964 INFO L225 Difference]: With dead ends: 30 [2021-05-02 23:50:15,964 INFO L226 Difference]: Without dead ends: 13 [2021-05-02 23:50:15,967 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 77.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:50:15,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-05-02 23:50:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-05-02 23:50:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-05-02 23:50:16,000 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2021-05-02 23:50:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:16,001 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-05-02 23:50:16,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-05-02 23:50:16,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:50:16,002 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:16,002 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:16,002 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:50:16,002 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:16,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:16,004 INFO L82 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 1 times [2021-05-02 23:50:16,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:16,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [284648674] [2021-05-02 23:50:16,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:16,011 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:50:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:16,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:16,177 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:16,177 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [284648674] [2021-05-02 23:50:16,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [284648674] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:16,178 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:16,179 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 23:50:16,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398063671] [2021-05-02 23:50:16,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 23:50:16,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:16,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 23:50:16,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:50:16,183 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:16,288 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-05-02 23:50:16,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 23:50:16,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-02 23:50:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:16,290 INFO L225 Difference]: With dead ends: 22 [2021-05-02 23:50:16,291 INFO L226 Difference]: Without dead ends: 15 [2021-05-02 23:50:16,293 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 95.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:50:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-05-02 23:50:16,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-05-02 23:50:16,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:16,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-05-02 23:50:16,310 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2021-05-02 23:50:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:16,310 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-05-02 23:50:16,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-05-02 23:50:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-02 23:50:16,311 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:16,311 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:16,312 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:50:16,312 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:16,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash 925229631, now seen corresponding path program 1 times [2021-05-02 23:50:16,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:16,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [202039140] [2021-05-02 23:50:16,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:16,366 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_11 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] [2021-05-02 23:50:16,380 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:16,389 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:16,465 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:16,499 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:16,525 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:16,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:16,733 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:16,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [202039140] [2021-05-02 23:50:16,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [202039140] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:16,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:16,734 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:50:16,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892355149] [2021-05-02 23:50:16,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:50:16,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:16,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:50:16,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:50:16,737 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:16,858 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2021-05-02 23:50:16,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:50:16,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-02 23:50:16,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:16,860 INFO L225 Difference]: With dead ends: 24 [2021-05-02 23:50:16,860 INFO L226 Difference]: Without dead ends: 17 [2021-05-02 23:50:16,861 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 132.0ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:50:16,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-02 23:50:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-05-02 23:50:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-05-02 23:50:16,871 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2021-05-02 23:50:16,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:16,871 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-05-02 23:50:16,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-05-02 23:50:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:50:16,872 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:16,872 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:16,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:50:16,872 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:16,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:16,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1162777244, now seen corresponding path program 2 times [2021-05-02 23:50:16,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:16,873 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1155139783] [2021-05-02 23:50:16,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:16,889 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_15 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_15} OutVars{main_~x~0=v_main_~x~0_15} AuxVars[] AssignedVars[] [2021-05-02 23:50:16,905 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:16,929 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:16,953 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:16,972 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:17,001 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:17,008 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_17 1) 4294967296) 100000000) (< (mod v_main_~x~0_17 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_17} OutVars{main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[] [2021-05-02 23:50:17,023 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:17,049 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:17,070 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:17,311 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:50:17,369 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:17,377 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:17,427 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:17,475 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:17,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:17,657 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:17,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1155139783] [2021-05-02 23:50:17,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1155139783] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:17,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:17,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:50:17,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503432036] [2021-05-02 23:50:17,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:50:17,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:17,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:50:17,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:50:17,662 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:17,801 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2021-05-02 23:50:17,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:50:17,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-02 23:50:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:17,804 INFO L225 Difference]: With dead ends: 26 [2021-05-02 23:50:17,805 INFO L226 Difference]: Without dead ends: 19 [2021-05-02 23:50:17,807 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 153.5ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:50:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-02 23:50:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-05-02 23:50:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-05-02 23:50:17,812 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2021-05-02 23:50:17,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:17,813 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-05-02 23:50:17,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2021-05-02 23:50:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:50:17,813 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:17,813 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:17,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:50:17,814 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:17,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:17,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1812766649, now seen corresponding path program 3 times [2021-05-02 23:50:17,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:17,814 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [379358942] [2021-05-02 23:50:17,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:17,822 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_22 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_22} OutVars{main_~x~0=v_main_~x~0_22} AuxVars[] AssignedVars[] [2021-05-02 23:50:17,833 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:17,848 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:17,879 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:17,911 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:18,045 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-05-02 23:50:18,048 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:18,053 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_24 4294967296) 10000000) (< (mod (+ v_main_~x~0_24 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_24} OutVars{main_~x~0=v_main_~x~0_24} AuxVars[] AssignedVars[] [2021-05-02 23:50:18,057 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:18,079 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:18,082 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:18,224 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:18,237 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:18,282 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:18,303 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:18,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:18,478 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:18,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [379358942] [2021-05-02 23:50:18,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [379358942] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:18,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:18,478 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:50:18,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059022420] [2021-05-02 23:50:18,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:50:18,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:18,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:50:18,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:50:18,483 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:18,661 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-05-02 23:50:18,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:50:18,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 23:50:18,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:18,663 INFO L225 Difference]: With dead ends: 28 [2021-05-02 23:50:18,664 INFO L226 Difference]: Without dead ends: 21 [2021-05-02 23:50:18,664 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 170.7ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:50:18,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-05-02 23:50:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-05-02 23:50:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-05-02 23:50:18,669 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2021-05-02 23:50:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:18,669 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-05-02 23:50:18,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-05-02 23:50:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 23:50:18,670 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:18,670 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:18,670 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:50:18,671 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:18,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:18,671 INFO L82 PathProgramCache]: Analyzing trace with hash -612640362, now seen corresponding path program 4 times [2021-05-02 23:50:18,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:18,671 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1356261146] [2021-05-02 23:50:18,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:18,677 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_30 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_30} OutVars{main_~x~0=v_main_~x~0_30} AuxVars[] AssignedVars[] [2021-05-02 23:50:18,679 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:18,690 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:18,709 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:18,729 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:18,750 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:18,755 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_32 1) 4294967296) 100000000) (< (mod v_main_~x~0_32 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_32} OutVars{main_~x~0=v_main_~x~0_32} AuxVars[] AssignedVars[] [2021-05-02 23:50:18,758 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:18,780 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:18,784 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:18,850 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:18,856 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:18,883 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:18,903 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:18,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:19,067 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:19,068 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1356261146] [2021-05-02 23:50:19,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1356261146] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:19,068 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:19,068 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:50:19,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508023695] [2021-05-02 23:50:19,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:50:19,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:19,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:50:19,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:50:19,072 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:19,256 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-05-02 23:50:19,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:50:19,257 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-02 23:50:19,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:19,258 INFO L225 Difference]: With dead ends: 30 [2021-05-02 23:50:19,259 INFO L226 Difference]: Without dead ends: 23 [2021-05-02 23:50:19,259 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 177.8ms TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:50:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-02 23:50:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-05-02 23:50:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-05-02 23:50:19,270 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2021-05-02 23:50:19,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:19,270 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-05-02 23:50:19,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-05-02 23:50:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 23:50:19,273 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:19,273 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:19,273 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 23:50:19,274 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:19,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:19,274 INFO L82 PathProgramCache]: Analyzing trace with hash 738463795, now seen corresponding path program 5 times [2021-05-02 23:50:19,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:19,274 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [868503771] [2021-05-02 23:50:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:19,284 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_39 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_39} OutVars{main_~x~0=v_main_~x~0_39} AuxVars[] AssignedVars[] [2021-05-02 23:50:19,288 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:19,290 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:19,311 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:19,356 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:19,381 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:19,383 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_41 1) 4294967296) 100000000) (< (mod v_main_~x~0_41 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_41} OutVars{main_~x~0=v_main_~x~0_41} AuxVars[] AssignedVars[] [2021-05-02 23:50:19,397 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:19,398 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:19,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:21,426 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:50:23,088 WARN L205 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:50:23,119 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:23,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:23,191 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:23,212 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:23,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:23,426 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:23,426 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [868503771] [2021-05-02 23:50:23,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [868503771] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:23,427 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:23,427 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:50:23,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178634185] [2021-05-02 23:50:23,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:50:23,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:23,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:50:23,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:50:23,428 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:23,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:23,665 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-05-02 23:50:23,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:50:23,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-02 23:50:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:23,668 INFO L225 Difference]: With dead ends: 32 [2021-05-02 23:50:23,668 INFO L226 Difference]: Without dead ends: 25 [2021-05-02 23:50:23,670 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 251.8ms TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:50:23,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-02 23:50:23,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-05-02 23:50:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-05-02 23:50:23,682 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2021-05-02 23:50:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:23,682 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-05-02 23:50:23,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-05-02 23:50:23,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 23:50:23,685 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:23,685 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:23,685 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 23:50:23,685 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:23,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:23,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2069435280, now seen corresponding path program 6 times [2021-05-02 23:50:23,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:23,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [995719577] [2021-05-02 23:50:23,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:23,692 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_49 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_49} OutVars{main_~x~0=v_main_~x~0_49} AuxVars[] AssignedVars[] [2021-05-02 23:50:23,699 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:23,711 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:23,737 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:23,761 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:23,781 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:23,785 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_51 4294967296) 10000000) (< (mod (+ v_main_~x~0_51 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_51} OutVars{main_~x~0=v_main_~x~0_51} AuxVars[] AssignedVars[] [2021-05-02 23:50:23,788 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:23,790 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:23,794 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:24,488 WARN L205 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-02 23:50:24,543 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:24,553 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:24,596 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:24,621 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:24,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:24,836 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:24,836 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [995719577] [2021-05-02 23:50:24,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [995719577] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:24,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:24,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:50:24,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519819112] [2021-05-02 23:50:24,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:50:24,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:24,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:50:24,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:50:24,838 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:25,126 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-05-02 23:50:25,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:50:25,127 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-02 23:50:25,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:25,127 INFO L225 Difference]: With dead ends: 34 [2021-05-02 23:50:25,127 INFO L226 Difference]: Without dead ends: 27 [2021-05-02 23:50:25,128 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 301.9ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:50:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-02 23:50:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-05-02 23:50:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-05-02 23:50:25,132 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2021-05-02 23:50:25,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:25,133 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-05-02 23:50:25,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2021-05-02 23:50:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-02 23:50:25,133 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:25,133 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:25,134 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:50:25,134 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:25,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:25,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1232778157, now seen corresponding path program 7 times [2021-05-02 23:50:25,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:25,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1560815587] [2021-05-02 23:50:25,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:25,140 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_60 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_60} OutVars{main_~x~0=v_main_~x~0_60} AuxVars[] AssignedVars[] [2021-05-02 23:50:25,142 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:25,151 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:25,167 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:25,182 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:25,203 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:25,205 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_62 4294967296) 10000000) (< (mod (+ v_main_~x~0_62 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_62} OutVars{main_~x~0=v_main_~x~0_62} AuxVars[] AssignedVars[] [2021-05-02 23:50:25,208 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:25,209 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:25,212 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:25,325 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:25,342 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:25,400 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:25,424 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:25,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:25,641 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:25,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1560815587] [2021-05-02 23:50:25,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1560815587] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:25,641 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:25,641 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 23:50:25,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584418481] [2021-05-02 23:50:25,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 23:50:25,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:25,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 23:50:25,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:50:25,643 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:25,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:25,979 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-05-02 23:50:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:50:25,980 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-05-02 23:50:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:25,980 INFO L225 Difference]: With dead ends: 36 [2021-05-02 23:50:25,980 INFO L226 Difference]: Without dead ends: 29 [2021-05-02 23:50:25,981 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 348.9ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:50:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-02 23:50:25,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-05-02 23:50:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-05-02 23:50:25,984 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2021-05-02 23:50:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:25,985 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-05-02 23:50:25,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-05-02 23:50:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 23:50:25,985 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:25,985 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:25,985 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 23:50:25,986 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:25,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:25,986 INFO L82 PathProgramCache]: Analyzing trace with hash 364167306, now seen corresponding path program 8 times [2021-05-02 23:50:25,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:25,986 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [895149964] [2021-05-02 23:50:25,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:25,991 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_72 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_72} OutVars{main_~x~0=v_main_~x~0_72} AuxVars[] AssignedVars[] [2021-05-02 23:50:25,994 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:25,995 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:26,018 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:26,047 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:26,067 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:26,070 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_74 4294967296) 10000000) (< (mod (+ v_main_~x~0_74 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_74} OutVars{main_~x~0=v_main_~x~0_74} AuxVars[] AssignedVars[] [2021-05-02 23:50:26,073 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:26,075 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:26,079 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:26,513 WARN L205 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:50:26,595 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:26,600 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:26,661 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:26,680 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:26,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:26,920 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:26,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [895149964] [2021-05-02 23:50:26,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [895149964] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:26,921 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:26,921 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-02 23:50:26,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838436609] [2021-05-02 23:50:26,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 23:50:26,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:26,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 23:50:26,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:50:26,922 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:27,285 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2021-05-02 23:50:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 23:50:27,286 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-05-02 23:50:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:27,286 INFO L225 Difference]: With dead ends: 38 [2021-05-02 23:50:27,287 INFO L226 Difference]: Without dead ends: 31 [2021-05-02 23:50:27,287 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 413.9ms TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:50:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-02 23:50:27,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-05-02 23:50:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-05-02 23:50:27,292 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2021-05-02 23:50:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:27,292 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-05-02 23:50:27,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-05-02 23:50:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 23:50:27,292 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:27,293 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:27,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 23:50:27,293 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:27,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1147205081, now seen corresponding path program 9 times [2021-05-02 23:50:27,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:27,294 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1854471361] [2021-05-02 23:50:27,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:27,301 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_85 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_85} OutVars{main_~x~0=v_main_~x~0_85} AuxVars[] AssignedVars[] [2021-05-02 23:50:27,305 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:27,318 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:27,340 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:27,357 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:27,377 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:27,380 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_87 4294967296) 10000000) (< (mod (+ v_main_~x~0_87 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_87} OutVars{main_~x~0=v_main_~x~0_87} AuxVars[] AssignedVars[] [2021-05-02 23:50:27,384 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:27,405 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:27,408 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:27,483 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:27,493 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:27,518 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:27,539 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:27,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:27,808 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:27,809 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1854471361] [2021-05-02 23:50:27,809 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1854471361] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:27,809 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:27,809 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 23:50:27,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976256932] [2021-05-02 23:50:27,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 23:50:27,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:27,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 23:50:27,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:50:27,810 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:28,239 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-05-02 23:50:28,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 23:50:28,240 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-05-02 23:50:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:28,242 INFO L225 Difference]: With dead ends: 40 [2021-05-02 23:50:28,242 INFO L226 Difference]: Without dead ends: 33 [2021-05-02 23:50:28,243 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 443.7ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:50:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-02 23:50:28,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-05-02 23:50:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-05-02 23:50:28,255 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2021-05-02 23:50:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:28,255 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-05-02 23:50:28,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-05-02 23:50:28,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-02 23:50:28,261 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:28,261 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:28,261 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 23:50:28,261 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:28,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:28,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1877122940, now seen corresponding path program 10 times [2021-05-02 23:50:28,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:28,262 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1811321155] [2021-05-02 23:50:28,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:28,267 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_99 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_99} OutVars{main_~x~0=v_main_~x~0_99} AuxVars[] AssignedVars[] [2021-05-02 23:50:28,269 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:28,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:28,291 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:28,335 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:28,356 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:28,362 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_101 1) 4294967296) 100000000) (< (mod v_main_~x~0_101 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_101} OutVars{main_~x~0=v_main_~x~0_101} AuxVars[] AssignedVars[] [2021-05-02 23:50:28,366 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:28,367 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:28,377 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:29,887 WARN L205 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:50:29,906 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:29,938 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:29,975 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:30,011 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:30,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:30,301 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:30,302 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1811321155] [2021-05-02 23:50:30,302 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1811321155] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:30,302 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:30,302 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-02 23:50:30,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033657063] [2021-05-02 23:50:30,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 23:50:30,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:30,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 23:50:30,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:50:30,303 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:30,780 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2021-05-02 23:50:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 23:50:30,781 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-05-02 23:50:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:30,781 INFO L225 Difference]: With dead ends: 42 [2021-05-02 23:50:30,781 INFO L226 Difference]: Without dead ends: 35 [2021-05-02 23:50:30,782 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 12 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 479.7ms TimeCoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:50:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-02 23:50:30,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-05-02 23:50:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2021-05-02 23:50:30,786 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2021-05-02 23:50:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:30,786 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-05-02 23:50:30,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2021-05-02 23:50:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 23:50:30,787 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:30,787 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:30,788 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 23:50:30,788 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1046451105, now seen corresponding path program 11 times [2021-05-02 23:50:30,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:30,788 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [951856334] [2021-05-02 23:50:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:30,793 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_114 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_114} OutVars{main_~x~0=v_main_~x~0_114} AuxVars[] AssignedVars[] [2021-05-02 23:50:30,795 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:30,796 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:30,811 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:30,831 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:30,856 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:30,862 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_116 4294967296) 10000000) (< (mod (+ v_main_~x~0_116 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_116} OutVars{main_~x~0=v_main_~x~0_116} AuxVars[] AssignedVars[] [2021-05-02 23:50:30,864 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:30,865 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:30,867 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:33,453 WARN L205 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:50:33,519 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:33,528 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:33,610 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:33,634 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:33,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:33,990 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:33,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [951856334] [2021-05-02 23:50:33,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [951856334] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:33,990 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:33,990 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-02 23:50:33,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248706499] [2021-05-02 23:50:33,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-02 23:50:33,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:33,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-02 23:50:33,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:50:33,992 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:34,493 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-05-02 23:50:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 23:50:34,494 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2021-05-02 23:50:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:34,494 INFO L225 Difference]: With dead ends: 44 [2021-05-02 23:50:34,494 INFO L226 Difference]: Without dead ends: 37 [2021-05-02 23:50:34,497 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 528.2ms TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:50:34,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-05-02 23:50:34,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-05-02 23:50:34,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-05-02 23:50:34,504 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2021-05-02 23:50:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:34,505 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-05-02 23:50:34,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-05-02 23:50:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 23:50:34,505 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:34,507 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:34,508 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 23:50:34,508 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:34,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:34,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1692496766, now seen corresponding path program 12 times [2021-05-02 23:50:34,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:34,509 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1349873416] [2021-05-02 23:50:34,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:34,515 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_130 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_130} OutVars{main_~x~0=v_main_~x~0_130} AuxVars[] AssignedVars[] [2021-05-02 23:50:34,517 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:34,518 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:34,538 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:34,563 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:34,583 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:34,586 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_132 1) 4294967296) 100000000) (< (mod v_main_~x~0_132 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_132} OutVars{main_~x~0=v_main_~x~0_132} AuxVars[] AssignedVars[] [2021-05-02 23:50:34,588 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:34,604 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:34,606 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:34,681 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:34,757 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:34,804 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:34,823 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:34,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:35,136 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:35,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1349873416] [2021-05-02 23:50:35,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1349873416] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:35,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:35,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-02 23:50:35,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846031974] [2021-05-02 23:50:35,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 23:50:35,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:35,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 23:50:35,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:50:35,138 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:35,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:35,809 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-05-02 23:50:35,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:50:35,809 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2021-05-02 23:50:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:35,810 INFO L225 Difference]: With dead ends: 46 [2021-05-02 23:50:35,810 INFO L226 Difference]: Without dead ends: 39 [2021-05-02 23:50:35,811 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 14 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 597.6ms TimeCoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:50:35,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-02 23:50:35,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-05-02 23:50:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2021-05-02 23:50:35,815 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 35 [2021-05-02 23:50:35,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:35,815 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-05-02 23:50:35,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2021-05-02 23:50:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-02 23:50:35,816 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:35,816 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:35,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-02 23:50:35,816 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:35,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:35,817 INFO L82 PathProgramCache]: Analyzing trace with hash -227880933, now seen corresponding path program 13 times [2021-05-02 23:50:35,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:35,817 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [780794328] [2021-05-02 23:50:35,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:35,825 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_147 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_147} OutVars{main_~x~0=v_main_~x~0_147} AuxVars[] AssignedVars[] [2021-05-02 23:50:35,827 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:35,836 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:35,863 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:35,877 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:35,899 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:35,907 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_149 4294967296) 10000000) (< (mod (+ v_main_~x~0_149 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_149} OutVars{main_~x~0=v_main_~x~0_149} AuxVars[] AssignedVars[] [2021-05-02 23:50:35,911 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:35,946 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:35,949 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:36,019 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:36,024 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:36,054 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:36,083 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:36,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:36,474 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:36,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [780794328] [2021-05-02 23:50:36,474 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [780794328] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:36,474 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:36,474 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-02 23:50:36,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621825122] [2021-05-02 23:50:36,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-02 23:50:36,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:36,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-02 23:50:36,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:50:36,476 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:37,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:37,289 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2021-05-02 23:50:37,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-02 23:50:37,290 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2021-05-02 23:50:37,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:37,291 INFO L225 Difference]: With dead ends: 48 [2021-05-02 23:50:37,291 INFO L226 Difference]: Without dead ends: 41 [2021-05-02 23:50:37,291 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 15 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 725.8ms TimeCoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:50:37,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-02 23:50:37,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-05-02 23:50:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-05-02 23:50:37,296 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 37 [2021-05-02 23:50:37,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:37,297 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-05-02 23:50:37,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-05-02 23:50:37,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-02 23:50:37,298 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:37,299 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:37,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-02 23:50:37,299 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:37,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:37,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1125087608, now seen corresponding path program 14 times [2021-05-02 23:50:37,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:37,300 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [607469621] [2021-05-02 23:50:37,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:37,305 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_165 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_165} OutVars{main_~x~0=v_main_~x~0_165} AuxVars[] AssignedVars[] [2021-05-02 23:50:37,308 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:37,309 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:37,324 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:37,350 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:37,371 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:37,377 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_167 4294967296) 10000000) (< (mod (+ v_main_~x~0_167 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_167} OutVars{main_~x~0=v_main_~x~0_167} AuxVars[] AssignedVars[] [2021-05-02 23:50:37,381 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:37,382 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:37,384 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:37,690 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:50:37,716 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:37,723 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:37,779 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:37,801 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:37,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:38,247 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:38,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [607469621] [2021-05-02 23:50:38,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [607469621] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:38,247 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:38,247 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-02 23:50:38,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239082295] [2021-05-02 23:50:38,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-02 23:50:38,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:38,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-02 23:50:38,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-05-02 23:50:38,248 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:38,952 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2021-05-02 23:50:38,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-02 23:50:38,952 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2021-05-02 23:50:38,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:38,954 INFO L225 Difference]: With dead ends: 50 [2021-05-02 23:50:38,955 INFO L226 Difference]: Without dead ends: 43 [2021-05-02 23:50:38,955 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 15 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 722.9ms TimeCoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:50:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-02 23:50:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-05-02 23:50:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-05-02 23:50:38,967 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 39 [2021-05-02 23:50:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:38,967 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-05-02 23:50:38,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:38,967 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-05-02 23:50:38,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-02 23:50:38,967 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:38,968 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:38,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-02 23:50:38,968 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:38,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:38,968 INFO L82 PathProgramCache]: Analyzing trace with hash -47235179, now seen corresponding path program 15 times [2021-05-02 23:50:38,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:38,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1690561297] [2021-05-02 23:50:38,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:38,979 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_184 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_184} OutVars{main_~x~0=v_main_~x~0_184} AuxVars[] AssignedVars[] [2021-05-02 23:50:38,994 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:39,008 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:39,045 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:39,064 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:39,087 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:39,089 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_186 4294967296) 10000000) (< (mod (+ v_main_~x~0_186 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_186} OutVars{main_~x~0=v_main_~x~0_186} AuxVars[] AssignedVars[] [2021-05-02 23:50:39,091 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:39,115 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:39,118 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:39,230 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:50:39,342 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:39,360 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:39,396 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:39,413 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:39,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:39,894 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:39,894 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1690561297] [2021-05-02 23:50:39,894 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1690561297] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:39,894 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:39,894 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-02 23:50:39,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764082825] [2021-05-02 23:50:39,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-02 23:50:39,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:39,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-02 23:50:39,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:50:39,895 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:40,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:40,622 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-05-02 23:50:40,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 23:50:40,623 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2021-05-02 23:50:40,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:40,624 INFO L225 Difference]: With dead ends: 52 [2021-05-02 23:50:40,624 INFO L226 Difference]: Without dead ends: 45 [2021-05-02 23:50:40,625 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 17 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 793.8ms TimeCoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:50:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-05-02 23:50:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-05-02 23:50:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-05-02 23:50:40,630 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 41 [2021-05-02 23:50:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:40,630 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-05-02 23:50:40,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-05-02 23:50:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-02 23:50:40,633 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:40,633 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:40,633 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-02 23:50:40,634 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:40,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1368001934, now seen corresponding path program 16 times [2021-05-02 23:50:40,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:40,634 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1079526267] [2021-05-02 23:50:40,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:40,713 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_204 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_204} OutVars{main_~x~0=v_main_~x~0_204} AuxVars[] AssignedVars[] [2021-05-02 23:50:40,715 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:40,737 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:40,761 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:40,789 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:40,830 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:40,836 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_206 1) 4294967296) 100000000) (< (mod v_main_~x~0_206 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_206} OutVars{main_~x~0=v_main_~x~0_206} AuxVars[] AssignedVars[] [2021-05-02 23:50:40,838 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:40,855 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:40,863 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:41,627 WARN L205 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:50:41,663 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:41,699 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:41,781 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:41,816 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:41,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:42,296 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:42,296 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1079526267] [2021-05-02 23:50:42,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1079526267] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:42,297 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:42,297 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-02 23:50:42,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826957390] [2021-05-02 23:50:42,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 23:50:42,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:42,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 23:50:42,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:50:42,299 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:43,091 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2021-05-02 23:50:43,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-02 23:50:43,092 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2021-05-02 23:50:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:43,092 INFO L225 Difference]: With dead ends: 54 [2021-05-02 23:50:43,092 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 23:50:43,093 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 17 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 855.7ms TimeCoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:50:43,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 23:50:43,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-05-02 23:50:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2021-05-02 23:50:43,098 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 43 [2021-05-02 23:50:43,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:43,098 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2021-05-02 23:50:43,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2021-05-02 23:50:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 23:50:43,099 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:43,099 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:43,099 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-02 23:50:43,099 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:43,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:43,099 INFO L82 PathProgramCache]: Analyzing trace with hash 685466127, now seen corresponding path program 17 times [2021-05-02 23:50:43,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:43,099 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2094443957] [2021-05-02 23:50:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:43,112 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_225 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_225} OutVars{main_~x~0=v_main_~x~0_225} AuxVars[] AssignedVars[] [2021-05-02 23:50:43,114 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:43,115 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:43,139 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:43,161 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:43,183 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:43,185 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_227 1) 4294967296) 100000000) (< (mod v_main_~x~0_227 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_227} OutVars{main_~x~0=v_main_~x~0_227} AuxVars[] AssignedVars[] [2021-05-02 23:50:43,186 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:43,187 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:43,189 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:44,708 WARN L205 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:50:44,751 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:44,758 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:44,795 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:44,817 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:44,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:45,312 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:45,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2094443957] [2021-05-02 23:50:45,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2094443957] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:45,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:45,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-02 23:50:45,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314052859] [2021-05-02 23:50:45,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-02 23:50:45,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:45,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-02 23:50:45,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:50:45,314 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:46,167 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2021-05-02 23:50:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-02 23:50:46,168 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-05-02 23:50:46,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:46,169 INFO L225 Difference]: With dead ends: 56 [2021-05-02 23:50:46,169 INFO L226 Difference]: Without dead ends: 49 [2021-05-02 23:50:46,169 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 19 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 855.9ms TimeCoverageRelationStatistics Valid=153, Invalid=1487, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:50:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-05-02 23:50:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-05-02 23:50:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2021-05-02 23:50:46,176 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 45 [2021-05-02 23:50:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:46,176 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2021-05-02 23:50:46,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 20 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2021-05-02 23:50:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 23:50:46,176 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:46,176 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:46,176 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-02 23:50:46,177 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:46,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:46,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1616683412, now seen corresponding path program 18 times [2021-05-02 23:50:46,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:46,177 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [541768328] [2021-05-02 23:50:46,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:46,183 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_247 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_247} OutVars{main_~x~0=v_main_~x~0_247} AuxVars[] AssignedVars[] [2021-05-02 23:50:46,185 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:46,194 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:46,212 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:46,227 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:46,247 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:46,253 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_249 4294967296) 10000000) (< (mod (+ v_main_~x~0_249 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_249} OutVars{main_~x~0=v_main_~x~0_249} AuxVars[] AssignedVars[] [2021-05-02 23:50:46,256 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:46,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:46,274 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:47,062 WARN L205 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:50:47,084 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:47,088 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:47,119 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:47,147 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:47,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:47,691 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:47,691 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [541768328] [2021-05-02 23:50:47,691 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [541768328] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:47,692 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:47,692 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-02 23:50:47,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89841703] [2021-05-02 23:50:47,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 23:50:47,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:47,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 23:50:47,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-05-02 23:50:47,693 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:48,575 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-05-02 23:50:48,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-02 23:50:48,576 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2021-05-02 23:50:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:48,576 INFO L225 Difference]: With dead ends: 58 [2021-05-02 23:50:48,576 INFO L226 Difference]: Without dead ends: 51 [2021-05-02 23:50:48,577 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 20 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 914.1ms TimeCoverageRelationStatistics Valid=161, Invalid=1645, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:50:48,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-02 23:50:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-05-02 23:50:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2021-05-02 23:50:48,590 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 47 [2021-05-02 23:50:48,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:48,591 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2021-05-02 23:50:48,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2021-05-02 23:50:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-02 23:50:48,591 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:48,591 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:48,591 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-02 23:50:48,591 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:48,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:48,592 INFO L82 PathProgramCache]: Analyzing trace with hash -2074232951, now seen corresponding path program 19 times [2021-05-02 23:50:48,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:48,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1112962145] [2021-05-02 23:50:48,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:48,602 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_270 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_270} OutVars{main_~x~0=v_main_~x~0_270} AuxVars[] AssignedVars[] [2021-05-02 23:50:48,604 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:48,604 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:48,620 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:48,642 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:48,671 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:48,674 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_272 1) 4294967296) 100000000) (< (mod v_main_~x~0_272 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_272} OutVars{main_~x~0=v_main_~x~0_272} AuxVars[] AssignedVars[] [2021-05-02 23:50:48,676 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:48,677 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:48,679 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:49,677 WARN L205 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:50:49,713 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:49,722 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:49,814 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:49,849 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:49,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:50,417 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:50,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1112962145] [2021-05-02 23:50:50,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1112962145] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:50,417 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:50,417 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-02 23:50:50,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814372567] [2021-05-02 23:50:50,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-02 23:50:50,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:50,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-02 23:50:50,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:50:50,418 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:51,447 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-05-02 23:50:51,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-02 23:50:51,448 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-05-02 23:50:51,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:51,449 INFO L225 Difference]: With dead ends: 60 [2021-05-02 23:50:51,449 INFO L226 Difference]: Without dead ends: 53 [2021-05-02 23:50:51,450 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 7 SyntacticMatches, 20 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 947.5ms TimeCoverageRelationStatistics Valid=169, Invalid=1811, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:50:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-02 23:50:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-05-02 23:50:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 48 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2021-05-02 23:50:51,455 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 49 [2021-05-02 23:50:51,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:51,455 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-05-02 23:50:51,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 22 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2021-05-02 23:50:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-05-02 23:50:51,455 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:51,456 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:51,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-02 23:50:51,456 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:51,456 INFO L82 PathProgramCache]: Analyzing trace with hash 602291558, now seen corresponding path program 20 times [2021-05-02 23:50:51,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:51,456 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1996941316] [2021-05-02 23:50:51,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:51,461 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_294 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_294} OutVars{main_~x~0=v_main_~x~0_294} AuxVars[] AssignedVars[] [2021-05-02 23:50:51,463 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:51,463 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:51,482 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:51,504 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:51,525 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:51,527 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_296 4294967296) 10000000) (< (mod (+ v_main_~x~0_296 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_296} OutVars{main_~x~0=v_main_~x~0_296} AuxVars[] AssignedVars[] [2021-05-02 23:50:51,541 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:51,556 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:51,564 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:51,857 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:50:51,901 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:51,923 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:51,957 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:51,975 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:52,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:52,640 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:52,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1996941316] [2021-05-02 23:50:52,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1996941316] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:52,641 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:52,641 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-02 23:50:52,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763670481] [2021-05-02 23:50:52,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 23:50:52,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:52,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 23:50:52,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2021-05-02 23:50:52,642 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:53,590 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2021-05-02 23:50:53,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-02 23:50:53,594 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2021-05-02 23:50:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:53,594 INFO L225 Difference]: With dead ends: 62 [2021-05-02 23:50:53,594 INFO L226 Difference]: Without dead ends: 55 [2021-05-02 23:50:53,595 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 6 SyntacticMatches, 22 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1095.6ms TimeCoverageRelationStatistics Valid=177, Invalid=1985, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:50:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-02 23:50:53,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-05-02 23:50:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-05-02 23:50:53,602 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 51 [2021-05-02 23:50:53,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:53,602 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-05-02 23:50:53,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 23 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-05-02 23:50:53,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-02 23:50:53,602 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:53,603 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:53,603 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-02 23:50:53,603 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:53,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:53,603 INFO L82 PathProgramCache]: Analyzing trace with hash 56934403, now seen corresponding path program 21 times [2021-05-02 23:50:53,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:53,603 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [728009062] [2021-05-02 23:50:53,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:53,609 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_319 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_319} OutVars{main_~x~0=v_main_~x~0_319} AuxVars[] AssignedVars[] [2021-05-02 23:50:53,611 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:53,612 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:53,627 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:53,654 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:53,676 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:53,678 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_321 4294967296) 10000000) (< (mod (+ v_main_~x~0_321 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_321} OutVars{main_~x~0=v_main_~x~0_321} AuxVars[] AssignedVars[] [2021-05-02 23:50:53,680 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:53,698 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:53,700 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:53,751 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:53,756 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:53,787 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:53,812 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:53,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:54,421 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:54,421 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [728009062] [2021-05-02 23:50:54,421 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [728009062] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:54,421 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:54,421 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-02 23:50:54,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877703141] [2021-05-02 23:50:54,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-02 23:50:54,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:54,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-02 23:50:54,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:50:54,422 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:55,536 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-05-02 23:50:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-02 23:50:55,537 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2021-05-02 23:50:55,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:55,537 INFO L225 Difference]: With dead ends: 64 [2021-05-02 23:50:55,537 INFO L226 Difference]: Without dead ends: 57 [2021-05-02 23:50:55,538 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 7 SyntacticMatches, 22 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1124.6ms TimeCoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:50:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-02 23:50:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-05-02 23:50:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:55,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2021-05-02 23:50:55,546 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 53 [2021-05-02 23:50:55,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:55,546 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2021-05-02 23:50:55,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 24 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2021-05-02 23:50:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-02 23:50:55,546 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:55,547 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:55,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-02 23:50:55,547 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:55,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:55,547 INFO L82 PathProgramCache]: Analyzing trace with hash -45281440, now seen corresponding path program 22 times [2021-05-02 23:50:55,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:55,547 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1307473978] [2021-05-02 23:50:55,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:55,557 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_345 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_345} OutVars{main_~x~0=v_main_~x~0_345} AuxVars[] AssignedVars[] [2021-05-02 23:50:55,561 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:55,562 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:55,579 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:55,600 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:55,619 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:55,621 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_347 4294967296) 10000000) (< (mod (+ v_main_~x~0_347 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_347} OutVars{main_~x~0=v_main_~x~0_347} AuxVars[] AssignedVars[] [2021-05-02 23:50:55,625 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:55,626 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:55,628 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:55,674 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:55,680 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:55,719 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:55,738 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:55,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:56,425 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:56,425 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1307473978] [2021-05-02 23:50:56,426 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1307473978] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:56,426 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:56,426 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-02 23:50:56,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8558224] [2021-05-02 23:50:56,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 23:50:56,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:56,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 23:50:56,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2021-05-02 23:50:56,427 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:50:57,648 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2021-05-02 23:50:57,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-02 23:50:57,648 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2021-05-02 23:50:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:50:57,649 INFO L225 Difference]: With dead ends: 66 [2021-05-02 23:50:57,649 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 23:50:57,650 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 6 SyntacticMatches, 24 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1224.0ms TimeCoverageRelationStatistics Valid=193, Invalid=2357, Unknown=0, NotChecked=0, Total=2550 [2021-05-02 23:50:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 23:50:57,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-02 23:50:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2021-05-02 23:50:57,655 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 55 [2021-05-02 23:50:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:50:57,655 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2021-05-02 23:50:57,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:50:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2021-05-02 23:50:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-02 23:50:57,656 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:50:57,656 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:50:57,656 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-02 23:50:57,656 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:50:57,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:50:57,657 INFO L82 PathProgramCache]: Analyzing trace with hash 509541245, now seen corresponding path program 23 times [2021-05-02 23:50:57,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:50:57,657 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [700174751] [2021-05-02 23:50:57,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:50:57,664 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_372 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_372} OutVars{main_~x~0=v_main_~x~0_372} AuxVars[] AssignedVars[] [2021-05-02 23:50:57,667 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:50:57,668 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:57,692 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:50:57,716 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:50:57,743 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:57,745 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_374 4294967296) 10000000) (< (mod (+ v_main_~x~0_374 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_374} OutVars{main_~x~0=v_main_~x~0_374} AuxVars[] AssignedVars[] [2021-05-02 23:50:57,747 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:50:57,754 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:57,757 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:50:58,017 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:50:58,045 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:50:58,051 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:50:58,089 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:50:58,110 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:50:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:58,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:50:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:50:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:50:58,898 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:50:58,899 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [700174751] [2021-05-02 23:50:58,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [700174751] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:50:58,899 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:50:58,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-02 23:50:58,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354993731] [2021-05-02 23:50:58,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-02 23:50:58,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:50:58,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-02 23:50:58,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:50:58,900 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:00,130 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2021-05-02 23:51:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-02 23:51:00,131 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2021-05-02 23:51:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:00,131 INFO L225 Difference]: With dead ends: 68 [2021-05-02 23:51:00,131 INFO L226 Difference]: Without dead ends: 61 [2021-05-02 23:51:00,132 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 6 SyntacticMatches, 25 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1343.9ms TimeCoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:51:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-02 23:51:00,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-02 23:51:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2021-05-02 23:51:00,136 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 57 [2021-05-02 23:51:00,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:00,137 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2021-05-02 23:51:00,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2021-05-02 23:51:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-02 23:51:00,137 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:00,137 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:00,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-02 23:51:00,138 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:00,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:00,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1118196826, now seen corresponding path program 24 times [2021-05-02 23:51:00,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:00,138 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [971976680] [2021-05-02 23:51:00,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:00,148 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_400 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_400} OutVars{main_~x~0=v_main_~x~0_400} AuxVars[] AssignedVars[] [2021-05-02 23:51:00,150 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:00,151 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:00,166 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:00,190 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:00,209 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:00,214 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_402 4294967296) 10000000) (< (mod (+ v_main_~x~0_402 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_402} OutVars{main_~x~0=v_main_~x~0_402} AuxVars[] AssignedVars[] [2021-05-02 23:51:00,217 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:00,218 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:00,223 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:00,287 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:00,293 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:00,348 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:00,368 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:00,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:01,112 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:01,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [971976680] [2021-05-02 23:51:01,113 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [971976680] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:01,113 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:01,113 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-02 23:51:01,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658018877] [2021-05-02 23:51:01,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 23:51:01,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:01,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 23:51:01,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:51:01,115 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:02,434 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-05-02 23:51:02,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-02 23:51:02,434 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2021-05-02 23:51:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:02,435 INFO L225 Difference]: With dead ends: 70 [2021-05-02 23:51:02,435 INFO L226 Difference]: Without dead ends: 63 [2021-05-02 23:51:02,435 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 6 SyntacticMatches, 26 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1339.3ms TimeCoverageRelationStatistics Valid=209, Invalid=2761, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:51:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-02 23:51:02,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-05-02 23:51:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2021-05-02 23:51:02,440 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 59 [2021-05-02 23:51:02,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:02,440 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2021-05-02 23:51:02,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 27 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2021-05-02 23:51:02,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-02 23:51:02,441 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:02,441 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:02,441 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-02 23:51:02,441 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:02,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:02,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1920657911, now seen corresponding path program 25 times [2021-05-02 23:51:02,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:02,442 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1631326040] [2021-05-02 23:51:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:02,448 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_429 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_429} OutVars{main_~x~0=v_main_~x~0_429} AuxVars[] AssignedVars[] [2021-05-02 23:51:02,450 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:02,451 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:02,475 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:02,498 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:02,522 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:02,528 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_431 4294967296) 10000000) (< (mod (+ v_main_~x~0_431 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_431} OutVars{main_~x~0=v_main_~x~0_431} AuxVars[] AssignedVars[] [2021-05-02 23:51:02,530 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:02,531 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:02,539 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:02,601 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:02,605 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:02,678 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:02,700 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:02,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:03,576 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:03,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1631326040] [2021-05-02 23:51:03,577 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1631326040] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:03,577 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:03,577 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-02 23:51:03,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087795249] [2021-05-02 23:51:03,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-02 23:51:03,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:03,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-02 23:51:03,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:51:03,578 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:05,096 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2021-05-02 23:51:05,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-02 23:51:05,101 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2021-05-02 23:51:05,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:05,102 INFO L225 Difference]: With dead ends: 72 [2021-05-02 23:51:05,102 INFO L226 Difference]: Without dead ends: 65 [2021-05-02 23:51:05,104 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 6 SyntacticMatches, 27 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1525.8ms TimeCoverageRelationStatistics Valid=217, Invalid=2975, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:51:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-02 23:51:05,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-05-02 23:51:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 60 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:05,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2021-05-02 23:51:05,112 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 61 [2021-05-02 23:51:05,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:05,112 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2021-05-02 23:51:05,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2021-05-02 23:51:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-02 23:51:05,113 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:05,113 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:05,113 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-02 23:51:05,113 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:05,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:05,114 INFO L82 PathProgramCache]: Analyzing trace with hash -8352684, now seen corresponding path program 26 times [2021-05-02 23:51:05,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:05,114 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1559201168] [2021-05-02 23:51:05,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:05,141 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_459 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_459} OutVars{main_~x~0=v_main_~x~0_459} AuxVars[] AssignedVars[] [2021-05-02 23:51:05,145 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:05,146 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:05,162 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:05,191 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:05,212 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:05,214 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_461 4294967296) 10000000) (< (mod (+ v_main_~x~0_461 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_461} OutVars{main_~x~0=v_main_~x~0_461} AuxVars[] AssignedVars[] [2021-05-02 23:51:05,217 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:05,218 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:05,220 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:05,367 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-02 23:51:05,406 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:05,411 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:05,478 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:05,500 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:05,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:06,435 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:06,435 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1559201168] [2021-05-02 23:51:06,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1559201168] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:06,436 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:06,436 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-02 23:51:06,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533538] [2021-05-02 23:51:06,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-02 23:51:06,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:06,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-02 23:51:06,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-05-02 23:51:06,437 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:07,938 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2021-05-02 23:51:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-02 23:51:07,939 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2021-05-02 23:51:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:07,939 INFO L225 Difference]: With dead ends: 74 [2021-05-02 23:51:07,940 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 23:51:07,940 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 6 SyntacticMatches, 28 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1666.0ms TimeCoverageRelationStatistics Valid=225, Invalid=3197, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 23:51:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 23:51:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-05-02 23:51:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2021-05-02 23:51:07,945 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 63 [2021-05-02 23:51:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:07,945 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2021-05-02 23:51:07,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 29 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2021-05-02 23:51:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-02 23:51:07,946 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:07,946 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:07,946 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-05-02 23:51:07,946 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:07,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1638337393, now seen corresponding path program 27 times [2021-05-02 23:51:07,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:07,947 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2121348411] [2021-05-02 23:51:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:07,962 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_490 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_490} OutVars{main_~x~0=v_main_~x~0_490} AuxVars[] AssignedVars[] [2021-05-02 23:51:07,966 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:07,967 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:07,992 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:08,016 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:08,041 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:08,045 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_492 4294967296) 10000000) (< (mod (+ v_main_~x~0_492 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_492} OutVars{main_~x~0=v_main_~x~0_492} AuxVars[] AssignedVars[] [2021-05-02 23:51:08,047 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:08,061 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:08,069 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:09,081 WARN L205 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:51:09,101 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:09,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:09,173 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:09,194 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:09,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:10,190 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:10,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2121348411] [2021-05-02 23:51:10,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2121348411] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:10,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:10,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-02 23:51:10,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149899713] [2021-05-02 23:51:10,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-02 23:51:10,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:10,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-02 23:51:10,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:51:10,192 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:11,692 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-05-02 23:51:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-02 23:51:11,693 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2021-05-02 23:51:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:11,694 INFO L225 Difference]: With dead ends: 76 [2021-05-02 23:51:11,694 INFO L226 Difference]: Without dead ends: 69 [2021-05-02 23:51:11,695 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 7 SyntacticMatches, 28 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1703.9ms TimeCoverageRelationStatistics Valid=233, Invalid=3427, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 23:51:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-02 23:51:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-05-02 23:51:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.03125) internal successors, (66), 64 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2021-05-02 23:51:11,699 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 65 [2021-05-02 23:51:11,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:11,699 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2021-05-02 23:51:11,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 30 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2021-05-02 23:51:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-02 23:51:11,700 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:11,700 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:11,700 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-05-02 23:51:11,700 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:11,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash -735430834, now seen corresponding path program 28 times [2021-05-02 23:51:11,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:11,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1211606507] [2021-05-02 23:51:11,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:11,706 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_522 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_522} OutVars{main_~x~0=v_main_~x~0_522} AuxVars[] AssignedVars[] [2021-05-02 23:51:11,707 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:11,715 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:11,732 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:11,745 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:11,764 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:11,766 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_524 4294967296) 10000000) (< (mod (+ v_main_~x~0_524 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_524} OutVars{main_~x~0=v_main_~x~0_524} AuxVars[] AssignedVars[] [2021-05-02 23:51:11,769 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:11,783 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:11,785 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:13,533 WARN L205 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:51:13,556 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:13,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:13,589 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:13,613 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:13,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:14,554 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:14,554 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1211606507] [2021-05-02 23:51:14,554 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1211606507] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:14,554 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:14,555 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-02 23:51:14,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133683885] [2021-05-02 23:51:14,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 23:51:14,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:14,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 23:51:14,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 23:51:14,556 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:16,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:16,161 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2021-05-02 23:51:16,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-02 23:51:16,161 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2021-05-02 23:51:16,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:16,162 INFO L225 Difference]: With dead ends: 78 [2021-05-02 23:51:16,162 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 23:51:16,163 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 6 SyntacticMatches, 30 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1703.2ms TimeCoverageRelationStatistics Valid=241, Invalid=3665, Unknown=0, NotChecked=0, Total=3906 [2021-05-02 23:51:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 23:51:16,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-05-02 23:51:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:16,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2021-05-02 23:51:16,168 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 67 [2021-05-02 23:51:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:16,169 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2021-05-02 23:51:16,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 31 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:16,169 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2021-05-02 23:51:16,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-05-02 23:51:16,169 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:16,169 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:16,169 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-05-02 23:51:16,170 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:16,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:16,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1299062805, now seen corresponding path program 29 times [2021-05-02 23:51:16,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:16,170 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1956451996] [2021-05-02 23:51:16,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:16,187 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_555 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_555} OutVars{main_~x~0=v_main_~x~0_555} AuxVars[] AssignedVars[] [2021-05-02 23:51:16,188 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:16,190 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:16,208 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:16,234 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:16,254 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:16,261 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_557 4294967296) 10000000) (< (mod (+ v_main_~x~0_557 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_557} OutVars{main_~x~0=v_main_~x~0_557} AuxVars[] AssignedVars[] [2021-05-02 23:51:16,263 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:16,280 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:16,285 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:16,448 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:51:16,464 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:16,471 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:16,514 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:16,534 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:16,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:17,607 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:17,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1956451996] [2021-05-02 23:51:17,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1956451996] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:17,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:17,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-02 23:51:17,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509564057] [2021-05-02 23:51:17,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-02 23:51:17,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:17,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-02 23:51:17,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:51:17,609 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:19,321 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-05-02 23:51:19,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-02 23:51:19,322 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2021-05-02 23:51:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:19,322 INFO L225 Difference]: With dead ends: 80 [2021-05-02 23:51:19,322 INFO L226 Difference]: Without dead ends: 73 [2021-05-02 23:51:19,324 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 6 SyntacticMatches, 31 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1853.0ms TimeCoverageRelationStatistics Valid=249, Invalid=3911, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 23:51:19,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-02 23:51:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-05-02 23:51:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2021-05-02 23:51:19,333 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 69 [2021-05-02 23:51:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:19,333 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2021-05-02 23:51:19,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 32 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2021-05-02 23:51:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-02 23:51:19,334 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:19,334 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:19,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-05-02 23:51:19,334 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:19,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:19,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1783507640, now seen corresponding path program 30 times [2021-05-02 23:51:19,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:19,335 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1934270211] [2021-05-02 23:51:19,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:19,347 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_589 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_589} OutVars{main_~x~0=v_main_~x~0_589} AuxVars[] AssignedVars[] [2021-05-02 23:51:19,349 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:19,350 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:19,367 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:19,401 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:19,421 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:19,425 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_591 4294967296) 10000000) (< (mod (+ v_main_~x~0_591 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_591} OutVars{main_~x~0=v_main_~x~0_591} AuxVars[] AssignedVars[] [2021-05-02 23:51:19,427 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:19,440 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:19,443 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:19,502 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:19,507 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:19,550 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:19,571 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:19,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:20,597 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:20,597 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1934270211] [2021-05-02 23:51:20,597 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1934270211] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:20,597 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:20,597 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-02 23:51:20,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568243821] [2021-05-02 23:51:20,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-02 23:51:20,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:20,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-02 23:51:20,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 23:51:20,599 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:22,355 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2021-05-02 23:51:22,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-02 23:51:22,356 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2021-05-02 23:51:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:22,356 INFO L225 Difference]: With dead ends: 82 [2021-05-02 23:51:22,356 INFO L226 Difference]: Without dead ends: 75 [2021-05-02 23:51:22,357 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 6 SyntacticMatches, 32 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1859.6ms TimeCoverageRelationStatistics Valid=257, Invalid=4165, Unknown=0, NotChecked=0, Total=4422 [2021-05-02 23:51:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-02 23:51:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-02 23:51:22,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2021-05-02 23:51:22,363 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 71 [2021-05-02 23:51:22,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:22,363 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2021-05-02 23:51:22,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 33 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2021-05-02 23:51:22,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-02 23:51:22,363 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:22,363 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:22,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-02 23:51:22,364 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:22,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:22,364 INFO L82 PathProgramCache]: Analyzing trace with hash 816441189, now seen corresponding path program 31 times [2021-05-02 23:51:22,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:22,364 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [562434228] [2021-05-02 23:51:22,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:22,369 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_624 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_624} OutVars{main_~x~0=v_main_~x~0_624} AuxVars[] AssignedVars[] [2021-05-02 23:51:22,372 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:22,380 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:22,394 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:22,409 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:22,430 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:22,433 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_626 1) 4294967296) 100000000) (< (mod v_main_~x~0_626 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_626} OutVars{main_~x~0=v_main_~x~0_626} AuxVars[] AssignedVars[] [2021-05-02 23:51:22,437 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:22,454 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:22,458 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:22,660 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:51:22,682 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:22,700 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:22,730 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:22,747 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:22,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:23,825 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:23,825 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [562434228] [2021-05-02 23:51:23,825 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [562434228] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:23,825 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:23,826 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-02 23:51:23,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823005409] [2021-05-02 23:51:23,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-02 23:51:23,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:23,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-02 23:51:23,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:51:23,827 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:25,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:25,697 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2021-05-02 23:51:25,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-02 23:51:25,698 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2021-05-02 23:51:25,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:25,698 INFO L225 Difference]: With dead ends: 84 [2021-05-02 23:51:25,698 INFO L226 Difference]: Without dead ends: 77 [2021-05-02 23:51:25,699 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 6 SyntacticMatches, 33 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1991.4ms TimeCoverageRelationStatistics Valid=265, Invalid=4427, Unknown=0, NotChecked=0, Total=4692 [2021-05-02 23:51:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-02 23:51:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-05-02 23:51:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 72 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2021-05-02 23:51:25,704 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 73 [2021-05-02 23:51:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:25,705 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2021-05-02 23:51:25,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2021-05-02 23:51:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-05-02 23:51:25,705 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:25,705 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:25,705 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-05-02 23:51:25,706 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:25,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:25,706 INFO L82 PathProgramCache]: Analyzing trace with hash -303700414, now seen corresponding path program 32 times [2021-05-02 23:51:25,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:25,706 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [59180317] [2021-05-02 23:51:25,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:25,712 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_660 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_660} OutVars{main_~x~0=v_main_~x~0_660} AuxVars[] AssignedVars[] [2021-05-02 23:51:25,713 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:25,728 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:25,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:25,785 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:25,808 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:25,809 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_662 1) 4294967296) 100000000) (< (mod v_main_~x~0_662 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_662} OutVars{main_~x~0=v_main_~x~0_662} AuxVars[] AssignedVars[] [2021-05-02 23:51:25,811 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:25,826 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:25,828 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:25,933 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:25,940 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:25,979 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:25,997 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:26,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:27,209 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:27,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [59180317] [2021-05-02 23:51:27,210 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [59180317] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:27,210 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:27,210 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-02 23:51:27,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113139464] [2021-05-02 23:51:27,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-02 23:51:27,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:27,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-02 23:51:27,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 23:51:27,211 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:29,313 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2021-05-02 23:51:29,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-02 23:51:29,313 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2021-05-02 23:51:29,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:29,314 INFO L225 Difference]: With dead ends: 86 [2021-05-02 23:51:29,314 INFO L226 Difference]: Without dead ends: 79 [2021-05-02 23:51:29,315 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 7 SyntacticMatches, 33 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 2199.9ms TimeCoverageRelationStatistics Valid=273, Invalid=4697, Unknown=0, NotChecked=0, Total=4970 [2021-05-02 23:51:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-05-02 23:51:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-05-02 23:51:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2021-05-02 23:51:29,320 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 75 [2021-05-02 23:51:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:29,321 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2021-05-02 23:51:29,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2021-05-02 23:51:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-02 23:51:29,321 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:29,321 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:29,321 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-05-02 23:51:29,321 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:29,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:29,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1277010399, now seen corresponding path program 33 times [2021-05-02 23:51:29,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:29,322 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1094933796] [2021-05-02 23:51:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:29,336 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_697 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_697} OutVars{main_~x~0=v_main_~x~0_697} AuxVars[] AssignedVars[] [2021-05-02 23:51:29,344 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:29,353 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:29,383 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:29,402 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:29,423 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:29,424 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_699 1) 4294967296) 100000000) (< (mod v_main_~x~0_699 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_699} OutVars{main_~x~0=v_main_~x~0_699} AuxVars[] AssignedVars[] [2021-05-02 23:51:29,429 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:29,430 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:29,433 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:30,460 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:51:30,499 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:30,506 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:30,548 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:30,569 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:30,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:31,781 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:31,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1094933796] [2021-05-02 23:51:31,782 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1094933796] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:31,782 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:31,782 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-02 23:51:31,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135331764] [2021-05-02 23:51:31,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-02 23:51:31,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:31,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-02 23:51:31,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:51:31,783 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:33,918 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2021-05-02 23:51:33,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-02 23:51:33,926 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2021-05-02 23:51:33,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:33,926 INFO L225 Difference]: With dead ends: 88 [2021-05-02 23:51:33,926 INFO L226 Difference]: Without dead ends: 81 [2021-05-02 23:51:33,927 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 7 SyntacticMatches, 34 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 2209.7ms TimeCoverageRelationStatistics Valid=281, Invalid=4975, Unknown=0, NotChecked=0, Total=5256 [2021-05-02 23:51:33,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-05-02 23:51:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-05-02 23:51:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0263157894736843) internal successors, (78), 76 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:33,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2021-05-02 23:51:33,933 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 77 [2021-05-02 23:51:33,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:33,933 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2021-05-02 23:51:33,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 36 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:33,933 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2021-05-02 23:51:33,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 23:51:33,933 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:33,934 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:33,934 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-02 23:51:33,934 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:33,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:33,934 INFO L82 PathProgramCache]: Analyzing trace with hash -78321092, now seen corresponding path program 34 times [2021-05-02 23:51:33,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:33,934 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [711100119] [2021-05-02 23:51:33,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:33,940 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_735 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_735} OutVars{main_~x~0=v_main_~x~0_735} AuxVars[] AssignedVars[] [2021-05-02 23:51:33,941 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:33,942 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:33,962 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:33,987 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:34,013 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:34,016 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_737 1) 4294967296) 100000000) (< (mod v_main_~x~0_737 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_737} OutVars{main_~x~0=v_main_~x~0_737} AuxVars[] AssignedVars[] [2021-05-02 23:51:34,018 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:34,018 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:34,020 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:34,071 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:34,078 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:34,121 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:34,140 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:34,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:35,424 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:35,425 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [711100119] [2021-05-02 23:51:35,425 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [711100119] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:35,425 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:35,425 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-02 23:51:35,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201823779] [2021-05-02 23:51:35,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-02 23:51:35,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:35,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-02 23:51:35,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2021-05-02 23:51:35,426 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:37,663 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2021-05-02 23:51:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-02 23:51:37,663 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2021-05-02 23:51:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:37,664 INFO L225 Difference]: With dead ends: 90 [2021-05-02 23:51:37,664 INFO L226 Difference]: Without dead ends: 83 [2021-05-02 23:51:37,665 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 7 SyntacticMatches, 35 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 2339.2ms TimeCoverageRelationStatistics Valid=289, Invalid=5261, Unknown=0, NotChecked=0, Total=5550 [2021-05-02 23:51:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-02 23:51:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-05-02 23:51:37,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2021-05-02 23:51:37,670 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 79 [2021-05-02 23:51:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:37,670 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2021-05-02 23:51:37,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 37 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2021-05-02 23:51:37,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-02 23:51:37,671 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:37,671 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:37,671 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-05-02 23:51:37,671 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:37,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:37,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1176793255, now seen corresponding path program 35 times [2021-05-02 23:51:37,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:37,672 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [380704871] [2021-05-02 23:51:37,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:37,677 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_774 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_774} OutVars{main_~x~0=v_main_~x~0_774} AuxVars[] AssignedVars[] [2021-05-02 23:51:37,685 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:37,694 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:37,709 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:37,722 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:37,746 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:37,754 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_776 1) 4294967296) 100000000) (< (mod v_main_~x~0_776 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_776} OutVars{main_~x~0=v_main_~x~0_776} AuxVars[] AssignedVars[] [2021-05-02 23:51:37,756 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:37,760 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:37,762 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:37,862 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:37,867 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:37,929 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:37,977 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:38,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:39,338 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:39,338 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [380704871] [2021-05-02 23:51:39,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [380704871] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:39,338 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:39,338 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-02 23:51:39,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118810004] [2021-05-02 23:51:39,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-02 23:51:39,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:39,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-02 23:51:39,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:51:39,340 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:41,715 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2021-05-02 23:51:41,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-02 23:51:41,716 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2021-05-02 23:51:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:41,717 INFO L225 Difference]: With dead ends: 92 [2021-05-02 23:51:41,717 INFO L226 Difference]: Without dead ends: 85 [2021-05-02 23:51:41,718 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 7 SyntacticMatches, 36 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 2479.8ms TimeCoverageRelationStatistics Valid=297, Invalid=5555, Unknown=0, NotChecked=0, Total=5852 [2021-05-02 23:51:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-02 23:51:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-05-02 23:51:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:41,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2021-05-02 23:51:41,731 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 81 [2021-05-02 23:51:41,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:41,731 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2021-05-02 23:51:41,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 38 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2021-05-02 23:51:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-02 23:51:41,732 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:41,732 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:41,732 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-05-02 23:51:41,732 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:41,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:41,732 INFO L82 PathProgramCache]: Analyzing trace with hash -246587082, now seen corresponding path program 36 times [2021-05-02 23:51:41,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:41,732 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1312375886] [2021-05-02 23:51:41,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:41,738 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_814 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_814} OutVars{main_~x~0=v_main_~x~0_814} AuxVars[] AssignedVars[] [2021-05-02 23:51:41,740 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:41,741 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:41,776 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:41,798 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:41,819 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:41,820 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_816 1) 4294967296) 100000000) (< (mod v_main_~x~0_816 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_816} OutVars{main_~x~0=v_main_~x~0_816} AuxVars[] AssignedVars[] [2021-05-02 23:51:41,822 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:41,823 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:41,825 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:41,898 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:41,906 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:41,959 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:41,979 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:42,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:43,406 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:43,407 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1312375886] [2021-05-02 23:51:43,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1312375886] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:43,407 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:43,407 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-02 23:51:43,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402244667] [2021-05-02 23:51:43,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-02 23:51:43,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:43,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-02 23:51:43,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 23:51:43,410 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:45,804 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-05-02 23:51:45,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-02 23:51:45,804 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2021-05-02 23:51:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:45,805 INFO L225 Difference]: With dead ends: 94 [2021-05-02 23:51:45,805 INFO L226 Difference]: Without dead ends: 87 [2021-05-02 23:51:45,806 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 6 SyntacticMatches, 38 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 2561.7ms TimeCoverageRelationStatistics Valid=305, Invalid=5857, Unknown=0, NotChecked=0, Total=6162 [2021-05-02 23:51:45,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-05-02 23:51:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-05-02 23:51:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2021-05-02 23:51:45,811 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 83 [2021-05-02 23:51:45,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:45,811 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2021-05-02 23:51:45,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 1.975) internal successors, (79), 39 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:45,811 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2021-05-02 23:51:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-05-02 23:51:45,812 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:45,812 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:45,812 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-05-02 23:51:45,812 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:45,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:45,813 INFO L82 PathProgramCache]: Analyzing trace with hash 328347603, now seen corresponding path program 37 times [2021-05-02 23:51:45,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:45,813 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1456235175] [2021-05-02 23:51:45,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:45,819 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_855 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_855} OutVars{main_~x~0=v_main_~x~0_855} AuxVars[] AssignedVars[] [2021-05-02 23:51:45,820 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:45,820 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:45,847 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:45,871 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:45,892 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:45,894 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_857 4294967296) 10000000) (< (mod (+ v_main_~x~0_857 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_857} OutVars{main_~x~0=v_main_~x~0_857} AuxVars[] AssignedVars[] [2021-05-02 23:51:45,896 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:45,897 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:45,899 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:46,092 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:46,097 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:46,142 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:46,163 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:46,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:47,636 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:47,636 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1456235175] [2021-05-02 23:51:47,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1456235175] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:47,637 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:47,637 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-02 23:51:47,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589788317] [2021-05-02 23:51:47,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-02 23:51:47,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:47,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-02 23:51:47,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:51:47,638 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:50,130 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-05-02 23:51:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-02 23:51:50,131 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2021-05-02 23:51:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:50,131 INFO L225 Difference]: With dead ends: 96 [2021-05-02 23:51:50,131 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 23:51:50,132 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 6 SyntacticMatches, 39 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 2654.6ms TimeCoverageRelationStatistics Valid=313, Invalid=6167, Unknown=0, NotChecked=0, Total=6480 [2021-05-02 23:51:50,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 23:51:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-05-02 23:51:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0238095238095237) internal successors, (86), 84 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2021-05-02 23:51:50,138 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 85 [2021-05-02 23:51:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:50,138 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2021-05-02 23:51:50,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 1.975609756097561) internal successors, (81), 40 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2021-05-02 23:51:50,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-02 23:51:50,138 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:50,139 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:50,139 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-05-02 23:51:50,139 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:50,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:50,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1210201296, now seen corresponding path program 38 times [2021-05-02 23:51:50,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:50,139 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1000716753] [2021-05-02 23:51:50,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:50,146 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_897 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_897} OutVars{main_~x~0=v_main_~x~0_897} AuxVars[] AssignedVars[] [2021-05-02 23:51:50,147 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:50,156 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:50,184 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:50,199 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:50,220 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:50,222 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_899 1) 4294967296) 100000000) (< (mod v_main_~x~0_899 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_899} OutVars{main_~x~0=v_main_~x~0_899} AuxVars[] AssignedVars[] [2021-05-02 23:51:50,224 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:50,238 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:50,241 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:51,260 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:51:51,291 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:51,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:51,327 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:51,348 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:51,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:52,911 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:52,912 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1000716753] [2021-05-02 23:51:52,912 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1000716753] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:52,912 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:52,912 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-02 23:51:52,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754172254] [2021-05-02 23:51:52,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 23:51:52,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:52,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 23:51:52,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 23:51:52,913 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:51:55,514 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2021-05-02 23:51:55,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-02 23:51:55,514 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2021-05-02 23:51:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:51:55,515 INFO L225 Difference]: With dead ends: 98 [2021-05-02 23:51:55,515 INFO L226 Difference]: Without dead ends: 91 [2021-05-02 23:51:55,515 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 6 SyntacticMatches, 40 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 2804.5ms TimeCoverageRelationStatistics Valid=321, Invalid=6485, Unknown=0, NotChecked=0, Total=6806 [2021-05-02 23:51:55,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-05-02 23:51:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-05-02 23:51:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2021-05-02 23:51:55,521 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 87 [2021-05-02 23:51:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:51:55,521 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2021-05-02 23:51:55,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 41 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:51:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2021-05-02 23:51:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-02 23:51:55,522 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:51:55,522 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:51:55,522 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-05-02 23:51:55,522 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:51:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:51:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2008023885, now seen corresponding path program 39 times [2021-05-02 23:51:55,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:51:55,523 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1311518362] [2021-05-02 23:51:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:51:55,528 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_940 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_940} OutVars{main_~x~0=v_main_~x~0_940} AuxVars[] AssignedVars[] [2021-05-02 23:51:55,530 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:51:55,539 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:55,561 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:51:55,574 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:51:55,593 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:55,596 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_942 4294967296) 10000000) (< (mod (+ v_main_~x~0_942 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_942} OutVars{main_~x~0=v_main_~x~0_942} AuxVars[] AssignedVars[] [2021-05-02 23:51:55,605 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:51:55,606 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:55,608 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:51:56,909 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:51:56,929 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:51:56,941 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:51:56,979 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:51:56,999 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:51:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:57,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:51:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:51:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:51:58,558 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:51:58,558 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1311518362] [2021-05-02 23:51:58,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1311518362] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:51:58,559 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:51:58,559 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-02 23:51:58,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867508988] [2021-05-02 23:51:58,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-02 23:51:58,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:51:58,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-02 23:51:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:51:58,560 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:52:01,281 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2021-05-02 23:52:01,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-02 23:52:01,282 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2021-05-02 23:52:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:52:01,283 INFO L225 Difference]: With dead ends: 100 [2021-05-02 23:52:01,283 INFO L226 Difference]: Without dead ends: 93 [2021-05-02 23:52:01,284 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 7 SyntacticMatches, 40 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 2851.6ms TimeCoverageRelationStatistics Valid=329, Invalid=6811, Unknown=0, NotChecked=0, Total=7140 [2021-05-02 23:52:01,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-02 23:52:01,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-05-02 23:52:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.0227272727272727) internal successors, (90), 88 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2021-05-02 23:52:01,291 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 89 [2021-05-02 23:52:01,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:52:01,291 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2021-05-02 23:52:01,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 42 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2021-05-02 23:52:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-02 23:52:01,292 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:52:01,292 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:52:01,292 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-05-02 23:52:01,292 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:52:01,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:52:01,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1948997590, now seen corresponding path program 40 times [2021-05-02 23:52:01,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:52:01,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2105074947] [2021-05-02 23:52:01,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:52:01,300 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_984 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_984} OutVars{main_~x~0=v_main_~x~0_984} AuxVars[] AssignedVars[] [2021-05-02 23:52:01,302 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:52:01,314 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:01,329 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:52:01,348 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:52:01,378 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:01,380 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_986 4294967296) 10000000) (< (mod (+ v_main_~x~0_986 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_986} OutVars{main_~x~0=v_main_~x~0_986} AuxVars[] AssignedVars[] [2021-05-02 23:52:01,382 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:52:01,383 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:01,387 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:01,492 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:52:01,505 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:52:01,583 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:52:01,605 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:01,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:52:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:52:03,325 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:52:03,325 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2105074947] [2021-05-02 23:52:03,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2105074947] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:52:03,325 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:52:03,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-02 23:52:03,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431908813] [2021-05-02 23:52:03,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-02 23:52:03,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:52:03,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-02 23:52:03,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2021-05-02 23:52:03,327 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:06,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:52:06,170 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2021-05-02 23:52:06,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-02 23:52:06,171 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2021-05-02 23:52:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:52:06,172 INFO L225 Difference]: With dead ends: 102 [2021-05-02 23:52:06,172 INFO L226 Difference]: Without dead ends: 95 [2021-05-02 23:52:06,172 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 7 SyntacticMatches, 41 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 3062.1ms TimeCoverageRelationStatistics Valid=337, Invalid=7145, Unknown=0, NotChecked=0, Total=7482 [2021-05-02 23:52:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-02 23:52:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-05-02 23:52:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2021-05-02 23:52:06,178 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 91 [2021-05-02 23:52:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:52:06,178 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2021-05-02 23:52:06,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 43 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2021-05-02 23:52:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-02 23:52:06,179 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:52:06,179 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:52:06,179 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-02 23:52:06,179 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:52:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:52:06,180 INFO L82 PathProgramCache]: Analyzing trace with hash 694389191, now seen corresponding path program 41 times [2021-05-02 23:52:06,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:52:06,180 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807980313] [2021-05-02 23:52:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:52:06,186 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1029 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1029} OutVars{main_~x~0=v_main_~x~0_1029} AuxVars[] AssignedVars[] [2021-05-02 23:52:06,193 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:52:06,214 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:06,230 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:52:06,246 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:52:06,273 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:06,275 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1031 1) 4294967296) 100000000) (< (mod v_main_~x~0_1031 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1031} OutVars{main_~x~0=v_main_~x~0_1031} AuxVars[] AssignedVars[] [2021-05-02 23:52:06,277 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:52:06,279 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:06,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:06,412 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:52:06,417 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:52:06,470 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:52:06,493 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:06,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:52:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:52:08,296 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:52:08,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807980313] [2021-05-02 23:52:08,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [807980313] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:52:08,297 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:52:08,297 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-02 23:52:08,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422523751] [2021-05-02 23:52:08,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-02 23:52:08,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:52:08,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-02 23:52:08,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:52:08,298 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:52:11,298 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2021-05-02 23:52:11,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-02 23:52:11,298 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2021-05-02 23:52:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:52:11,299 INFO L225 Difference]: With dead ends: 104 [2021-05-02 23:52:11,299 INFO L226 Difference]: Without dead ends: 97 [2021-05-02 23:52:11,300 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 6 SyntacticMatches, 43 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 3176.5ms TimeCoverageRelationStatistics Valid=345, Invalid=7487, Unknown=0, NotChecked=0, Total=7832 [2021-05-02 23:52:11,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-02 23:52:11,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-05-02 23:52:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2021-05-02 23:52:11,306 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 93 [2021-05-02 23:52:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:52:11,306 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2021-05-02 23:52:11,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 44 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2021-05-02 23:52:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-02 23:52:11,307 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:52:11,307 INFO L523 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:52:11,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-05-02 23:52:11,307 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:52:11,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:52:11,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1631553500, now seen corresponding path program 42 times [2021-05-02 23:52:11,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:52:11,308 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272849717] [2021-05-02 23:52:11,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:52:11,315 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1075 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1075} OutVars{main_~x~0=v_main_~x~0_1075} AuxVars[] AssignedVars[] [2021-05-02 23:52:11,317 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:52:11,318 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:11,336 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:52:11,361 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:52:11,384 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:11,386 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1077 1) 4294967296) 100000000) (< (mod v_main_~x~0_1077 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1077} OutVars{main_~x~0=v_main_~x~0_1077} AuxVars[] AssignedVars[] [2021-05-02 23:52:11,390 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:52:11,391 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:11,397 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:11,438 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:52:11,442 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:52:11,485 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:52:11,617 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-05-02 23:52:11,618 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:11,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:52:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:52:13,474 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:52:13,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272849717] [2021-05-02 23:52:13,475 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [272849717] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:52:13,475 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:52:13,475 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-02 23:52:13,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869551013] [2021-05-02 23:52:13,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-02 23:52:13,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:52:13,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-02 23:52:13,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2021-05-02 23:52:13,476 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:52:16,587 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-05-02 23:52:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-02 23:52:16,588 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2021-05-02 23:52:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:52:16,588 INFO L225 Difference]: With dead ends: 106 [2021-05-02 23:52:16,589 INFO L226 Difference]: Without dead ends: 99 [2021-05-02 23:52:16,589 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 6 SyntacticMatches, 44 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 3313.4ms TimeCoverageRelationStatistics Valid=353, Invalid=7837, Unknown=0, NotChecked=0, Total=8190 [2021-05-02 23:52:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-02 23:52:16,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-05-02 23:52:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2021-05-02 23:52:16,596 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 95 [2021-05-02 23:52:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:52:16,596 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2021-05-02 23:52:16,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 45 states have internal predecessors, (91), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2021-05-02 23:52:16,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-05-02 23:52:16,597 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:52:16,597 INFO L523 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:52:16,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-05-02 23:52:16,597 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:52:16,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:52:16,597 INFO L82 PathProgramCache]: Analyzing trace with hash 815481665, now seen corresponding path program 43 times [2021-05-02 23:52:16,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:52:16,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [890893216] [2021-05-02 23:52:16,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:52:16,604 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1122 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1122} OutVars{main_~x~0=v_main_~x~0_1122} AuxVars[] AssignedVars[] [2021-05-02 23:52:16,605 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:52:16,606 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:16,636 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:52:16,659 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:52:16,680 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:16,682 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1124 4294967296) 10000000) (< (mod (+ v_main_~x~0_1124 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_1124} OutVars{main_~x~0=v_main_~x~0_1124} AuxVars[] AssignedVars[] [2021-05-02 23:52:16,683 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:52:16,697 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:16,700 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:18,737 WARN L205 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:52:19,725 WARN L205 SmtUtils]: Spent 986.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:52:19,992 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:52:19,993 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:52:20,020 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:52:20,051 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:52:20,074 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:20,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:52:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:52:21,980 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:52:21,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [890893216] [2021-05-02 23:52:21,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [890893216] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:52:21,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:52:21,981 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-02 23:52:21,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026542656] [2021-05-02 23:52:21,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-02 23:52:21,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:52:21,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-02 23:52:21,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:52:21,982 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:52:25,307 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2021-05-02 23:52:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-02 23:52:25,308 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2021-05-02 23:52:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:52:25,308 INFO L225 Difference]: With dead ends: 108 [2021-05-02 23:52:25,308 INFO L226 Difference]: Without dead ends: 101 [2021-05-02 23:52:25,309 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 7 SyntacticMatches, 44 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 3481.0ms TimeCoverageRelationStatistics Valid=361, Invalid=8195, Unknown=0, NotChecked=0, Total=8556 [2021-05-02 23:52:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-02 23:52:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-05-02 23:52:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 96 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2021-05-02 23:52:25,315 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 97 [2021-05-02 23:52:25,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:52:25,316 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2021-05-02 23:52:25,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 46 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:25,316 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2021-05-02 23:52:25,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-05-02 23:52:25,316 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:52:25,316 INFO L523 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:52:25,316 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-02 23:52:25,316 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:52:25,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:52:25,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1225802978, now seen corresponding path program 44 times [2021-05-02 23:52:25,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:52:25,317 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [968930925] [2021-05-02 23:52:25,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:52:25,326 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1170 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1170} OutVars{main_~x~0=v_main_~x~0_1170} AuxVars[] AssignedVars[] [2021-05-02 23:52:25,327 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:52:25,328 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:25,351 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:52:25,376 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:52:25,399 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:25,400 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1172 4294967296) 10000000) (< (mod (+ v_main_~x~0_1172 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_1172} OutVars{main_~x~0=v_main_~x~0_1172} AuxVars[] AssignedVars[] [2021-05-02 23:52:25,402 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:52:25,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:25,407 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:25,441 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:52:25,446 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:52:25,496 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:52:25,516 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:25,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:52:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:52:27,533 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:52:27,533 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [968930925] [2021-05-02 23:52:27,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [968930925] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:52:27,533 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:52:27,533 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-02 23:52:27,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914873219] [2021-05-02 23:52:27,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-02 23:52:27,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:52:27,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-02 23:52:27,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2021-05-02 23:52:27,535 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:30,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:52:30,953 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2021-05-02 23:52:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-02 23:52:30,953 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2021-05-02 23:52:30,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:52:30,954 INFO L225 Difference]: With dead ends: 110 [2021-05-02 23:52:30,954 INFO L226 Difference]: Without dead ends: 103 [2021-05-02 23:52:30,955 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 7 SyntacticMatches, 45 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 3633.6ms TimeCoverageRelationStatistics Valid=369, Invalid=8561, Unknown=0, NotChecked=0, Total=8930 [2021-05-02 23:52:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-05-02 23:52:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-05-02 23:52:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2021-05-02 23:52:30,961 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 99 [2021-05-02 23:52:30,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:52:30,961 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2021-05-02 23:52:30,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 47 states have internal predecessors, (95), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2021-05-02 23:52:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-05-02 23:52:30,965 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:52:30,965 INFO L523 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:52:30,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-05-02 23:52:30,965 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:52:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:52:30,965 INFO L82 PathProgramCache]: Analyzing trace with hash -100290629, now seen corresponding path program 45 times [2021-05-02 23:52:30,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:52:30,966 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1602621384] [2021-05-02 23:52:30,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:52:30,977 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1219 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1219} OutVars{main_~x~0=v_main_~x~0_1219} AuxVars[] AssignedVars[] [2021-05-02 23:52:30,979 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:52:30,988 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:31,009 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:52:31,024 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:52:31,049 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:31,051 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1221 1) 4294967296) 100000000) (< (mod v_main_~x~0_1221 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1221} OutVars{main_~x~0=v_main_~x~0_1221} AuxVars[] AssignedVars[] [2021-05-02 23:52:31,052 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:52:31,067 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:31,070 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:31,564 WARN L205 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:52:31,586 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:52:31,594 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:52:31,617 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:52:31,640 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:31,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:52:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:52:33,880 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:52:33,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1602621384] [2021-05-02 23:52:33,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1602621384] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:52:33,880 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:52:33,880 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-02 23:52:33,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507189773] [2021-05-02 23:52:33,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-02 23:52:33,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:52:33,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-02 23:52:33,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2021-05-02 23:52:33,881 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:52:37,529 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2021-05-02 23:52:37,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-02 23:52:37,530 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2021-05-02 23:52:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:52:37,531 INFO L225 Difference]: With dead ends: 112 [2021-05-02 23:52:37,531 INFO L226 Difference]: Without dead ends: 105 [2021-05-02 23:52:37,532 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 7 SyntacticMatches, 46 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 3930.2ms TimeCoverageRelationStatistics Valid=377, Invalid=8935, Unknown=0, NotChecked=0, Total=9312 [2021-05-02 23:52:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-05-02 23:52:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-05-02 23:52:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.02) internal successors, (102), 100 states have internal predecessors, (102), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2021-05-02 23:52:37,539 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 101 [2021-05-02 23:52:37,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:52:37,539 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2021-05-02 23:52:37,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 48 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2021-05-02 23:52:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-05-02 23:52:37,540 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:52:37,540 INFO L523 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:52:37,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-05-02 23:52:37,540 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:52:37,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:52:37,541 INFO L82 PathProgramCache]: Analyzing trace with hash -814681832, now seen corresponding path program 46 times [2021-05-02 23:52:37,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:52:37,541 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [78165405] [2021-05-02 23:52:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:52:37,549 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1269 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1269} OutVars{main_~x~0=v_main_~x~0_1269} AuxVars[] AssignedVars[] [2021-05-02 23:52:37,550 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:52:37,564 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:37,584 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:52:37,600 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:52:37,626 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:37,628 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1271 4294967296) 10000000) (< (mod (+ v_main_~x~0_1271 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_1271} OutVars{main_~x~0=v_main_~x~0_1271} AuxVars[] AssignedVars[] [2021-05-02 23:52:37,631 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:52:37,632 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:37,639 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:40,027 WARN L205 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:52:40,091 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:52:40,097 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:52:40,215 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:52:40,246 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:40,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:52:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:52:42,510 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:52:42,511 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [78165405] [2021-05-02 23:52:42,511 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [78165405] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:52:42,511 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:52:42,511 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-02 23:52:42,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132927086] [2021-05-02 23:52:42,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-02 23:52:42,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:52:42,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-02 23:52:42,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2021-05-02 23:52:42,512 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:52:46,518 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2021-05-02 23:52:46,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-02 23:52:46,519 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2021-05-02 23:52:46,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:52:46,524 INFO L225 Difference]: With dead ends: 114 [2021-05-02 23:52:46,524 INFO L226 Difference]: Without dead ends: 107 [2021-05-02 23:52:46,526 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 7 SyntacticMatches, 47 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 4097.5ms TimeCoverageRelationStatistics Valid=385, Invalid=9317, Unknown=0, NotChecked=0, Total=9702 [2021-05-02 23:52:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-02 23:52:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-05-02 23:52:46,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2021-05-02 23:52:46,540 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 103 [2021-05-02 23:52:46,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:52:46,540 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2021-05-02 23:52:46,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2021-05-02 23:52:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-02 23:52:46,541 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:52:46,541 INFO L523 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:52:46,541 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-05-02 23:52:46,541 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:52:46,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:52:46,542 INFO L82 PathProgramCache]: Analyzing trace with hash -149860555, now seen corresponding path program 47 times [2021-05-02 23:52:46,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:52:46,542 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [260056272] [2021-05-02 23:52:46,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:52:46,555 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1320 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1320} OutVars{main_~x~0=v_main_~x~0_1320} AuxVars[] AssignedVars[] [2021-05-02 23:52:46,557 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:52:46,571 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:46,593 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:52:46,608 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:52:46,640 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:46,642 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1322 1) 4294967296) 100000000) (< (mod v_main_~x~0_1322 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1322} OutVars{main_~x~0=v_main_~x~0_1322} AuxVars[] AssignedVars[] [2021-05-02 23:52:46,644 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:52:46,662 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:46,664 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:48,427 WARN L205 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:52:48,447 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:52:48,454 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:52:48,493 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:52:48,545 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:48,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:52:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:52:51,154 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:52:51,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [260056272] [2021-05-02 23:52:51,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [260056272] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:52:51,155 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:52:51,155 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-05-02 23:52:51,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582075184] [2021-05-02 23:52:51,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-05-02 23:52:51,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:52:51,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-05-02 23:52:51,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:52:51,156 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:52:55,168 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2021-05-02 23:52:55,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-02 23:52:55,169 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2021-05-02 23:52:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:52:55,170 INFO L225 Difference]: With dead ends: 116 [2021-05-02 23:52:55,170 INFO L226 Difference]: Without dead ends: 109 [2021-05-02 23:52:55,171 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 7 SyntacticMatches, 48 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 4422.2ms TimeCoverageRelationStatistics Valid=393, Invalid=9707, Unknown=0, NotChecked=0, Total=10100 [2021-05-02 23:52:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-02 23:52:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-05-02 23:52:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2021-05-02 23:52:55,185 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 105 [2021-05-02 23:52:55,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:52:55,185 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2021-05-02 23:52:55,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 51 states, 51 states have (on average 1.9803921568627452) internal successors, (101), 50 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:52:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2021-05-02 23:52:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-02 23:52:55,185 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:52:55,185 INFO L523 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:52:55,186 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-05-02 23:52:55,186 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:52:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:52:55,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1206740462, now seen corresponding path program 48 times [2021-05-02 23:52:55,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:52:55,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1184907755] [2021-05-02 23:52:55,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:52:55,193 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1372 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1372} OutVars{main_~x~0=v_main_~x~0_1372} AuxVars[] AssignedVars[] [2021-05-02 23:52:55,194 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:52:55,205 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:55,222 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:52:55,238 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:52:55,263 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:55,264 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1374 4294967296) 10000000) (< (mod (+ v_main_~x~0_1374 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_1374} OutVars{main_~x~0=v_main_~x~0_1374} AuxVars[] AssignedVars[] [2021-05-02 23:52:55,269 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:52:55,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:55,273 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:52:55,358 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:52:55,385 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:52:55,889 WARN L205 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 1 [2021-05-02 23:52:55,902 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:52:55,924 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:52:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:55,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:52:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:52:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:52:58,365 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:52:58,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1184907755] [2021-05-02 23:52:58,366 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1184907755] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:52:58,366 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:52:58,366 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-02 23:52:58,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963814433] [2021-05-02 23:52:58,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-02 23:52:58,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:52:58,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-02 23:52:58,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2021-05-02 23:52:58,367 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:53:02,543 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2021-05-02 23:53:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-02 23:53:02,544 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 107 [2021-05-02 23:53:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:53:02,544 INFO L225 Difference]: With dead ends: 118 [2021-05-02 23:53:02,544 INFO L226 Difference]: Without dead ends: 111 [2021-05-02 23:53:02,545 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 6 SyntacticMatches, 50 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 4404.2ms TimeCoverageRelationStatistics Valid=401, Invalid=10105, Unknown=0, NotChecked=0, Total=10506 [2021-05-02 23:53:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-05-02 23:53:02,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-05-02 23:53:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:02,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2021-05-02 23:53:02,553 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 107 [2021-05-02 23:53:02,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:53:02,553 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2021-05-02 23:53:02,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 51 states have internal predecessors, (103), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2021-05-02 23:53:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-05-02 23:53:02,554 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:53:02,554 INFO L523 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:53:02,554 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-05-02 23:53:02,554 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:53:02,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:53:02,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1038918063, now seen corresponding path program 49 times [2021-05-02 23:53:02,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:53:02,554 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1447931325] [2021-05-02 23:53:02,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:53:02,561 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1425 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1425} OutVars{main_~x~0=v_main_~x~0_1425} AuxVars[] AssignedVars[] [2021-05-02 23:53:02,563 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:53:02,564 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:02,583 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:53:02,610 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:53:02,634 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:53:02,638 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1427 1) 4294967296) 100000000) (< (mod v_main_~x~0_1427 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1427} OutVars{main_~x~0=v_main_~x~0_1427} AuxVars[] AssignedVars[] [2021-05-02 23:53:02,640 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:53:02,642 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:02,644 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:02,875 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:53:02,888 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:53:02,894 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:53:02,959 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:53:02,981 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:53:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:53:03,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:53:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:53:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:53:05,493 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:53:05,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1447931325] [2021-05-02 23:53:05,494 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1447931325] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:53:05,494 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:53:05,494 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-05-02 23:53:05,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492465084] [2021-05-02 23:53:05,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-05-02 23:53:05,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:53:05,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-05-02 23:53:05,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:53:05,495 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:53:09,807 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2021-05-02 23:53:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-02 23:53:09,808 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2021-05-02 23:53:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:53:09,809 INFO L225 Difference]: With dead ends: 120 [2021-05-02 23:53:09,809 INFO L226 Difference]: Without dead ends: 113 [2021-05-02 23:53:09,813 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 6 SyntacticMatches, 51 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 4497.0ms TimeCoverageRelationStatistics Valid=409, Invalid=10511, Unknown=0, NotChecked=0, Total=10920 [2021-05-02 23:53:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-02 23:53:09,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-05-02 23:53:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2021-05-02 23:53:09,820 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 109 [2021-05-02 23:53:09,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:53:09,821 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2021-05-02 23:53:09,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 53 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 52 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:09,821 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2021-05-02 23:53:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-02 23:53:09,821 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:53:09,821 INFO L523 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:53:09,822 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-05-02 23:53:09,822 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:53:09,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:53:09,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1251789300, now seen corresponding path program 50 times [2021-05-02 23:53:09,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:53:09,822 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2022146683] [2021-05-02 23:53:09,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:53:09,835 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1479 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1479} OutVars{main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[] [2021-05-02 23:53:09,837 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:53:09,838 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:09,855 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:53:09,881 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:53:09,908 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:53:09,910 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1481 1) 4294967296) 100000000) (< (mod v_main_~x~0_1481 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1481} OutVars{main_~x~0=v_main_~x~0_1481} AuxVars[] AssignedVars[] [2021-05-02 23:53:09,913 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:53:09,914 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:09,916 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:09,979 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:53:09,985 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:53:10,039 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:53:10,070 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:53:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:53:10,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:53:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:53:10,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-02 23:53:12,719 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:53:12,719 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2022146683] [2021-05-02 23:53:12,719 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2022146683] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:53:12,719 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:53:12,719 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-02 23:53:12,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489050306] [2021-05-02 23:53:12,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-02 23:53:12,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:53:12,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-02 23:53:12,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2021-05-02 23:53:12,721 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:53:17,473 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2021-05-02 23:53:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-02 23:53:17,473 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2021-05-02 23:53:17,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:53:17,474 INFO L225 Difference]: With dead ends: 122 [2021-05-02 23:53:17,474 INFO L226 Difference]: Without dead ends: 115 [2021-05-02 23:53:17,475 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 6 SyntacticMatches, 52 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1474 ImplicationChecksByTransitivity, 4914.3ms TimeCoverageRelationStatistics Valid=417, Invalid=10925, Unknown=0, NotChecked=0, Total=11342 [2021-05-02 23:53:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-05-02 23:53:17,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-05-02 23:53:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2021-05-02 23:53:17,483 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 111 [2021-05-02 23:53:17,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:53:17,483 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2021-05-02 23:53:17,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 54 states have (on average 1.9814814814814814) internal successors, (107), 53 states have internal predecessors, (107), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2021-05-02 23:53:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-02 23:53:17,484 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:53:17,484 INFO L523 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:53:17,484 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-05-02 23:53:17,484 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:53:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:53:17,484 INFO L82 PathProgramCache]: Analyzing trace with hash 696657705, now seen corresponding path program 51 times [2021-05-02 23:53:17,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:53:17,484 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [743383050] [2021-05-02 23:53:17,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:53:17,491 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1534 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1534} OutVars{main_~x~0=v_main_~x~0_1534} AuxVars[] AssignedVars[] [2021-05-02 23:53:17,493 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:53:17,506 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:17,528 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:53:17,546 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:53:17,572 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:53:17,574 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1536 1) 4294967296) 100000000) (< (mod v_main_~x~0_1536 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1536} OutVars{main_~x~0=v_main_~x~0_1536} AuxVars[] AssignedVars[] [2021-05-02 23:53:17,576 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:53:17,577 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:17,580 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:21,601 WARN L205 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:53:21,758 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:53:21,800 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:53:21,806 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:53:21,848 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:53:21,870 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:53:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:53:21,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:53:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:53:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:53:24,708 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:53:24,708 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [743383050] [2021-05-02 23:53:24,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [743383050] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:53:24,708 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:53:24,708 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-02 23:53:24,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014030043] [2021-05-02 23:53:24,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-02 23:53:24,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:53:24,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-02 23:53:24,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:53:24,709 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:53:29,429 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2021-05-02 23:53:29,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-02 23:53:29,430 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2021-05-02 23:53:29,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:53:29,431 INFO L225 Difference]: With dead ends: 124 [2021-05-02 23:53:29,431 INFO L226 Difference]: Without dead ends: 117 [2021-05-02 23:53:29,432 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 7 SyntacticMatches, 52 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 5020.3ms TimeCoverageRelationStatistics Valid=425, Invalid=11347, Unknown=0, NotChecked=0, Total=11772 [2021-05-02 23:53:29,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-05-02 23:53:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-05-02 23:53:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2021-05-02 23:53:29,439 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 113 [2021-05-02 23:53:29,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:53:29,439 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2021-05-02 23:53:29,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 54 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:29,440 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2021-05-02 23:53:29,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-05-02 23:53:29,440 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:53:29,440 INFO L523 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:53:29,440 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-05-02 23:53:29,440 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:53:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:53:29,441 INFO L82 PathProgramCache]: Analyzing trace with hash 548488454, now seen corresponding path program 52 times [2021-05-02 23:53:29,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:53:29,441 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [848923383] [2021-05-02 23:53:29,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:53:29,449 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1590 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1590} OutVars{main_~x~0=v_main_~x~0_1590} AuxVars[] AssignedVars[] [2021-05-02 23:53:29,451 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:53:29,453 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:29,472 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:53:29,533 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:53:29,562 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:53:29,564 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1592 1) 4294967296) 100000000) (< (mod v_main_~x~0_1592 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1592} OutVars{main_~x~0=v_main_~x~0_1592} AuxVars[] AssignedVars[] [2021-05-02 23:53:29,569 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:53:29,575 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:29,579 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:29,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:53:29,658 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:53:29,738 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:53:29,765 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:53:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:53:29,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:53:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:53:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:53:32,686 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:53:32,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [848923383] [2021-05-02 23:53:32,687 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [848923383] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:53:32,687 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:53:32,687 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2021-05-02 23:53:32,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055658160] [2021-05-02 23:53:32,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-05-02 23:53:32,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:53:32,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-05-02 23:53:32,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2021-05-02 23:53:32,688 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:53:37,765 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2021-05-02 23:53:37,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-05-02 23:53:37,769 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2021-05-02 23:53:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:53:37,770 INFO L225 Difference]: With dead ends: 126 [2021-05-02 23:53:37,770 INFO L226 Difference]: Without dead ends: 119 [2021-05-02 23:53:37,772 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 6 SyntacticMatches, 54 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 5281.1ms TimeCoverageRelationStatistics Valid=433, Invalid=11777, Unknown=0, NotChecked=0, Total=12210 [2021-05-02 23:53:37,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-02 23:53:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-05-02 23:53:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2021-05-02 23:53:37,780 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 115 [2021-05-02 23:53:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:53:37,780 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2021-05-02 23:53:37,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 55 states have internal predecessors, (111), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2021-05-02 23:53:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-05-02 23:53:37,781 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:53:37,781 INFO L523 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:53:37,781 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-05-02 23:53:37,781 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:53:37,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:53:37,782 INFO L82 PathProgramCache]: Analyzing trace with hash -108240989, now seen corresponding path program 53 times [2021-05-02 23:53:37,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:53:37,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1387499387] [2021-05-02 23:53:37,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:53:37,789 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1647 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1647} OutVars{main_~x~0=v_main_~x~0_1647} AuxVars[] AssignedVars[] [2021-05-02 23:53:37,791 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:53:37,792 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:37,809 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:53:37,836 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:53:37,864 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:53:37,866 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1649 4294967296) 10000000) (< (mod (+ v_main_~x~0_1649 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_1649} OutVars{main_~x~0=v_main_~x~0_1649} AuxVars[] AssignedVars[] [2021-05-02 23:53:37,868 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:53:37,886 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:37,894 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:41,293 WARN L205 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:53:41,322 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:53:41,331 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:53:41,364 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:53:41,390 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:53:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:53:41,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:53:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:53:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:53:44,439 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:53:44,440 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1387499387] [2021-05-02 23:53:44,440 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1387499387] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:53:44,440 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:53:44,440 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2021-05-02 23:53:44,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299973897] [2021-05-02 23:53:44,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2021-05-02 23:53:44,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:53:44,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-05-02 23:53:44,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 23:53:44,441 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:53:49,646 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2021-05-02 23:53:49,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-02 23:53:49,647 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2021-05-02 23:53:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:53:49,648 INFO L225 Difference]: With dead ends: 128 [2021-05-02 23:53:49,648 INFO L226 Difference]: Without dead ends: 121 [2021-05-02 23:53:49,649 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 7 SyntacticMatches, 54 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1642 ImplicationChecksByTransitivity, 5479.2ms TimeCoverageRelationStatistics Valid=441, Invalid=12215, Unknown=0, NotChecked=0, Total=12656 [2021-05-02 23:53:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-05-02 23:53:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-05-02 23:53:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0172413793103448) internal successors, (118), 116 states have internal predecessors, (118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2021-05-02 23:53:49,656 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 117 [2021-05-02 23:53:49,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:53:49,657 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2021-05-02 23:53:49,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 57 states, 57 states have (on average 1.9824561403508771) internal successors, (113), 56 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2021-05-02 23:53:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-05-02 23:53:49,657 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:53:49,657 INFO L523 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:53:49,657 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-05-02 23:53:49,658 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:53:49,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:53:49,658 INFO L82 PathProgramCache]: Analyzing trace with hash 134956800, now seen corresponding path program 54 times [2021-05-02 23:53:49,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:53:49,658 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [347706514] [2021-05-02 23:53:49,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:53:49,668 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1705 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1705} OutVars{main_~x~0=v_main_~x~0_1705} AuxVars[] AssignedVars[] [2021-05-02 23:53:49,670 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:53:49,680 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:49,698 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:53:49,714 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:53:49,737 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:53:49,738 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1707 4294967296) 10000000) (< (mod (+ v_main_~x~0_1707 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_1707} OutVars{main_~x~0=v_main_~x~0_1707} AuxVars[] AssignedVars[] [2021-05-02 23:53:49,739 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:53:49,756 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:49,758 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:50,658 WARN L205 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:53:50,661 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:53:50,668 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:53:50,735 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:53:50,759 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:53:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:53:50,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:53:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:53:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:53:54,141 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:53:54,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [347706514] [2021-05-02 23:53:54,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [347706514] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:53:54,142 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:53:54,142 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-02 23:53:54,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128749011] [2021-05-02 23:53:54,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-02 23:53:54,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:53:54,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-02 23:53:54,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2021-05-02 23:53:54,143 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:53:59,664 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2021-05-02 23:53:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-02 23:53:59,665 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2021-05-02 23:53:59,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:53:59,666 INFO L225 Difference]: With dead ends: 130 [2021-05-02 23:53:59,666 INFO L226 Difference]: Without dead ends: 123 [2021-05-02 23:53:59,667 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 6 SyntacticMatches, 56 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1700 ImplicationChecksByTransitivity, 5989.5ms TimeCoverageRelationStatistics Valid=449, Invalid=12661, Unknown=0, NotChecked=0, Total=13110 [2021-05-02 23:53:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-05-02 23:53:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-05-02 23:53:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2021-05-02 23:53:59,679 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 119 [2021-05-02 23:53:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:53:59,679 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2021-05-02 23:53:59,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 58 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 57 states have internal predecessors, (115), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:53:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2021-05-02 23:53:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-02 23:53:59,680 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:53:59,680 INFO L523 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:53:59,680 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-05-02 23:53:59,680 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:53:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:53:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1919798045, now seen corresponding path program 55 times [2021-05-02 23:53:59,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:53:59,681 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1945454133] [2021-05-02 23:53:59,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:53:59,703 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1764 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1764} OutVars{main_~x~0=v_main_~x~0_1764} AuxVars[] AssignedVars[] [2021-05-02 23:53:59,705 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:53:59,707 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:59,732 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:53:59,766 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:53:59,795 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:53:59,797 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1766 4294967296) 10000000) (< (mod (+ v_main_~x~0_1766 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_1766} OutVars{main_~x~0=v_main_~x~0_1766} AuxVars[] AssignedVars[] [2021-05-02 23:53:59,799 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:53:59,800 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:53:59,804 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:00,328 WARN L205 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:54:00,361 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:00,367 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:00,422 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:54:00,447 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:00,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:54:03,833 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:03,833 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1945454133] [2021-05-02 23:54:03,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1945454133] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:03,833 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:03,833 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2021-05-02 23:54:03,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114730778] [2021-05-02 23:54:03,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-05-02 23:54:03,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:03,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-05-02 23:54:03,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 23:54:03,834 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:09,756 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2021-05-02 23:54:09,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-02 23:54:09,757 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2021-05-02 23:54:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:09,758 INFO L225 Difference]: With dead ends: 132 [2021-05-02 23:54:09,758 INFO L226 Difference]: Without dead ends: 125 [2021-05-02 23:54:09,759 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 6 SyntacticMatches, 57 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 6127.4ms TimeCoverageRelationStatistics Valid=457, Invalid=13115, Unknown=0, NotChecked=0, Total=13572 [2021-05-02 23:54:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-05-02 23:54:09,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-05-02 23:54:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.0166666666666666) internal successors, (122), 120 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2021-05-02 23:54:09,767 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 121 [2021-05-02 23:54:09,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:09,767 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2021-05-02 23:54:09,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 59 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 58 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2021-05-02 23:54:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-02 23:54:09,767 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:09,768 INFO L523 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:09,768 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-05-02 23:54:09,768 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash -834683910, now seen corresponding path program 56 times [2021-05-02 23:54:09,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:09,768 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1801106013] [2021-05-02 23:54:09,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:09,775 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1824 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1824} OutVars{main_~x~0=v_main_~x~0_1824} AuxVars[] AssignedVars[] [2021-05-02 23:54:09,777 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:54:09,789 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:09,815 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:09,836 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:54:09,861 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:09,863 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1826 1) 4294967296) 100000000) (< (mod v_main_~x~0_1826 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1826} OutVars{main_~x~0=v_main_~x~0_1826} AuxVars[] AssignedVars[] [2021-05-02 23:54:09,865 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:54:09,866 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:09,867 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:10,212 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:54:10,265 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:10,272 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:10,420 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:54:12,476 WARN L205 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 28 [2021-05-02 23:54:12,477 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:12,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:54:16,137 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:16,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1801106013] [2021-05-02 23:54:16,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1801106013] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:16,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:16,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2021-05-02 23:54:16,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508669352] [2021-05-02 23:54:16,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2021-05-02 23:54:16,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:16,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-05-02 23:54:16,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2021-05-02 23:54:16,139 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:22,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:22,546 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2021-05-02 23:54:22,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-05-02 23:54:22,547 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2021-05-02 23:54:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:22,548 INFO L225 Difference]: With dead ends: 134 [2021-05-02 23:54:22,548 INFO L226 Difference]: Without dead ends: 127 [2021-05-02 23:54:22,549 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 6 SyntacticMatches, 58 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 6731.8ms TimeCoverageRelationStatistics Valid=465, Invalid=13577, Unknown=0, NotChecked=0, Total=14042 [2021-05-02 23:54:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-05-02 23:54:22,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-05-02 23:54:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2021-05-02 23:54:22,556 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 123 [2021-05-02 23:54:22,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:22,556 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2021-05-02 23:54:22,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 59 states have internal predecessors, (119), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2021-05-02 23:54:22,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-02 23:54:22,557 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:22,557 INFO L523 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:22,557 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-05-02 23:54:22,557 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:22,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:22,557 INFO L82 PathProgramCache]: Analyzing trace with hash 2102978967, now seen corresponding path program 57 times [2021-05-02 23:54:22,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:22,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1699788066] [2021-05-02 23:54:22,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:22,565 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1885 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1885} OutVars{main_~x~0=v_main_~x~0_1885} AuxVars[] AssignedVars[] [2021-05-02 23:54:22,566 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:54:22,580 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:22,601 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:22,802 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2021-05-02 23:54:22,803 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:54:22,831 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:22,833 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1887 1) 4294967296) 100000000) (< (mod v_main_~x~0_1887 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_1887} OutVars{main_~x~0=v_main_~x~0_1887} AuxVars[] AssignedVars[] [2021-05-02 23:54:22,834 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:54:22,835 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:22,837 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:22,886 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:22,892 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:22,937 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:54:22,965 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:23,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:54:26,859 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:26,860 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1699788066] [2021-05-02 23:54:26,860 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1699788066] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:26,860 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:26,860 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2021-05-02 23:54:26,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81364959] [2021-05-02 23:54:26,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-02 23:54:26,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:26,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-02 23:54:26,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2021-05-02 23:54:26,861 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:33,640 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-05-02 23:54:33,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-05-02 23:54:33,642 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2021-05-02 23:54:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:33,642 INFO L225 Difference]: With dead ends: 136 [2021-05-02 23:54:33,642 INFO L226 Difference]: Without dead ends: 129 [2021-05-02 23:54:33,643 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 6 SyntacticMatches, 59 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 7081.0ms TimeCoverageRelationStatistics Valid=473, Invalid=14047, Unknown=0, NotChecked=0, Total=14520 [2021-05-02 23:54:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-05-02 23:54:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-05-02 23:54:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2021-05-02 23:54:33,656 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 125 [2021-05-02 23:54:33,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:33,657 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2021-05-02 23:54:33,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 61 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 60 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2021-05-02 23:54:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-05-02 23:54:33,657 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:33,657 INFO L523 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:33,658 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-05-02 23:54:33,658 INFO L428 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:33,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash -891477004, now seen corresponding path program 58 times [2021-05-02 23:54:33,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:33,658 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1595623231] [2021-05-02 23:54:33,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:33,668 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1947 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_1947} OutVars{main_~x~0=v_main_~x~0_1947} AuxVars[] AssignedVars[] [2021-05-02 23:54:33,678 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:54:33,689 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:33,728 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:33,746 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:54:33,777 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:33,787 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1949 4294967296) 10000000) (< (mod (+ v_main_~x~0_1949 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_1949} OutVars{main_~x~0=v_main_~x~0_1949} AuxVars[] AssignedVars[] [2021-05-02 23:54:33,790 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:54:33,791 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:33,794 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:35,824 WARN L205 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:54:36,005 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:54:36,054 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:36,061 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:36,322 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 1 [2021-05-02 23:54:36,338 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:54:36,372 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:36,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:54:40,570 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:40,571 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1595623231] [2021-05-02 23:54:40,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1595623231] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:40,571 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:40,571 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2021-05-02 23:54:40,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951714761] [2021-05-02 23:54:40,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2021-05-02 23:54:40,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:40,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-05-02 23:54:40,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2021-05-02 23:54:40,572 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:54:47,795 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2021-05-02 23:54:47,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-05-02 23:54:47,795 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2021-05-02 23:54:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:54:47,796 INFO L225 Difference]: With dead ends: 138 [2021-05-02 23:54:47,796 INFO L226 Difference]: Without dead ends: 131 [2021-05-02 23:54:47,797 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 6 SyntacticMatches, 60 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 7663.9ms TimeCoverageRelationStatistics Valid=481, Invalid=14525, Unknown=0, NotChecked=0, Total=15006 [2021-05-02 23:54:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-02 23:54:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-05-02 23:54:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2021-05-02 23:54:47,805 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 127 [2021-05-02 23:54:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:54:47,805 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2021-05-02 23:54:47,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 62 states, 62 states have (on average 1.9838709677419355) internal successors, (123), 61 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:54:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2021-05-02 23:54:47,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-05-02 23:54:47,807 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:54:47,807 INFO L523 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:54:47,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-05-02 23:54:47,807 INFO L428 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:54:47,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:54:47,808 INFO L82 PathProgramCache]: Analyzing trace with hash -935576815, now seen corresponding path program 59 times [2021-05-02 23:54:47,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:54:47,808 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1004292439] [2021-05-02 23:54:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:54:47,815 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2010 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2010} OutVars{main_~x~0=v_main_~x~0_2010} AuxVars[] AssignedVars[] [2021-05-02 23:54:47,816 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:54:47,817 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:47,848 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:54:47,879 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:54:47,907 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:47,909 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2012 1) 4294967296) 100000000) (< (mod v_main_~x~0_2012 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_2012} OutVars{main_~x~0=v_main_~x~0_2012} AuxVars[] AssignedVars[] [2021-05-02 23:54:47,911 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:54:47,912 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:47,916 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:54:47,960 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:54:47,973 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:54:48,026 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:54:48,055 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:54:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:48,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:54:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:54:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:54:52,760 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:54:52,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1004292439] [2021-05-02 23:54:52,761 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1004292439] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:54:52,761 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:54:52,761 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2021-05-02 23:54:52,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805005919] [2021-05-02 23:54:52,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2021-05-02 23:54:52,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:54:52,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-05-02 23:54:52,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 23:54:52,762 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:00,919 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2021-05-02 23:55:00,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-05-02 23:55:00,920 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2021-05-02 23:55:00,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:00,921 INFO L225 Difference]: With dead ends: 140 [2021-05-02 23:55:00,921 INFO L226 Difference]: Without dead ends: 133 [2021-05-02 23:55:00,922 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 6 SyntacticMatches, 61 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2005 ImplicationChecksByTransitivity, 8661.2ms TimeCoverageRelationStatistics Valid=489, Invalid=15011, Unknown=0, NotChecked=0, Total=15500 [2021-05-02 23:55:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-05-02 23:55:00,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-05-02 23:55:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.015625) internal successors, (130), 128 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:00,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2021-05-02 23:55:00,929 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 129 [2021-05-02 23:55:00,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:00,930 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2021-05-02 23:55:00,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 63 states, 63 states have (on average 1.9841269841269842) internal successors, (125), 62 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:00,930 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2021-05-02 23:55:00,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-05-02 23:55:00,930 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:00,931 INFO L523 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:00,931 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-05-02 23:55:00,931 INFO L428 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:00,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:00,931 INFO L82 PathProgramCache]: Analyzing trace with hash -365822226, now seen corresponding path program 60 times [2021-05-02 23:55:00,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:00,931 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [475124438] [2021-05-02 23:55:00,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:00,943 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2074 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2074} OutVars{main_~x~0=v_main_~x~0_2074} AuxVars[] AssignedVars[] [2021-05-02 23:55:00,944 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:55:00,958 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:00,983 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:01,004 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:55:01,038 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:01,039 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2076 4294967296) 10000000) (< (mod (+ v_main_~x~0_2076 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2076} OutVars{main_~x~0=v_main_~x~0_2076} AuxVars[] AssignedVars[] [2021-05-02 23:55:01,041 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:55:01,042 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:01,046 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:01,364 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:55:01,399 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:01,406 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:01,465 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:55:01,503 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:01,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:55:06,930 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:06,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [475124438] [2021-05-02 23:55:06,931 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [475124438] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:06,931 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:06,931 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2021-05-02 23:55:06,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078498873] [2021-05-02 23:55:06,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-02 23:55:06,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:06,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-02 23:55:06,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2021-05-02 23:55:06,932 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:16,054 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2021-05-02 23:55:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-05-02 23:55:16,055 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2021-05-02 23:55:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:16,056 INFO L225 Difference]: With dead ends: 142 [2021-05-02 23:55:16,056 INFO L226 Difference]: Without dead ends: 135 [2021-05-02 23:55:16,057 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 7 SyntacticMatches, 61 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 9793.8ms TimeCoverageRelationStatistics Valid=497, Invalid=15505, Unknown=0, NotChecked=0, Total=16002 [2021-05-02 23:55:16,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-05-02 23:55:16,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-05-02 23:55:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2021-05-02 23:55:16,065 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 131 [2021-05-02 23:55:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:16,065 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2021-05-02 23:55:16,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 64 states have (on average 1.984375) internal successors, (127), 63 states have internal predecessors, (127), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2021-05-02 23:55:16,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-05-02 23:55:16,066 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:16,066 INFO L523 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:16,066 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-05-02 23:55:16,066 INFO L428 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:16,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1707491211, now seen corresponding path program 61 times [2021-05-02 23:55:16,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:16,067 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [474134989] [2021-05-02 23:55:16,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:16,076 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2139 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2139} OutVars{main_~x~0=v_main_~x~0_2139} AuxVars[] AssignedVars[] [2021-05-02 23:55:16,079 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:55:16,080 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:16,100 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:16,142 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:55:16,172 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:16,202 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2141 4294967296) 10000000) (< (mod (+ v_main_~x~0_2141 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2141} OutVars{main_~x~0=v_main_~x~0_2141} AuxVars[] AssignedVars[] [2021-05-02 23:55:16,205 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:55:16,207 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:16,212 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:16,369 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:55:16,423 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:16,433 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:16,506 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:55:16,557 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:16,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:55:22,537 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:22,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [474134989] [2021-05-02 23:55:22,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [474134989] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:22,538 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:22,538 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2021-05-02 23:55:22,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719091173] [2021-05-02 23:55:22,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-05-02 23:55:22,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:22,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-05-02 23:55:22,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2021-05-02 23:55:22,540 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:32,571 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2021-05-02 23:55:32,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-05-02 23:55:32,571 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2021-05-02 23:55:32,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:32,572 INFO L225 Difference]: With dead ends: 144 [2021-05-02 23:55:32,572 INFO L226 Difference]: Without dead ends: 137 [2021-05-02 23:55:32,574 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 6 SyntacticMatches, 63 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 10628.9ms TimeCoverageRelationStatistics Valid=505, Invalid=16007, Unknown=0, NotChecked=0, Total=16512 [2021-05-02 23:55:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-02 23:55:32,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-05-02 23:55:32,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.0151515151515151) internal successors, (134), 132 states have internal predecessors, (134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2021-05-02 23:55:32,588 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 133 [2021-05-02 23:55:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:32,588 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2021-05-02 23:55:32,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 65 states, 65 states have (on average 1.9846153846153847) internal successors, (129), 64 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2021-05-02 23:55:32,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-05-02 23:55:32,590 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:32,590 INFO L523 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:32,590 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-05-02 23:55:32,590 INFO L428 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:32,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:32,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1296878824, now seen corresponding path program 62 times [2021-05-02 23:55:32,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:32,590 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [160787575] [2021-05-02 23:55:32,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:32,601 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2205 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2205} OutVars{main_~x~0=v_main_~x~0_2205} AuxVars[] AssignedVars[] [2021-05-02 23:55:32,605 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:55:32,607 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:32,637 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:32,683 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:55:32,727 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:32,729 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2207 4294967296) 10000000) (< (mod (+ v_main_~x~0_2207 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2207} OutVars{main_~x~0=v_main_~x~0_2207} AuxVars[] AssignedVars[] [2021-05-02 23:55:32,731 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:55:32,733 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:32,736 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:32,994 WARN L205 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:55:33,194 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:55:33,201 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:33,209 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:33,286 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:55:33,323 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:33,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:55:39,729 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:39,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [160787575] [2021-05-02 23:55:39,731 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [160787575] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:39,732 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:39,732 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2021-05-02 23:55:39,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112283692] [2021-05-02 23:55:39,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2021-05-02 23:55:39,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:39,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-05-02 23:55:39,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2021-05-02 23:55:39,734 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:50,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:55:50,049 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2021-05-02 23:55:50,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-05-02 23:55:50,050 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2021-05-02 23:55:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:55:50,051 INFO L225 Difference]: With dead ends: 146 [2021-05-02 23:55:50,051 INFO L226 Difference]: Without dead ends: 139 [2021-05-02 23:55:50,052 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 6 SyntacticMatches, 64 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 11181.3ms TimeCoverageRelationStatistics Valid=513, Invalid=16517, Unknown=0, NotChecked=0, Total=17030 [2021-05-02 23:55:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-02 23:55:50,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-05-02 23:55:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2021-05-02 23:55:50,060 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 135 [2021-05-02 23:55:50,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:55:50,060 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2021-05-02 23:55:50,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 66 states, 66 states have (on average 1.9848484848484849) internal successors, (131), 65 states have internal predecessors, (131), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:55:50,060 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2021-05-02 23:55:50,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-05-02 23:55:50,061 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:55:50,061 INFO L523 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:55:50,061 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-05-02 23:55:50,061 INFO L428 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:55:50,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:55:50,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1835366149, now seen corresponding path program 63 times [2021-05-02 23:55:50,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:55:50,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1475199722] [2021-05-02 23:55:50,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:55:50,070 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2272 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2272} OutVars{main_~x~0=v_main_~x~0_2272} AuxVars[] AssignedVars[] [2021-05-02 23:55:50,072 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:55:50,073 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:50,094 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:55:50,135 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:55:50,177 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:50,180 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2274 4294967296) 10000000) (< (mod (+ v_main_~x~0_2274 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2274} OutVars{main_~x~0=v_main_~x~0_2274} AuxVars[] AssignedVars[] [2021-05-02 23:55:50,182 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:55:50,206 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:50,209 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:55:51,814 WARN L205 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:55:51,851 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:55:51,860 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:55:51,911 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:55:51,946 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:55:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:52,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:55:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:55:52,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-02 23:55:58,754 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:55:58,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1475199722] [2021-05-02 23:55:58,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1475199722] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:55:58,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:55:58,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2021-05-02 23:55:58,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741695079] [2021-05-02 23:55:58,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2021-05-02 23:55:58,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:55:58,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-05-02 23:55:58,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2021-05-02 23:55:58,756 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:56:10,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:56:10,730 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2021-05-02 23:56:10,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-05-02 23:56:10,732 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2021-05-02 23:56:10,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:56:10,733 INFO L225 Difference]: With dead ends: 148 [2021-05-02 23:56:10,733 INFO L226 Difference]: Without dead ends: 141 [2021-05-02 23:56:10,734 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 6 SyntacticMatches, 65 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2267 ImplicationChecksByTransitivity, 12130.7ms TimeCoverageRelationStatistics Valid=521, Invalid=17035, Unknown=0, NotChecked=0, Total=17556 [2021-05-02 23:56:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-05-02 23:56:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-05-02 23:56:10,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.0147058823529411) internal successors, (138), 136 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:56:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2021-05-02 23:56:10,743 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 137 [2021-05-02 23:56:10,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:56:10,743 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2021-05-02 23:56:10,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 67 states, 67 states have (on average 1.9850746268656716) internal successors, (133), 66 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:56:10,743 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2021-05-02 23:56:10,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-05-02 23:56:10,744 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:56:10,744 INFO L523 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:56:10,744 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-05-02 23:56:10,744 INFO L428 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:56:10,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:56:10,744 INFO L82 PathProgramCache]: Analyzing trace with hash -369357342, now seen corresponding path program 64 times [2021-05-02 23:56:10,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:56:10,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1271037825] [2021-05-02 23:56:10,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:56:10,754 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2340 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2340} OutVars{main_~x~0=v_main_~x~0_2340} AuxVars[] AssignedVars[] [2021-05-02 23:56:10,757 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:56:10,774 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:10,801 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:56:10,849 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:56:10,881 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:10,884 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2342 1) 4294967296) 100000000) (< (mod v_main_~x~0_2342 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_2342} OutVars{main_~x~0=v_main_~x~0_2342} AuxVars[] AssignedVars[] [2021-05-02 23:56:10,886 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:56:10,887 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:10,911 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:13,132 WARN L205 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:56:13,173 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:56:13,181 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:56:13,298 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:56:13,341 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:13,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:56:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:56:20,773 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:56:20,774 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1271037825] [2021-05-02 23:56:20,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1271037825] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:56:20,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:56:20,774 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2021-05-02 23:56:20,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320524610] [2021-05-02 23:56:20,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2021-05-02 23:56:20,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:56:20,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-05-02 23:56:20,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2021-05-02 23:56:20,776 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:56:33,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:56:33,454 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2021-05-02 23:56:33,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-05-02 23:56:33,459 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2021-05-02 23:56:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:56:33,459 INFO L225 Difference]: With dead ends: 150 [2021-05-02 23:56:33,460 INFO L226 Difference]: Without dead ends: 143 [2021-05-02 23:56:33,461 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 7 SyntacticMatches, 65 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2335 ImplicationChecksByTransitivity, 13066.1ms TimeCoverageRelationStatistics Valid=529, Invalid=17561, Unknown=0, NotChecked=0, Total=18090 [2021-05-02 23:56:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-02 23:56:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-05-02 23:56:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:56:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2021-05-02 23:56:33,470 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 139 [2021-05-02 23:56:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:56:33,471 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2021-05-02 23:56:33,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 68 states, 68 states have (on average 1.9852941176470589) internal successors, (135), 67 states have internal predecessors, (135), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:56:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2021-05-02 23:56:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-05-02 23:56:33,471 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:56:33,472 INFO L523 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:56:33,472 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-05-02 23:56:33,472 INFO L428 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:56:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:56:33,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1689755265, now seen corresponding path program 65 times [2021-05-02 23:56:33,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:56:33,473 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [853960851] [2021-05-02 23:56:33,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:56:33,495 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2409 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2409} OutVars{main_~x~0=v_main_~x~0_2409} AuxVars[] AssignedVars[] [2021-05-02 23:56:33,502 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:56:33,504 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:33,534 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:56:33,577 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:56:33,639 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:33,643 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2411 1) 4294967296) 100000000) (< (mod v_main_~x~0_2411 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_2411} OutVars{main_~x~0=v_main_~x~0_2411} AuxVars[] AssignedVars[] [2021-05-02 23:56:33,647 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:56:33,678 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:33,684 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:35,810 WARN L205 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:56:36,377 WARN L205 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:56:36,430 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:56:36,437 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:56:36,493 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:56:36,549 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:36,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:56:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:56:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:56:44,874 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:56:44,875 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [853960851] [2021-05-02 23:56:44,875 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [853960851] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:56:44,875 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:56:44,875 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2021-05-02 23:56:44,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966200151] [2021-05-02 23:56:44,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2021-05-02 23:56:44,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:56:44,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-05-02 23:56:44,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2021-05-02 23:56:44,877 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:56:58,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:56:58,662 INFO L93 Difference]: Finished difference Result 152 states and 156 transitions. [2021-05-02 23:56:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-05-02 23:56:58,664 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2021-05-02 23:56:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:56:58,665 INFO L225 Difference]: With dead ends: 152 [2021-05-02 23:56:58,665 INFO L226 Difference]: Without dead ends: 145 [2021-05-02 23:56:58,666 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 7 SyntacticMatches, 66 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2404 ImplicationChecksByTransitivity, 14262.8ms TimeCoverageRelationStatistics Valid=537, Invalid=18095, Unknown=0, NotChecked=0, Total=18632 [2021-05-02 23:56:58,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-05-02 23:56:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-05-02 23:56:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 states have internal predecessors, (142), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:56:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2021-05-02 23:56:58,675 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 141 [2021-05-02 23:56:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:56:58,675 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2021-05-02 23:56:58,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 69 states, 69 states have (on average 1.9855072463768115) internal successors, (137), 68 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:56:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2021-05-02 23:56:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-02 23:56:58,676 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:56:58,676 INFO L523 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:56:58,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-05-02 23:56:58,676 INFO L428 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:56:58,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:56:58,677 INFO L82 PathProgramCache]: Analyzing trace with hash 718160348, now seen corresponding path program 66 times [2021-05-02 23:56:58,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:56:58,677 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2084418062] [2021-05-02 23:56:58,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:56:58,687 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2479 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2479} OutVars{main_~x~0=v_main_~x~0_2479} AuxVars[] AssignedVars[] [2021-05-02 23:56:58,690 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:56:58,691 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:58,716 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:56:58,751 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:56:58,797 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:56:58,800 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2481 4294967296) 10000000) (< (mod (+ v_main_~x~0_2481 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2481} OutVars{main_~x~0=v_main_~x~0_2481} AuxVars[] AssignedVars[] [2021-05-02 23:56:58,803 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:56:58,805 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:56:58,808 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:00,829 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:57:01,094 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:57:01,139 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:57:01,152 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:57:01,225 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:57:01,261 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:01,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:57:10,165 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:10,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2084418062] [2021-05-02 23:57:10,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2084418062] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:10,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:10,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2021-05-02 23:57:10,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796683940] [2021-05-02 23:57:10,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2021-05-02 23:57:10,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:10,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-05-02 23:57:10,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2021-05-02 23:57:10,167 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:25,503 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2021-05-02 23:57:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-05-02 23:57:25,505 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2021-05-02 23:57:25,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:25,506 INFO L225 Difference]: With dead ends: 154 [2021-05-02 23:57:25,506 INFO L226 Difference]: Without dead ends: 147 [2021-05-02 23:57:25,507 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 6 SyntacticMatches, 68 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2474 ImplicationChecksByTransitivity, 15400.1ms TimeCoverageRelationStatistics Valid=545, Invalid=18637, Unknown=0, NotChecked=0, Total=19182 [2021-05-02 23:57:25,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-05-02 23:57:25,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-05-02 23:57:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2021-05-02 23:57:25,515 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 143 [2021-05-02 23:57:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:25,515 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2021-05-02 23:57:25,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 69 states have internal predecessors, (139), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2021-05-02 23:57:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-05-02 23:57:25,516 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:25,516 INFO L523 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:25,516 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-05-02 23:57:25,516 INFO L428 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:25,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:25,516 INFO L82 PathProgramCache]: Analyzing trace with hash -262308103, now seen corresponding path program 67 times [2021-05-02 23:57:25,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:25,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1687600519] [2021-05-02 23:57:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:25,525 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2550 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2550} OutVars{main_~x~0=v_main_~x~0_2550} AuxVars[] AssignedVars[] [2021-05-02 23:57:25,527 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:57:25,529 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:25,573 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:57:25,613 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:57:25,650 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:25,653 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2552 4294967296) 10000000) (< (mod (+ v_main_~x~0_2552 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2552} OutVars{main_~x~0=v_main_~x~0_2552} AuxVars[] AssignedVars[] [2021-05-02 23:57:25,655 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:57:25,660 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:25,664 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:26,010 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:57:26,066 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:57:26,073 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:57:26,149 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:57:26,202 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:26,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:57:35,097 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:35,097 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1687600519] [2021-05-02 23:57:35,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1687600519] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:35,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:35,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2021-05-02 23:57:35,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257956439] [2021-05-02 23:57:35,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2021-05-02 23:57:35,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:35,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-05-02 23:57:35,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2021-05-02 23:57:35,105 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:57:49,582 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2021-05-02 23:57:49,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-05-02 23:57:49,583 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2021-05-02 23:57:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:57:49,583 INFO L225 Difference]: With dead ends: 156 [2021-05-02 23:57:49,583 INFO L226 Difference]: Without dead ends: 149 [2021-05-02 23:57:49,584 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 6 SyntacticMatches, 69 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2545 ImplicationChecksByTransitivity, 15152.7ms TimeCoverageRelationStatistics Valid=553, Invalid=19187, Unknown=0, NotChecked=0, Total=19740 [2021-05-02 23:57:49,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-05-02 23:57:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2021-05-02 23:57:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.0138888888888888) internal successors, (146), 144 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2021-05-02 23:57:49,591 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 145 [2021-05-02 23:57:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:57:49,591 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2021-05-02 23:57:49,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 71 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 70 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:57:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2021-05-02 23:57:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-05-02 23:57:49,592 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:57:49,592 INFO L523 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:57:49,592 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-05-02 23:57:49,592 INFO L428 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:57:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:57:49,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1894651690, now seen corresponding path program 68 times [2021-05-02 23:57:49,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:57:49,593 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1786274811] [2021-05-02 23:57:49,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:57:49,599 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2622 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2622} OutVars{main_~x~0=v_main_~x~0_2622} AuxVars[] AssignedVars[] [2021-05-02 23:57:49,600 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:57:49,611 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:49,628 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:57:49,660 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:57:49,688 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:49,691 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2624 4294967296) 10000000) (< (mod (+ v_main_~x~0_2624 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2624} OutVars{main_~x~0=v_main_~x~0_2624} AuxVars[] AssignedVars[] [2021-05-02 23:57:49,693 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:57:49,710 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:49,712 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:57:49,790 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:57:49,803 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:57:49,835 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:57:49,859 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:57:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:49,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:57:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:57:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:57:55,243 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:57:55,243 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1786274811] [2021-05-02 23:57:55,244 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1786274811] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:57:55,244 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:57:55,244 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2021-05-02 23:57:55,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296541458] [2021-05-02 23:57:55,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2021-05-02 23:57:55,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:57:55,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-05-02 23:57:55,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=5186, Unknown=0, NotChecked=0, Total=5402 [2021-05-02 23:57:55,245 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:03,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:03,459 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2021-05-02 23:58:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-05-02 23:58:03,460 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2021-05-02 23:58:03,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:03,460 INFO L225 Difference]: With dead ends: 158 [2021-05-02 23:58:03,460 INFO L226 Difference]: Without dead ends: 151 [2021-05-02 23:58:03,461 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 6 SyntacticMatches, 70 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2617 ImplicationChecksByTransitivity, 8932.5ms TimeCoverageRelationStatistics Valid=561, Invalid=19745, Unknown=0, NotChecked=0, Total=20306 [2021-05-02 23:58:03,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-05-02 23:58:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-05-02 23:58:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2021-05-02 23:58:03,468 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 147 [2021-05-02 23:58:03,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:03,468 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2021-05-02 23:58:03,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 71 states have internal predecessors, (143), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2021-05-02 23:58:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-05-02 23:58:03,469 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:03,469 INFO L523 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:03,469 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-05-02 23:58:03,469 INFO L428 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:03,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:03,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1381191539, now seen corresponding path program 69 times [2021-05-02 23:58:03,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:03,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1883267086] [2021-05-02 23:58:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:03,475 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2695 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2695} OutVars{main_~x~0=v_main_~x~0_2695} AuxVars[] AssignedVars[] [2021-05-02 23:58:03,476 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:58:03,477 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:03,496 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:58:03,525 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:58:03,547 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:03,554 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2697 1) 4294967296) 100000000) (< (mod v_main_~x~0_2697 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_2697} OutVars{main_~x~0=v_main_~x~0_2697} AuxVars[] AssignedVars[] [2021-05-02 23:58:03,555 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:58:03,556 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:03,557 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:03,656 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:58:03,724 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:58:03,760 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:58:03,784 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:03,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:58:08,969 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:08,969 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1883267086] [2021-05-02 23:58:08,969 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1883267086] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:08,969 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:08,969 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2021-05-02 23:58:08,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676863751] [2021-05-02 23:58:08,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2021-05-02 23:58:08,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:08,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-05-02 23:58:08,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2021-05-02 23:58:08,970 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:17,551 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2021-05-02 23:58:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-05-02 23:58:17,552 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2021-05-02 23:58:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:17,552 INFO L225 Difference]: With dead ends: 160 [2021-05-02 23:58:17,553 INFO L226 Difference]: Without dead ends: 153 [2021-05-02 23:58:17,553 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 7 SyntacticMatches, 70 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2690 ImplicationChecksByTransitivity, 8900.4ms TimeCoverageRelationStatistics Valid=569, Invalid=20311, Unknown=0, NotChecked=0, Total=20880 [2021-05-02 23:58:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-05-02 23:58:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-05-02 23:58:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 148 states have internal predecessors, (150), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2021-05-02 23:58:17,560 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 149 [2021-05-02 23:58:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:17,560 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2021-05-02 23:58:17,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 73 states, 73 states have (on average 1.9863013698630136) internal successors, (145), 72 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2021-05-02 23:58:17,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-05-02 23:58:17,561 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:17,561 INFO L523 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:17,561 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-05-02 23:58:17,564 INFO L428 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:17,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:17,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1255506640, now seen corresponding path program 70 times [2021-05-02 23:58:17,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:17,565 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1887098126] [2021-05-02 23:58:17,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:17,571 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2769 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2769} OutVars{main_~x~0=v_main_~x~0_2769} AuxVars[] AssignedVars[] [2021-05-02 23:58:17,572 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:58:17,573 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:17,588 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:58:17,611 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:58:17,647 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:17,649 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2771 1) 4294967296) 100000000) (< (mod v_main_~x~0_2771 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_2771} OutVars{main_~x~0=v_main_~x~0_2771} AuxVars[] AssignedVars[] [2021-05-02 23:58:17,650 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:58:17,670 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:17,671 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:21,768 WARN L205 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:58:25,787 WARN L205 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:58:29,805 WARN L205 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:58:29,841 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:58:29,852 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:58:29,888 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:58:29,923 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:29,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:58:38,930 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:58:38,930 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1887098126] [2021-05-02 23:58:38,930 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1887098126] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:58:38,930 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:58:38,930 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2021-05-02 23:58:38,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411079319] [2021-05-02 23:58:38,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2021-05-02 23:58:38,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:58:38,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-05-02 23:58:38,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=5478, Unknown=0, NotChecked=0, Total=5700 [2021-05-02 23:58:38,931 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand has 74 states, 74 states have (on average 1.9864864864864864) internal successors, (147), 73 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:58:54,506 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2021-05-02 23:58:54,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-05-02 23:58:54,507 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.9864864864864864) internal successors, (147), 73 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2021-05-02 23:58:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:58:54,508 INFO L225 Difference]: With dead ends: 162 [2021-05-02 23:58:54,508 INFO L226 Difference]: Without dead ends: 155 [2021-05-02 23:58:54,509 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 7 SyntacticMatches, 71 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2764 ImplicationChecksByTransitivity, 15383.5ms TimeCoverageRelationStatistics Valid=577, Invalid=20885, Unknown=0, NotChecked=0, Total=21462 [2021-05-02 23:58:54,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-05-02 23:58:54,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-05-02 23:58:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2021-05-02 23:58:54,516 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 151 [2021-05-02 23:58:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:58:54,517 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2021-05-02 23:58:54,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 74 states, 74 states have (on average 1.9864864864864864) internal successors, (147), 73 states have internal predecessors, (147), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:58:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2021-05-02 23:58:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-05-02 23:58:54,517 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:58:54,517 INFO L523 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:58:54,517 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-05-02 23:58:54,517 INFO L428 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:58:54,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:58:54,518 INFO L82 PathProgramCache]: Analyzing trace with hash 731402989, now seen corresponding path program 71 times [2021-05-02 23:58:54,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:58:54,518 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [422110067] [2021-05-02 23:58:54,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:58:54,537 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2844 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2844} OutVars{main_~x~0=v_main_~x~0_2844} AuxVars[] AssignedVars[] [2021-05-02 23:58:54,538 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:58:54,554 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:54,572 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:58:54,607 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:58:54,644 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:54,646 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2846 1) 4294967296) 100000000) (< (mod v_main_~x~0_2846 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_2846} OutVars{main_~x~0=v_main_~x~0_2846} AuxVars[] AssignedVars[] [2021-05-02 23:58:54,647 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:58:54,668 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:54,670 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:58:55,188 WARN L205 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:58:55,256 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:58:55,267 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:58:55,523 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 1 [2021-05-02 23:58:55,528 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:58:55,562 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:58:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:55,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:58:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:58:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:59:05,112 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:05,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [422110067] [2021-05-02 23:59:05,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [422110067] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:05,112 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:05,112 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2021-05-02 23:59:05,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159610252] [2021-05-02 23:59:05,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2021-05-02 23:59:05,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:05,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-05-02 23:59:05,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=5627, Unknown=0, NotChecked=0, Total=5852 [2021-05-02 23:59:05,113 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand has 75 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 74 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:22,064 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2021-05-02 23:59:22,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-05-02 23:59:22,065 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 74 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2021-05-02 23:59:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:22,066 INFO L225 Difference]: With dead ends: 164 [2021-05-02 23:59:22,066 INFO L226 Difference]: Without dead ends: 157 [2021-05-02 23:59:22,067 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 7 SyntacticMatches, 72 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2839 ImplicationChecksByTransitivity, 16321.3ms TimeCoverageRelationStatistics Valid=585, Invalid=21467, Unknown=0, NotChecked=0, Total=22052 [2021-05-02 23:59:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-05-02 23:59:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-05-02 23:59:22,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.013157894736842) internal successors, (154), 152 states have internal predecessors, (154), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2021-05-02 23:59:22,074 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 153 [2021-05-02 23:59:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:22,074 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2021-05-02 23:59:22,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 75 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 74 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2021-05-02 23:59:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-05-02 23:59:22,075 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:22,075 INFO L523 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:22,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2021-05-02 23:59:22,075 INFO L428 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:22,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash -421031990, now seen corresponding path program 72 times [2021-05-02 23:59:22,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:22,075 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [795830044] [2021-05-02 23:59:22,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:22,087 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2920 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2920} OutVars{main_~x~0=v_main_~x~0_2920} AuxVars[] AssignedVars[] [2021-05-02 23:59:22,088 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:59:22,089 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:22,117 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:59:22,149 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:59:22,183 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:22,184 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2922 4294967296) 10000000) (< (mod (+ v_main_~x~0_2922 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2922} OutVars{main_~x~0=v_main_~x~0_2922} AuxVars[] AssignedVars[] [2021-05-02 23:59:22,194 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:59:22,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:22,217 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:22,273 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:59:22,284 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:59:22,352 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:59:22,397 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:22,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:59:32,028 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:59:32,029 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [795830044] [2021-05-02 23:59:32,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [795830044] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:59:32,029 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:59:32,029 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2021-05-02 23:59:32,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318849994] [2021-05-02 23:59:32,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2021-05-02 23:59:32,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:59:32,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-05-02 23:59:32,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=5778, Unknown=0, NotChecked=0, Total=6006 [2021-05-02 23:59:32,030 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand has 76 states, 76 states have (on average 1.986842105263158) internal successors, (151), 75 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:59:49,244 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2021-05-02 23:59:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-05-02 23:59:49,245 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.986842105263158) internal successors, (151), 75 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 155 [2021-05-02 23:59:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:59:49,246 INFO L225 Difference]: With dead ends: 166 [2021-05-02 23:59:49,246 INFO L226 Difference]: Without dead ends: 159 [2021-05-02 23:59:49,247 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 7 SyntacticMatches, 73 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2915 ImplicationChecksByTransitivity, 16544.5ms TimeCoverageRelationStatistics Valid=593, Invalid=22057, Unknown=0, NotChecked=0, Total=22650 [2021-05-02 23:59:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-05-02 23:59:49,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-05-02 23:59:49,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.0129870129870129) internal successors, (156), 154 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:49,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2021-05-02 23:59:49,258 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 155 [2021-05-02 23:59:49,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:59:49,258 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2021-05-02 23:59:49,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 76 states, 76 states have (on average 1.986842105263158) internal successors, (151), 75 states have internal predecessors, (151), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:59:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2021-05-02 23:59:49,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-05-02 23:59:49,259 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:59:49,259 INFO L523 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:59:49,259 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2021-05-02 23:59:49,259 INFO L428 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:59:49,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:59:49,259 INFO L82 PathProgramCache]: Analyzing trace with hash 190515559, now seen corresponding path program 73 times [2021-05-02 23:59:49,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:59:49,259 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1905061772] [2021-05-02 23:59:49,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:59:49,267 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2997 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_2997} OutVars{main_~x~0=v_main_~x~0_2997} AuxVars[] AssignedVars[] [2021-05-02 23:59:49,269 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:59:49,270 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:49,297 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:59:49,330 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:59:49,368 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:49,369 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2999 4294967296) 10000000) (< (mod (+ v_main_~x~0_2999 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_2999} OutVars{main_~x~0=v_main_~x~0_2999} AuxVars[] AssignedVars[] [2021-05-02 23:59:49,371 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:59:49,371 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:49,373 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:59:50,911 WARN L205 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:59:50,927 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:59:50,985 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:59:51,044 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:59:51,079 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:59:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:51,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:59:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:59:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:00:02,300 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:00:02,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1905061772] [2021-05-03 00:00:02,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1905061772] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:00:02,301 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:00:02,301 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2021-05-03 00:00:02,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307708994] [2021-05-03 00:00:02,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2021-05-03 00:00:02,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:00:02,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-05-03 00:00:02,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2021-05-03 00:00:02,302 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand has 77 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 76 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:00:26,696 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2021-05-03 00:00:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2021-05-03 00:00:26,697 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 76 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2021-05-03 00:00:26,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:00:26,698 INFO L225 Difference]: With dead ends: 168 [2021-05-03 00:00:26,698 INFO L226 Difference]: Without dead ends: 161 [2021-05-03 00:00:26,699 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 7 SyntacticMatches, 74 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 21002.3ms TimeCoverageRelationStatistics Valid=601, Invalid=22655, Unknown=0, NotChecked=0, Total=23256 [2021-05-03 00:00:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-05-03 00:00:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-05-03 00:00:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 156 states have (on average 1.0128205128205128) internal successors, (158), 156 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2021-05-03 00:00:26,706 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 157 [2021-05-03 00:00:26,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:00:26,706 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2021-05-03 00:00:26,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 77 states, 77 states have (on average 1.9870129870129871) internal successors, (153), 76 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:00:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2021-05-03 00:00:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-05-03 00:00:26,707 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:00:26,707 INFO L523 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:00:26,707 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-05-03 00:00:26,707 INFO L428 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:00:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:00:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash -522809404, now seen corresponding path program 74 times [2021-05-03 00:00:26,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:00:26,708 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1925507189] [2021-05-03 00:00:26,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:00:26,717 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_3075 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_3075} OutVars{main_~x~0=v_main_~x~0_3075} AuxVars[] AssignedVars[] [2021-05-03 00:00:26,718 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:00:26,734 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:26,760 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:00:26,782 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:00:26,822 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:26,823 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_3077 4294967296) 10000000) (< (mod (+ v_main_~x~0_3077 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_3077} OutVars{main_~x~0=v_main_~x~0_3077} AuxVars[] AssignedVars[] [2021-05-03 00:00:26,825 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:00:26,826 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:26,827 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:00:27,205 WARN L205 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:00:27,244 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:00:27,257 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:00:27,339 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:00:27,379 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:00:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:27,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:00:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:00:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:00:39,779 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:00:39,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1925507189] [2021-05-03 00:00:39,779 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1925507189] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:00:39,779 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:00:39,779 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2021-05-03 00:00:39,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730293258] [2021-05-03 00:00:39,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-03 00:00:39,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:00:39,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-03 00:00:39,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=6086, Unknown=0, NotChecked=0, Total=6320 [2021-05-03 00:00:39,780 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand has 78 states, 78 states have (on average 1.9871794871794872) internal successors, (155), 77 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:00,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:01:00,999 INFO L93 Difference]: Finished difference Result 170 states and 174 transitions. [2021-05-03 00:01:01,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-05-03 00:01:01,000 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.9871794871794872) internal successors, (155), 77 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 159 [2021-05-03 00:01:01,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:01:01,001 INFO L225 Difference]: With dead ends: 170 [2021-05-03 00:01:01,001 INFO L226 Difference]: Without dead ends: 163 [2021-05-03 00:01:01,002 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 7 SyntacticMatches, 75 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3070 ImplicationChecksByTransitivity, 20813.4ms TimeCoverageRelationStatistics Valid=609, Invalid=23261, Unknown=0, NotChecked=0, Total=23870 [2021-05-03 00:01:01,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-05-03 00:01:01,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-05-03 00:01:01,009 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:01:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2021-05-03 00:01:01,009 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 159 [2021-05-03 00:01:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:01:01,009 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2021-05-03 00:01:01,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 78 states, 78 states have (on average 1.9871794871794872) internal successors, (155), 77 states have internal predecessors, (155), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2021-05-03 00:01:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-05-03 00:01:01,010 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:01:01,010 INFO L523 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:01:01,010 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2021-05-03 00:01:01,010 INFO L428 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:01:01,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:01:01,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1166668513, now seen corresponding path program 75 times [2021-05-03 00:01:01,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:01:01,010 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1828386485] [2021-05-03 00:01:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:01:01,018 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_3154 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_3154} OutVars{main_~x~0=v_main_~x~0_3154} AuxVars[] AssignedVars[] [2021-05-03 00:01:01,020 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:01:01,036 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:01,060 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:01:01,089 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:01:01,141 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:01,142 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_3156 1) 4294967296) 100000000) (< (mod v_main_~x~0_3156 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_3156} OutVars{main_~x~0=v_main_~x~0_3156} AuxVars[] AssignedVars[] [2021-05-03 00:01:01,144 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:01:01,145 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:01,147 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:01,897 WARN L205 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-03 00:01:01,940 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:01:01,958 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:01:02,015 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:01:02,052 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:02,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:01:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:01:15,718 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:01:15,718 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1828386485] [2021-05-03 00:01:15,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1828386485] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:01:15,719 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:01:15,719 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [79] imperfect sequences [] total 79 [2021-05-03 00:01:15,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475445199] [2021-05-03 00:01:15,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2021-05-03 00:01:15,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:01:15,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2021-05-03 00:01:15,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2021-05-03 00:01:15,720 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:01:39,443 INFO L93 Difference]: Finished difference Result 172 states and 176 transitions. [2021-05-03 00:01:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-05-03 00:01:39,445 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2021-05-03 00:01:39,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:01:39,445 INFO L225 Difference]: With dead ends: 172 [2021-05-03 00:01:39,445 INFO L226 Difference]: Without dead ends: 165 [2021-05-03 00:01:39,446 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 6 SyntacticMatches, 77 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3149 ImplicationChecksByTransitivity, 22974.2ms TimeCoverageRelationStatistics Valid=617, Invalid=23875, Unknown=0, NotChecked=0, Total=24492 [2021-05-03 00:01:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-05-03 00:01:39,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2021-05-03 00:01:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.0125) internal successors, (162), 160 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2021-05-03 00:01:39,453 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 161 [2021-05-03 00:01:39,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:01:39,454 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2021-05-03 00:01:39,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 79 states, 79 states have (on average 1.9873417721518987) internal successors, (157), 78 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:01:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2021-05-03 00:01:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-05-03 00:01:39,454 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:01:39,454 INFO L523 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:01:39,454 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-05-03 00:01:39,455 INFO L428 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:01:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:01:39,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1257308862, now seen corresponding path program 76 times [2021-05-03 00:01:39,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:01:39,455 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [414953180] [2021-05-03 00:01:39,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:01:39,464 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_3234 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_3234} OutVars{main_~x~0=v_main_~x~0_3234} AuxVars[] AssignedVars[] [2021-05-03 00:01:39,466 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:01:39,483 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:39,507 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:01:39,538 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:01:39,601 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:39,602 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_3236 4294967296) 10000000) (< (mod (+ v_main_~x~0_3236 1) 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_3236} OutVars{main_~x~0=v_main_~x~0_3236} AuxVars[] AssignedVars[] [2021-05-03 00:01:39,604 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:01:39,631 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:39,637 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:01:39,716 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:01:39,730 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:01:39,784 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:01:39,823 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:01:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:39,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:01:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:01:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:01:52,966 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:01:52,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [414953180] [2021-05-03 00:01:52,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [414953180] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:01:52,966 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:01:52,966 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2021-05-03 00:01:52,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520511051] [2021-05-03 00:01:52,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2021-05-03 00:01:52,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:01:52,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-05-03 00:01:52,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=6402, Unknown=0, NotChecked=0, Total=6642 [2021-05-03 00:01:52,967 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:16,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:02:16,176 INFO L93 Difference]: Finished difference Result 174 states and 178 transitions. [2021-05-03 00:02:16,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-05-03 00:02:16,178 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 163 [2021-05-03 00:02:16,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:02:16,178 INFO L225 Difference]: With dead ends: 174 [2021-05-03 00:02:16,178 INFO L226 Difference]: Without dead ends: 167 [2021-05-03 00:02:16,179 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 6 SyntacticMatches, 78 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3229 ImplicationChecksByTransitivity, 22293.3ms TimeCoverageRelationStatistics Valid=625, Invalid=24497, Unknown=0, NotChecked=0, Total=25122 [2021-05-03 00:02:16,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-05-03 00:02:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-05-03 00:02:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 162 states have (on average 1.0123456790123457) internal successors, (164), 162 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2021-05-03 00:02:16,186 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 163 [2021-05-03 00:02:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:02:16,186 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2021-05-03 00:02:16,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 80 states, 80 states have (on average 1.9875) internal successors, (159), 79 states have internal predecessors, (159), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2021-05-03 00:02:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-05-03 00:02:16,187 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:02:16,187 INFO L523 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:02:16,187 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-05-03 00:02:16,187 INFO L428 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:02:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:02:16,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1831628965, now seen corresponding path program 77 times [2021-05-03 00:02:16,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:02:16,187 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1186636983] [2021-05-03 00:02:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:02:16,199 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_3315 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_3315} OutVars{main_~x~0=v_main_~x~0_3315} AuxVars[] AssignedVars[] [2021-05-03 00:02:16,200 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:02:16,214 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:16,249 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:02:16,272 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:02:16,317 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:16,319 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_3317 1) 4294967296) 100000000) (< (mod v_main_~x~0_3317 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_3317} OutVars{main_~x~0=v_main_~x~0_3317} AuxVars[] AssignedVars[] [2021-05-03 00:02:16,320 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:02:16,321 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:16,323 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:16,429 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:02:16,443 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:02:16,502 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:02:16,546 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:16,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:02:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:02:29,920 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:02:29,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1186636983] [2021-05-03 00:02:29,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1186636983] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:02:29,921 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:02:29,921 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2021-05-03 00:02:29,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325657808] [2021-05-03 00:02:29,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2021-05-03 00:02:29,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:02:29,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2021-05-03 00:02:29,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2021-05-03 00:02:29,922 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:51,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:02:51,549 INFO L93 Difference]: Finished difference Result 176 states and 180 transitions. [2021-05-03 00:02:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-05-03 00:02:51,550 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2021-05-03 00:02:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:02:51,550 INFO L225 Difference]: With dead ends: 176 [2021-05-03 00:02:51,550 INFO L226 Difference]: Without dead ends: 169 [2021-05-03 00:02:51,551 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 6 SyntacticMatches, 79 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3310 ImplicationChecksByTransitivity, 21898.7ms TimeCoverageRelationStatistics Valid=633, Invalid=25127, Unknown=0, NotChecked=0, Total=25760 [2021-05-03 00:02:51,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-05-03 00:02:51,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2021-05-03 00:02:51,558 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:02:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2021-05-03 00:02:51,558 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 165 [2021-05-03 00:02:51,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:02:51,559 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2021-05-03 00:02:51,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 81 states, 81 states have (on average 1.9876543209876543) internal successors, (161), 80 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:02:51,559 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2021-05-03 00:02:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-05-03 00:02:51,559 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:02:51,559 INFO L523 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:02:51,559 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2021-05-03 00:02:51,559 INFO L428 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:02:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:02:51,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1816488120, now seen corresponding path program 78 times [2021-05-03 00:02:51,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:02:51,560 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1578054400] [2021-05-03 00:02:51,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:02:51,567 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_3397 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_3397} OutVars{main_~x~0=v_main_~x~0_3397} AuxVars[] AssignedVars[] [2021-05-03 00:02:51,568 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:02:51,569 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:51,594 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:02:51,630 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:02:51,682 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:51,684 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_3399 1) 4294967296) 100000000) (< (mod v_main_~x~0_3399 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_3399} OutVars{main_~x~0=v_main_~x~0_3399} AuxVars[] AssignedVars[] [2021-05-03 00:02:51,685 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:02:51,686 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:51,687 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:02:51,863 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:02:51,886 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:02:51,958 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:02:51,998 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:02:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:52,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:02:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:02:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:03:04,958 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:03:04,958 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1578054400] [2021-05-03 00:03:04,958 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1578054400] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:03:04,958 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:03:04,958 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2021-05-03 00:03:04,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521131203] [2021-05-03 00:03:04,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2021-05-03 00:03:04,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:03:04,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2021-05-03 00:03:04,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=6726, Unknown=0, NotChecked=0, Total=6972 [2021-05-03 00:03:04,959 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:03:28,697 INFO L93 Difference]: Finished difference Result 178 states and 182 transitions. [2021-05-03 00:03:28,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-05-03 00:03:28,698 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 167 [2021-05-03 00:03:28,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:03:28,698 INFO L225 Difference]: With dead ends: 178 [2021-05-03 00:03:28,698 INFO L226 Difference]: Without dead ends: 171 [2021-05-03 00:03:28,699 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 7 SyntacticMatches, 79 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3392 ImplicationChecksByTransitivity, 22231.6ms TimeCoverageRelationStatistics Valid=641, Invalid=25765, Unknown=0, NotChecked=0, Total=26406 [2021-05-03 00:03:28,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-05-03 00:03:28,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-05-03 00:03:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.0120481927710843) internal successors, (168), 166 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2021-05-03 00:03:28,729 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 167 [2021-05-03 00:03:28,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:03:28,729 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2021-05-03 00:03:28,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 82 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 81 states have internal predecessors, (163), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-03 00:03:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2021-05-03 00:03:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-05-03 00:03:28,729 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:03:28,730 INFO L523 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:03:28,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2021-05-03 00:03:28,730 INFO L428 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:03:28,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:03:28,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1331274027, now seen corresponding path program 79 times [2021-05-03 00:03:28,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:03:28,730 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1524715845] [2021-05-03 00:03:28,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:03:28,759 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_3480 4294967296) 10000000) InVars {main_~x~0=v_main_~x~0_3480} OutVars{main_~x~0=v_main_~x~0_3480} AuxVars[] AssignedVars[] [2021-05-03 00:03:28,760 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-03 00:03:28,761 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:28,787 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-03 00:03:28,821 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-03 00:03:28,867 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:28,869 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_3482 1) 4294967296) 100000000) (< (mod v_main_~x~0_3482 4294967296) 10000000)) InVars {main_~x~0=v_main_~x~0_3482} OutVars{main_~x~0=v_main_~x~0_3482} AuxVars[] AssignedVars[] [2021-05-03 00:03:28,870 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-03 00:03:28,903 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:28,905 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-03 00:03:29,038 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-03 00:03:29,046 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-03 00:03:29,095 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-03 00:03:29,133 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-03 00:03:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:29,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:03:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:03:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.