/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/loop-acceleration/phases_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:28:30,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:28:30,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:28:30,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:28:30,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:28:30,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:28:30,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:28:30,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:28:30,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:28:30,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:28:30,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:28:30,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:28:30,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:28:30,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:28:30,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:28:30,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:28:30,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:28:30,330 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:28:30,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:28:30,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:28:30,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:28:30,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:28:30,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:28:30,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:28:30,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:28:30,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:28:30,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:28:30,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:28:30,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:28:30,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:28:30,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:28:30,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:28:30,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:28:30,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:28:30,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:28:30,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:28:30,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:28:30,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:28:30,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:28:30,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:28:30,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:28:30,394 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:28:30,415 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:28:30,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:28:30,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:28:30,421 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:28:30,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:28:30,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:28:30,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:28:30,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:28:30,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:28:30,422 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:28:30,423 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:28:30,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:28:30,423 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:28:30,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:28:30,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:28:30,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:28:30,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:28:30,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:28:30,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:28:30,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:28:30,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:28:30,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:28:30,425 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:28:30,426 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:28:30,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:28:30,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:28:30,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:28:30,884 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:28:30,886 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:28:30,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2021-05-02 23:28:30,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/849b66b40/44f994632c4047a2bcb80b2620855524/FLAG0210e4972 [2021-05-02 23:28:31,504 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:28:31,504 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2021-05-02 23:28:31,511 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/849b66b40/44f994632c4047a2bcb80b2620855524/FLAG0210e4972 [2021-05-02 23:28:31,900 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/849b66b40/44f994632c4047a2bcb80b2620855524 [2021-05-02 23:28:31,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:28:31,908 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:28:31,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:28:31,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:28:31,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:28:31,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:28:31" (1/1) ... [2021-05-02 23:28:31,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf26ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:31, skipping insertion in model container [2021-05-02 23:28:31,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:28:31" (1/1) ... [2021-05-02 23:28:31,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:28:31,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:28:32,108 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-1.c[322,335] [2021-05-02 23:28:32,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:28:32,139 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:28:32,153 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-1.c[322,335] [2021-05-02 23:28:32,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:28:32,173 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:28:32,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:32 WrapperNode [2021-05-02 23:28:32,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:28:32,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:28:32,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:28:32,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:28:32,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:32" (1/1) ... [2021-05-02 23:28:32,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:32" (1/1) ... [2021-05-02 23:28:32,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:32" (1/1) ... [2021-05-02 23:28:32,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:32" (1/1) ... [2021-05-02 23:28:32,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:32" (1/1) ... [2021-05-02 23:28:32,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:32" (1/1) ... [2021-05-02 23:28:32,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:32" (1/1) ... [2021-05-02 23:28:32,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:28:32,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:28:32,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:28:32,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:28:32,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:32" (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:28:32,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:28:32,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:28:32,344 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:28:32,344 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:28:32,344 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:28:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:28:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:28:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:28:32,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:28:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:28:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:28:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:28:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:28:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:28:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:28:32,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:28:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:28:32,615 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:28:32,616 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 23:28:32,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:28:32 BoogieIcfgContainer [2021-05-02 23:28:32,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:28:32,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:28:32,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:28:32,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:28:32,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:28:31" (1/3) ... [2021-05-02 23:28:32,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a89c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:28:32, skipping insertion in model container [2021-05-02 23:28:32,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:28:32" (2/3) ... [2021-05-02 23:28:32,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a89c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:28:32, skipping insertion in model container [2021-05-02 23:28:32,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:28:32" (3/3) ... [2021-05-02 23:28:32,632 INFO L111 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2021-05-02 23:28:32,642 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:28:32,647 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:28:32,666 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:28:32,699 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:28:32,699 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:28:32,699 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:28:32,699 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:28:32,700 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:28:32,700 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:28:32,700 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:28:32,700 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:28:32,724 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:28:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:28:32,732 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:28:32,733 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:28:32,734 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:28:32,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:28:32,740 INFO L82 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 1 times [2021-05-02 23:28:32,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:28:32,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [698342215] [2021-05-02 23:28:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:28:32,822 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:28:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:33,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:28:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:33,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:28:33,120 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:28:33,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [698342215] [2021-05-02 23:28:33,123 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [698342215] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:28:33,123 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:28:33,123 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 23:28:33,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111092869] [2021-05-02 23:28:33,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 23:28:33,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:28:33,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 23:28:33,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:28:33,154 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:28:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:28:33,266 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-05-02 23:28:33,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 23:28:33,270 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:28:33,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:28:33,277 INFO L225 Difference]: With dead ends: 30 [2021-05-02 23:28:33,277 INFO L226 Difference]: Without dead ends: 13 [2021-05-02 23:28:33,282 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 98.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:28:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-05-02 23:28:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-05-02 23:28:33,315 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:28:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-05-02 23:28:33,318 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2021-05-02 23:28:33,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:28:33,319 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-05-02 23:28:33,319 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:28:33,319 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-05-02 23:28:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:28:33,320 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:28:33,320 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:28:33,320 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:28:33,321 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:28:33,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:28:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 1 times [2021-05-02 23:28:33,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:28:33,322 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1205336604] [2021-05-02 23:28:33,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:28:33,325 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:28:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:33,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:28:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:33,465 INFO 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:28:33,466 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:28:33,466 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1205336604] [2021-05-02 23:28:33,467 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1205336604] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:28:33,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:28:33,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 23:28:33,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097847643] [2021-05-02 23:28:33,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 23:28:33,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:28:33,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 23:28:33,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:28:33,473 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:28:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:28:33,596 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2021-05-02 23:28:33,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 23:28:33,598 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:28:33,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:28:33,599 INFO L225 Difference]: With dead ends: 22 [2021-05-02 23:28:33,599 INFO L226 Difference]: Without dead ends: 15 [2021-05-02 23:28:33,602 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 102.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:28:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-05-02 23:28:33,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-05-02 23:28:33,622 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:28:33,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-05-02 23:28:33,623 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2021-05-02 23:28:33,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:28:33,624 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-05-02 23:28:33,624 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:28:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-05-02 23:28:33,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-02 23:28:33,625 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:28:33,625 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:28:33,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:28:33,627 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:28:33,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:28:33,628 INFO L82 PathProgramCache]: Analyzing trace with hash 925229631, now seen corresponding path program 1 times [2021-05-02 23:28:33,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:28:33,629 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2097360399] [2021-05-02 23:28:33,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:28:33,677 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_11 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] [2021-05-02 23:28:33,696 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:28:33,703 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:33,758 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:28:33,824 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:28:33,856 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:34,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:28:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:34,013 INFO 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:28:34,101 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:28:34,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2097360399] [2021-05-02 23:28:34,102 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2097360399] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:28:34,102 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:28:34,102 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:28:34,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024291943] [2021-05-02 23:28:34,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:28:34,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:28:34,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:28:34,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:28:34,104 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:28:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:28:34,241 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2021-05-02 23:28:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:28:34,242 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:28:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:28:34,244 INFO L225 Difference]: With dead ends: 24 [2021-05-02 23:28:34,244 INFO L226 Difference]: Without dead ends: 17 [2021-05-02 23:28:34,245 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 173.1ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:28:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-02 23:28:34,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-05-02 23:28:34,258 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:28:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-05-02 23:28:34,262 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2021-05-02 23:28:34,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:28:34,263 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-05-02 23:28:34,263 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:28:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-05-02 23:28:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:28:34,264 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:28:34,264 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:28:34,264 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:28:34,264 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:28:34,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:28:34,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1162777244, now seen corresponding path program 2 times [2021-05-02 23:28:34,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:28:34,265 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1777404000] [2021-05-02 23:28:34,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:28:34,278 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_15 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_15} OutVars{main_~x~0=v_main_~x~0_15} AuxVars[] AssignedVars[] [2021-05-02 23:28:34,294 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:28:34,326 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:34,362 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:28:34,382 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:28:34,410 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:34,414 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_17 4294967296) 65520) (< (mod (+ v_main_~x~0_17 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_17} OutVars{main_~x~0=v_main_~x~0_17} AuxVars[] AssignedVars[] [2021-05-02 23:28:34,422 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:28:34,444 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:34,456 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:38,485 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:28:42,652 WARN L205 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:28:46,672 WARN L205 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:28:46,753 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:28:46,773 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:28:46,829 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:28:47,155 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-05-02 23:28:47,158 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:47,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:28:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:47,356 INFO 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:28:47,521 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:28:47,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1777404000] [2021-05-02 23:28:47,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1777404000] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:28:47,522 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:28:47,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:28:47,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089921462] [2021-05-02 23:28:47,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:28:47,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:28:47,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:28:47,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:28:47,524 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:28:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:28:47,896 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2021-05-02 23:28:47,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:28:47,897 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:28:47,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:28:47,899 INFO L225 Difference]: With dead ends: 26 [2021-05-02 23:28:47,899 INFO L226 Difference]: Without dead ends: 19 [2021-05-02 23:28:47,900 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 443.7ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:28:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-02 23:28:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-05-02 23:28:47,907 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:28:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-05-02 23:28:47,910 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2021-05-02 23:28:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:28:47,910 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-05-02 23:28:47,910 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:28:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2021-05-02 23:28:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:28:47,913 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:28:47,913 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:28:47,914 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:28:47,914 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:28:47,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:28:47,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1812766649, now seen corresponding path program 3 times [2021-05-02 23:28:47,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:28:47,916 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1877759114] [2021-05-02 23:28:47,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:28:47,934 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_22 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_22} OutVars{main_~x~0=v_main_~x~0_22} AuxVars[] AssignedVars[] [2021-05-02 23:28:47,945 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:28:47,950 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:47,988 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:28:48,049 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:28:48,105 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:48,111 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_24 4294967296) 65520) (< (mod (+ v_main_~x~0_24 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_24} OutVars{main_~x~0=v_main_~x~0_24} AuxVars[] AssignedVars[] [2021-05-02 23:28:48,120 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:28:48,161 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:48,173 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:48,311 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:28:48,319 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:28:48,394 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:28:48,457 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:48,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:28:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:48,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:28:48,876 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:28:48,877 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1877759114] [2021-05-02 23:28:48,877 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1877759114] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:28:48,877 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:28:48,877 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:28:48,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989875069] [2021-05-02 23:28:48,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:28:48,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:28:48,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:28:48,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:28:48,879 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:28:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:28:49,295 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-05-02 23:28:49,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:28:49,296 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:28:49,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:28:49,297 INFO L225 Difference]: With dead ends: 28 [2021-05-02 23:28:49,297 INFO L226 Difference]: Without dead ends: 21 [2021-05-02 23:28:49,298 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 507.6ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:28:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-05-02 23:28:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-05-02 23:28:49,303 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:28:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-05-02 23:28:49,304 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2021-05-02 23:28:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:28:49,304 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-05-02 23:28:49,304 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:28:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-05-02 23:28:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 23:28:49,305 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:28:49,305 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:28:49,305 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:28:49,306 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:28:49,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:28:49,306 INFO L82 PathProgramCache]: Analyzing trace with hash -612640362, now seen corresponding path program 4 times [2021-05-02 23:28:49,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:28:49,306 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1236803732] [2021-05-02 23:28:49,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:28:49,318 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_30 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_30} OutVars{main_~x~0=v_main_~x~0_30} AuxVars[] AssignedVars[] [2021-05-02 23:28:49,322 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:28:49,345 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:49,379 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:28:49,412 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:28:49,468 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:49,471 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_32 1) 4294967296) 268435455) (< (mod v_main_~x~0_32 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_32} OutVars{main_~x~0=v_main_~x~0_32} AuxVars[] AssignedVars[] [2021-05-02 23:28:49,475 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:28:49,477 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:49,482 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:51,647 WARN L205 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:28:54,049 WARN L205 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-02 23:28:56,911 WARN L205 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:28:56,932 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:28:56,981 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:28:57,061 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:28:57,105 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:57,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:28:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:57,208 INFO 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:28:57,412 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:28:57,413 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1236803732] [2021-05-02 23:28:57,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1236803732] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:28:57,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:28:57,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:28:57,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88630494] [2021-05-02 23:28:57,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:28:57,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:28:57,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:28:57,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:28:57,415 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:28:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:28:57,769 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-05-02 23:28:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:28:57,770 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:28:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:28:57,771 INFO L225 Difference]: With dead ends: 30 [2021-05-02 23:28:57,771 INFO L226 Difference]: Without dead ends: 23 [2021-05-02 23:28:57,772 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 412.3ms TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:28:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-02 23:28:57,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-05-02 23:28:57,777 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:28:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-05-02 23:28:57,778 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2021-05-02 23:28:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:28:57,778 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-05-02 23:28:57,778 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:28:57,779 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-05-02 23:28:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 23:28:57,779 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:28:57,779 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:28:57,780 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 23:28:57,780 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:28:57,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:28:57,780 INFO L82 PathProgramCache]: Analyzing trace with hash 738463795, now seen corresponding path program 5 times [2021-05-02 23:28:57,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:28:57,781 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [239766679] [2021-05-02 23:28:57,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:28:57,791 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_39 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_39} OutVars{main_~x~0=v_main_~x~0_39} AuxVars[] AssignedVars[] [2021-05-02 23:28:57,794 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:28:57,795 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:57,836 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:28:57,876 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:28:57,915 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:57,918 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_41 4294967296) 65520) (< (mod (+ v_main_~x~0_41 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_41} OutVars{main_~x~0=v_main_~x~0_41} AuxVars[] AssignedVars[] [2021-05-02 23:28:57,921 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:28:57,953 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:57,963 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:58,048 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:28:58,061 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:28:58,113 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:28:58,154 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:58,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:58,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:28:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:58,276 INFO 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:28:58,478 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:28:58,479 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [239766679] [2021-05-02 23:28:58,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [239766679] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:28:58,479 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:28:58,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:28:58,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627597302] [2021-05-02 23:28:58,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:28:58,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:28:58,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:28:58,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:28:58,481 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:28:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:28:58,872 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2021-05-02 23:28:58,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:28:58,872 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:28:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:28:58,873 INFO L225 Difference]: With dead ends: 32 [2021-05-02 23:28:58,873 INFO L226 Difference]: Without dead ends: 25 [2021-05-02 23:28:58,874 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 463.0ms TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:28:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-02 23:28:58,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-05-02 23:28:58,879 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:28:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-05-02 23:28:58,880 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2021-05-02 23:28:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:28:58,880 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-05-02 23:28:58,880 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:28:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-05-02 23:28:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 23:28:58,881 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:28:58,881 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:28:58,881 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 23:28:58,881 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:28:58,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:28:58,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2069435280, now seen corresponding path program 6 times [2021-05-02 23:28:58,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:28:58,882 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1238226744] [2021-05-02 23:28:58,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:28:58,893 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_49 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_49} OutVars{main_~x~0=v_main_~x~0_49} AuxVars[] AssignedVars[] [2021-05-02 23:28:58,896 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:28:58,910 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:58,942 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:28:58,965 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:28:58,990 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:58,993 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_51 4294967296) 65520) (< (mod (+ v_main_~x~0_51 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_51} OutVars{main_~x~0=v_main_~x~0_51} AuxVars[] AssignedVars[] [2021-05-02 23:28:58,996 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:28:59,030 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:59,034 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:28:59,141 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:28:59,152 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:28:59,251 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:28:59,290 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:28:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:59,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:28:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:28:59,424 INFO 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:28:59,729 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:28:59,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1238226744] [2021-05-02 23:28:59,729 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1238226744] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:28:59,730 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:28:59,730 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:28:59,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299301462] [2021-05-02 23:28:59,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:28:59,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:28:59,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:28:59,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:28:59,731 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:29:00,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:00,379 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2021-05-02 23:29:00,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:29:00,380 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:29:00,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:00,381 INFO L225 Difference]: With dead ends: 34 [2021-05-02 23:29:00,381 INFO L226 Difference]: Without dead ends: 27 [2021-05-02 23:29:00,382 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 709.6ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:29:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-02 23:29:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-05-02 23:29:00,387 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:29:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-05-02 23:29:00,388 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2021-05-02 23:29:00,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:00,388 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-05-02 23:29:00,389 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:29:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2021-05-02 23:29:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-02 23:29:00,389 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:00,389 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:00,390 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:29:00,390 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:00,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:00,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1232778157, now seen corresponding path program 7 times [2021-05-02 23:29:00,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:00,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1894030944] [2021-05-02 23:29:00,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:00,402 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_60 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_60} OutVars{main_~x~0=v_main_~x~0_60} AuxVars[] AssignedVars[] [2021-05-02 23:29:00,405 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:00,407 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:00,442 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:00,494 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:00,526 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:00,529 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_62 1) 4294967296) 268435455) (< (mod v_main_~x~0_62 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_62} OutVars{main_~x~0=v_main_~x~0_62} AuxVars[] AssignedVars[] [2021-05-02 23:29:00,532 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:00,533 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:00,537 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:00,655 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:00,669 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:00,773 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:00,817 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:00,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:00,954 INFO 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:29:01,301 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:01,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1894030944] [2021-05-02 23:29:01,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1894030944] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:01,301 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:01,301 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 23:29:01,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668546650] [2021-05-02 23:29:01,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 23:29:01,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:01,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 23:29:01,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:29:01,303 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:29:02,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:02,058 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-05-02 23:29:02,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:29:02,059 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:29:02,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:02,060 INFO L225 Difference]: With dead ends: 36 [2021-05-02 23:29:02,060 INFO L226 Difference]: Without dead ends: 29 [2021-05-02 23:29:02,061 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 807.0ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:29:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-02 23:29:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-05-02 23:29:02,066 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:29:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-05-02 23:29:02,067 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2021-05-02 23:29:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:02,067 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-05-02 23:29:02,067 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:29:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-05-02 23:29:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 23:29:02,068 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:02,069 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:02,069 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 23:29:02,069 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:02,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:02,070 INFO L82 PathProgramCache]: Analyzing trace with hash 364167306, now seen corresponding path program 8 times [2021-05-02 23:29:02,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:02,070 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1503025534] [2021-05-02 23:29:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:02,082 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_72 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_72} OutVars{main_~x~0=v_main_~x~0_72} AuxVars[] AssignedVars[] [2021-05-02 23:29:02,085 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:02,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:02,142 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:02,177 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:02,232 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:02,234 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_74 4294967296) 65520) (< (mod (+ v_main_~x~0_74 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_74} OutVars{main_~x~0=v_main_~x~0_74} AuxVars[] AssignedVars[] [2021-05-02 23:29:02,238 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:02,267 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:02,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:03,062 WARN L205 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:29:03,105 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:03,114 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:03,159 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:03,201 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:03,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:03,336 INFO 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:29:03,736 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:03,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1503025534] [2021-05-02 23:29:03,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1503025534] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:03,737 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:03,737 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-02 23:29:03,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161109409] [2021-05-02 23:29:03,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 23:29:03,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:03,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 23:29:03,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:29:03,738 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:29:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:04,441 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2021-05-02 23:29:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 23:29:04,442 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:29:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:04,443 INFO L225 Difference]: With dead ends: 38 [2021-05-02 23:29:04,443 INFO L226 Difference]: Without dead ends: 31 [2021-05-02 23:29:04,444 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 821.5ms TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:29:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-05-02 23:29:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-05-02 23:29:04,448 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:29:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-05-02 23:29:04,449 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2021-05-02 23:29:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:04,449 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-05-02 23:29:04,450 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:29:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-05-02 23:29:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 23:29:04,450 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:04,451 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:04,451 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 23:29:04,451 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:04,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1147205081, now seen corresponding path program 9 times [2021-05-02 23:29:04,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:04,452 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [514162589] [2021-05-02 23:29:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:04,475 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_85 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_85} OutVars{main_~x~0=v_main_~x~0_85} AuxVars[] AssignedVars[] [2021-05-02 23:29:04,478 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:04,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:04,503 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:04,539 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:04,578 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:04,580 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_87 1) 4294967296) 268435455) (< (mod v_main_~x~0_87 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_87} OutVars{main_~x~0=v_main_~x~0_87} AuxVars[] AssignedVars[] [2021-05-02 23:29:04,583 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:04,584 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:04,587 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:04,659 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:04,665 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:04,725 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:04,764 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:04,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:04,911 INFO 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:29:05,378 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:05,379 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [514162589] [2021-05-02 23:29:05,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [514162589] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:05,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:05,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 23:29:05,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558368304] [2021-05-02 23:29:05,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 23:29:05,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:05,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 23:29:05,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:29:05,381 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:29:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:06,316 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2021-05-02 23:29:06,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 23:29:06,316 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:29:06,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:06,317 INFO L225 Difference]: With dead ends: 40 [2021-05-02 23:29:06,317 INFO L226 Difference]: Without dead ends: 33 [2021-05-02 23:29:06,317 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1022.4ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:29:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-02 23:29:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-05-02 23:29:06,322 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:29:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-05-02 23:29:06,322 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2021-05-02 23:29:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:06,323 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-05-02 23:29:06,323 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:29:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-05-02 23:29:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-02 23:29:06,324 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:06,324 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:06,324 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 23:29:06,324 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:06,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1877122940, now seen corresponding path program 10 times [2021-05-02 23:29:06,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:06,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1924927244] [2021-05-02 23:29:06,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:06,337 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_99 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_99} OutVars{main_~x~0=v_main_~x~0_99} AuxVars[] AssignedVars[] [2021-05-02 23:29:06,339 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:06,355 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:06,379 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:06,397 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:06,433 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:06,435 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_101 1) 4294967296) 268435455) (< (mod v_main_~x~0_101 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_101} OutVars{main_~x~0=v_main_~x~0_101} AuxVars[] AssignedVars[] [2021-05-02 23:29:06,438 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:06,439 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:06,442 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:06,607 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:06,616 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:06,676 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:06,733 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:06,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:06,853 INFO 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:29:07,406 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:07,406 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1924927244] [2021-05-02 23:29:07,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1924927244] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:07,407 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:07,407 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-02 23:29:07,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446924489] [2021-05-02 23:29:07,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 23:29:07,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:07,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 23:29:07,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:29:07,408 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:29:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:08,385 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2021-05-02 23:29:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 23:29:08,386 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:29:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:08,387 INFO L225 Difference]: With dead ends: 42 [2021-05-02 23:29:08,387 INFO L226 Difference]: Without dead ends: 35 [2021-05-02 23:29:08,388 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1127.3ms TimeCoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:29:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-02 23:29:08,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-05-02 23:29:08,393 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:29:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2021-05-02 23:29:08,394 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2021-05-02 23:29:08,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:08,394 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-05-02 23:29:08,394 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:29:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2021-05-02 23:29:08,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-05-02 23:29:08,395 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:08,395 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:08,395 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 23:29:08,395 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:08,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:08,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1046451105, now seen corresponding path program 11 times [2021-05-02 23:29:08,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:08,396 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995443987] [2021-05-02 23:29:08,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:08,404 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_114 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_114} OutVars{main_~x~0=v_main_~x~0_114} AuxVars[] AssignedVars[] [2021-05-02 23:29:08,406 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:08,420 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:08,470 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:08,495 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:08,545 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:08,550 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_116 1) 4294967296) 268435455) (< (mod v_main_~x~0_116 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_116} OutVars{main_~x~0=v_main_~x~0_116} AuxVars[] AssignedVars[] [2021-05-02 23:29:08,554 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:08,587 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:08,592 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:09,448 WARN L205 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:29:09,492 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:09,511 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:09,544 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:09,579 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:09,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:09,713 INFO 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:29:10,276 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:10,277 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995443987] [2021-05-02 23:29:10,277 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1995443987] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:10,277 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:10,277 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-05-02 23:29:10,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289949079] [2021-05-02 23:29:10,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-05-02 23:29:10,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:10,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-05-02 23:29:10,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:29:10,279 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:29:11,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:11,427 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-05-02 23:29:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 23:29:11,427 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:29:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:11,428 INFO L225 Difference]: With dead ends: 44 [2021-05-02 23:29:11,428 INFO L226 Difference]: Without dead ends: 37 [2021-05-02 23:29:11,429 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1231.6ms TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:29:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-05-02 23:29:11,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-05-02 23:29:11,435 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:29:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-05-02 23:29:11,435 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2021-05-02 23:29:11,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:11,436 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-05-02 23:29:11,436 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:29:11,436 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-05-02 23:29:11,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 23:29:11,437 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:11,437 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:11,437 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 23:29:11,437 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:11,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:11,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1692496766, now seen corresponding path program 12 times [2021-05-02 23:29:11,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:11,438 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [355765971] [2021-05-02 23:29:11,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:11,449 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_130 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_130} OutVars{main_~x~0=v_main_~x~0_130} AuxVars[] AssignedVars[] [2021-05-02 23:29:11,451 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:11,453 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:11,484 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:11,519 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:11,559 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:11,561 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_132 1) 4294967296) 268435455) (< (mod v_main_~x~0_132 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_132} OutVars{main_~x~0=v_main_~x~0_132} AuxVars[] AssignedVars[] [2021-05-02 23:29:11,563 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:11,564 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:11,567 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:12,851 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:29:12,873 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:12,879 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:12,923 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:12,954 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:13,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:13,567 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:13,568 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [355765971] [2021-05-02 23:29:13,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [355765971] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:13,568 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:13,568 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-05-02 23:29:13,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601961592] [2021-05-02 23:29:13,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-05-02 23:29:13,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:13,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-05-02 23:29:13,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:29:13,569 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:29:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:14,398 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2021-05-02 23:29:14,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:29:14,399 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:29:14,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:14,400 INFO L225 Difference]: With dead ends: 46 [2021-05-02 23:29:14,400 INFO L226 Difference]: Without dead ends: 39 [2021-05-02 23:29:14,400 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 13 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 957.2ms TimeCoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:29:14,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-02 23:29:14,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-05-02 23:29:14,405 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:29:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2021-05-02 23:29:14,406 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 35 [2021-05-02 23:29:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:14,409 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-05-02 23:29:14,409 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:29:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2021-05-02 23:29:14,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-02 23:29:14,410 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:14,410 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:14,411 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-05-02 23:29:14,411 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:14,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:14,411 INFO L82 PathProgramCache]: Analyzing trace with hash -227880933, now seen corresponding path program 13 times [2021-05-02 23:29:14,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:14,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [621922756] [2021-05-02 23:29:14,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:14,426 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_147 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_147} OutVars{main_~x~0=v_main_~x~0_147} AuxVars[] AssignedVars[] [2021-05-02 23:29:14,429 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:14,430 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:14,458 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:14,488 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:14,519 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:14,529 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_149 4294967296) 65520) (< (mod (+ v_main_~x~0_149 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_149} OutVars{main_~x~0=v_main_~x~0_149} AuxVars[] AssignedVars[] [2021-05-02 23:29:14,531 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:14,535 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:14,538 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:14,884 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:29:14,913 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:14,921 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:14,968 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:14,999 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:15,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:15,128 INFO 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:29:15,572 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:15,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [621922756] [2021-05-02 23:29:15,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [621922756] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:15,572 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:15,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-02 23:29:15,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149165231] [2021-05-02 23:29:15,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-02 23:29:15,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:15,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-02 23:29:15,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-05-02 23:29:15,574 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:29:16,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:16,395 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2021-05-02 23:29:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-02 23:29:16,396 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:29:16,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:16,397 INFO L225 Difference]: With dead ends: 48 [2021-05-02 23:29:16,397 INFO L226 Difference]: Without dead ends: 41 [2021-05-02 23:29:16,398 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 14 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 913.7ms TimeCoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:29:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-02 23:29:16,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2021-05-02 23:29:16,405 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:29:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-05-02 23:29:16,406 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 37 [2021-05-02 23:29:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:16,406 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-05-02 23:29:16,406 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:29:16,406 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-05-02 23:29:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-02 23:29:16,407 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:16,407 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:16,407 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-05-02 23:29:16,407 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:16,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:16,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1125087608, now seen corresponding path program 14 times [2021-05-02 23:29:16,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:16,408 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [937040668] [2021-05-02 23:29:16,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:16,416 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_165 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_165} OutVars{main_~x~0=v_main_~x~0_165} AuxVars[] AssignedVars[] [2021-05-02 23:29:16,418 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:16,432 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:16,453 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:16,476 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:16,505 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:16,509 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_167 1) 4294967296) 268435455) (< (mod v_main_~x~0_167 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_167} OutVars{main_~x~0=v_main_~x~0_167} AuxVars[] AssignedVars[] [2021-05-02 23:29:16,514 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:16,515 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:16,517 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:17,546 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:29:17,581 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:17,587 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:17,637 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:17,665 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:17,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:17,752 INFO 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:29:18,268 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:18,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [937040668] [2021-05-02 23:29:18,268 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [937040668] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:18,268 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:18,268 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-02 23:29:18,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446675277] [2021-05-02 23:29:18,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-02 23:29:18,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:18,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-02 23:29:18,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-05-02 23:29:18,269 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:29:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:19,413 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2021-05-02 23:29:19,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-02 23:29:19,414 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:29:19,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:19,414 INFO L225 Difference]: With dead ends: 50 [2021-05-02 23:29:19,414 INFO L226 Difference]: Without dead ends: 43 [2021-05-02 23:29:19,415 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 16 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1135.4ms TimeCoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:29:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-05-02 23:29:19,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-05-02 23:29:19,421 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:29:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-05-02 23:29:19,422 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 39 [2021-05-02 23:29:19,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:19,422 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-05-02 23:29:19,422 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:29:19,423 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-05-02 23:29:19,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-02 23:29:19,423 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:19,423 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:19,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-05-02 23:29:19,424 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:19,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:19,424 INFO L82 PathProgramCache]: Analyzing trace with hash -47235179, now seen corresponding path program 15 times [2021-05-02 23:29:19,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:19,425 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [574257808] [2021-05-02 23:29:19,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:19,434 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_184 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_184} OutVars{main_~x~0=v_main_~x~0_184} AuxVars[] AssignedVars[] [2021-05-02 23:29:19,446 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:19,467 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:19,497 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:19,520 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:19,561 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:19,564 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_186 4294967296) 65520) (< (mod (+ v_main_~x~0_186 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_186} OutVars{main_~x~0=v_main_~x~0_186} AuxVars[] AssignedVars[] [2021-05-02 23:29:19,566 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:19,595 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:19,597 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:20,095 WARN L205 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:29:20,138 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:20,151 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:20,207 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:20,247 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:20,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:21,283 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:21,283 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [574257808] [2021-05-02 23:29:21,283 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [574257808] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:21,283 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:21,283 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-02 23:29:21,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872097188] [2021-05-02 23:29:21,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-02 23:29:21,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:21,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-02 23:29:21,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:29:21,285 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:29:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:22,979 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-05-02 23:29:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 23:29:22,980 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:29:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:22,980 INFO L225 Difference]: With dead ends: 52 [2021-05-02 23:29:22,980 INFO L226 Difference]: Without dead ends: 45 [2021-05-02 23:29:22,981 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 16 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1809.9ms TimeCoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:29:22,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-05-02 23:29:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-05-02 23:29:22,987 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:29:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-05-02 23:29:22,988 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 41 [2021-05-02 23:29:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:22,988 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-05-02 23:29:22,988 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:29:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-05-02 23:29:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-02 23:29:22,989 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:22,989 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:22,989 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-02 23:29:22,990 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:22,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:22,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1368001934, now seen corresponding path program 16 times [2021-05-02 23:29:22,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:22,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [353638039] [2021-05-02 23:29:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:23,004 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_204 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_204} OutVars{main_~x~0=v_main_~x~0_204} AuxVars[] AssignedVars[] [2021-05-02 23:29:23,006 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:23,025 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:23,050 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:23,071 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:23,111 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:23,114 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_206 1) 4294967296) 268435455) (< (mod v_main_~x~0_206 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_206} OutVars{main_~x~0=v_main_~x~0_206} AuxVars[] AssignedVars[] [2021-05-02 23:29:23,116 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:23,143 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:23,146 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:23,211 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:23,220 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:23,281 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:23,321 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:23,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:23,435 INFO 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:29:24,411 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:24,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [353638039] [2021-05-02 23:29:24,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [353638039] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:24,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:24,412 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-02 23:29:24,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127836983] [2021-05-02 23:29:24,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 23:29:24,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:24,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 23:29:24,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:29:24,413 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:29:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:26,483 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2021-05-02 23:29:26,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-02 23:29:26,484 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:29:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:26,484 INFO L225 Difference]: With dead ends: 54 [2021-05-02 23:29:26,484 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 23:29:26,485 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 17 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 2077.7ms TimeCoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:29:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 23:29:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-05-02 23:29:26,492 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:29:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2021-05-02 23:29:26,492 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 43 [2021-05-02 23:29:26,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:26,493 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2021-05-02 23:29:26,493 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:29:26,493 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2021-05-02 23:29:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-05-02 23:29:26,494 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:26,494 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:26,494 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-05-02 23:29:26,494 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:26,495 INFO L82 PathProgramCache]: Analyzing trace with hash 685466127, now seen corresponding path program 17 times [2021-05-02 23:29:26,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:26,495 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [635664789] [2021-05-02 23:29:26,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:26,506 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_225 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_225} OutVars{main_~x~0=v_main_~x~0_225} AuxVars[] AssignedVars[] [2021-05-02 23:29:26,508 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:26,509 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:26,535 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:26,573 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:26,611 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:26,613 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_227 4294967296) 65520) (< (mod (+ v_main_~x~0_227 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_227} OutVars{main_~x~0=v_main_~x~0_227} AuxVars[] AssignedVars[] [2021-05-02 23:29:26,615 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:26,617 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:26,619 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:26,739 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:26,747 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:26,874 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:26,911 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:27,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:27,034 INFO 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:29:28,053 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:28,053 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [635664789] [2021-05-02 23:29:28,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [635664789] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:28,054 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:28,054 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-02 23:29:28,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485724691] [2021-05-02 23:29:28,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-02 23:29:28,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:28,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-02 23:29:28,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:29:28,055 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:29:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:30,090 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2021-05-02 23:29:30,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-05-02 23:29:30,091 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:29:30,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:30,091 INFO L225 Difference]: With dead ends: 56 [2021-05-02 23:29:30,092 INFO L226 Difference]: Without dead ends: 49 [2021-05-02 23:29:30,092 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 18 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2112.2ms TimeCoverageRelationStatistics Valid=153, Invalid=1487, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:29:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-05-02 23:29:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-05-02 23:29:30,097 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:29:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2021-05-02 23:29:30,098 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 45 [2021-05-02 23:29:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:30,098 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2021-05-02 23:29:30,098 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:29:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2021-05-02 23:29:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 23:29:30,099 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:30,099 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:30,099 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-05-02 23:29:30,099 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:30,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1616683412, now seen corresponding path program 18 times [2021-05-02 23:29:30,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:30,100 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1758546525] [2021-05-02 23:29:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:30,112 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_247 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_247} OutVars{main_~x~0=v_main_~x~0_247} AuxVars[] AssignedVars[] [2021-05-02 23:29:30,113 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:30,131 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:30,154 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:30,181 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:30,219 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:30,221 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_249 4294967296) 65520) (< (mod (+ v_main_~x~0_249 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_249} OutVars{main_~x~0=v_main_~x~0_249} AuxVars[] AssignedVars[] [2021-05-02 23:29:30,223 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:30,224 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:30,226 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:30,560 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:29:30,635 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:30,646 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:30,712 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:30,772 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:30,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:30,918 INFO 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:29:32,269 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:32,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1758546525] [2021-05-02 23:29:32,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1758546525] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:32,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:32,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-02 23:29:32,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384972327] [2021-05-02 23:29:32,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 23:29:32,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:32,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 23:29:32,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-05-02 23:29:32,271 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:29:33,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:33,688 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-05-02 23:29:33,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-05-02 23:29:33,688 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:29:33,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:33,689 INFO L225 Difference]: With dead ends: 58 [2021-05-02 23:29:33,689 INFO L226 Difference]: Without dead ends: 51 [2021-05-02 23:29:33,690 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 20 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 2164.9ms TimeCoverageRelationStatistics Valid=161, Invalid=1645, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:29:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-02 23:29:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-05-02 23:29:33,695 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:29:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2021-05-02 23:29:33,696 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 47 [2021-05-02 23:29:33,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:33,696 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2021-05-02 23:29:33,696 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:29:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2021-05-02 23:29:33,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-02 23:29:33,697 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:33,697 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:33,697 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-05-02 23:29:33,697 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:33,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:33,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2074232951, now seen corresponding path program 19 times [2021-05-02 23:29:33,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:33,698 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [443440781] [2021-05-02 23:29:33,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:33,706 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_270 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_270} OutVars{main_~x~0=v_main_~x~0_270} AuxVars[] AssignedVars[] [2021-05-02 23:29:33,707 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:33,722 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:33,740 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:33,756 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:33,783 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:33,785 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_272 4294967296) 65520) (< (mod (+ v_main_~x~0_272 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_272} OutVars{main_~x~0=v_main_~x~0_272} AuxVars[] AssignedVars[] [2021-05-02 23:29:33,789 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:33,790 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:33,801 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:33,926 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:33,943 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:34,007 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:34,035 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:34,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:34,150 INFO 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:29:34,934 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:34,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [443440781] [2021-05-02 23:29:34,934 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [443440781] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:34,934 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:34,934 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-02 23:29:34,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065375650] [2021-05-02 23:29:34,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-02 23:29:34,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:34,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-02 23:29:34,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:29:34,935 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:29:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:36,221 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-05-02 23:29:36,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-02 23:29:36,222 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:29:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:36,223 INFO L225 Difference]: With dead ends: 60 [2021-05-02 23:29:36,223 INFO L226 Difference]: Without dead ends: 53 [2021-05-02 23:29:36,223 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 6 SyntacticMatches, 21 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1522.7ms TimeCoverageRelationStatistics Valid=169, Invalid=1811, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:29:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-02 23:29:36,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-05-02 23:29:36,227 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:29:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2021-05-02 23:29:36,228 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 49 [2021-05-02 23:29:36,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:36,228 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2021-05-02 23:29:36,228 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:29:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2021-05-02 23:29:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-05-02 23:29:36,229 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:36,229 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:36,229 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-05-02 23:29:36,229 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:36,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:36,229 INFO L82 PathProgramCache]: Analyzing trace with hash 602291558, now seen corresponding path program 20 times [2021-05-02 23:29:36,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:36,230 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [644965082] [2021-05-02 23:29:36,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:36,236 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_294 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_294} OutVars{main_~x~0=v_main_~x~0_294} AuxVars[] AssignedVars[] [2021-05-02 23:29:36,237 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:36,238 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:36,276 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:36,362 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:36,386 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:36,390 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_296 4294967296) 65520) (< (mod (+ v_main_~x~0_296 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_296} OutVars{main_~x~0=v_main_~x~0_296} AuxVars[] AssignedVars[] [2021-05-02 23:29:36,392 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:36,392 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:36,394 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:36,524 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:29:36,572 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:36,601 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:36,656 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:36,680 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:36,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:36,784 INFO 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:29:37,501 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:37,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [644965082] [2021-05-02 23:29:37,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [644965082] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:37,501 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:37,502 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-02 23:29:37,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381121221] [2021-05-02 23:29:37,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 23:29:37,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:37,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 23:29:37,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2021-05-02 23:29:37,503 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:29:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:38,775 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2021-05-02 23:29:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-02 23:29:38,776 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:29:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:38,776 INFO L225 Difference]: With dead ends: 62 [2021-05-02 23:29:38,776 INFO L226 Difference]: Without dead ends: 55 [2021-05-02 23:29:38,777 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 6 SyntacticMatches, 22 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1413.0ms TimeCoverageRelationStatistics Valid=177, Invalid=1985, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:29:38,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-05-02 23:29:38,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-05-02 23:29:38,782 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:29:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-05-02 23:29:38,783 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 51 [2021-05-02 23:29:38,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:38,783 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-05-02 23:29:38,783 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:29:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-05-02 23:29:38,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-02 23:29:38,784 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:38,784 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:38,784 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-02 23:29:38,784 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:38,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:38,785 INFO L82 PathProgramCache]: Analyzing trace with hash 56934403, now seen corresponding path program 21 times [2021-05-02 23:29:38,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:38,785 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1537918261] [2021-05-02 23:29:38,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:38,795 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_319 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_319} OutVars{main_~x~0=v_main_~x~0_319} AuxVars[] AssignedVars[] [2021-05-02 23:29:38,796 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:38,797 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:38,812 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:38,837 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:38,859 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:38,861 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_321 1) 4294967296) 268435455) (< (mod v_main_~x~0_321 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_321} OutVars{main_~x~0=v_main_~x~0_321} AuxVars[] AssignedVars[] [2021-05-02 23:29:38,862 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:38,863 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:38,865 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:38,912 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:38,916 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:39,038 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:39,065 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:39,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:39,148 INFO 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:29:39,920 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:39,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1537918261] [2021-05-02 23:29:39,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1537918261] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:39,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:39,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-02 23:29:39,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420618380] [2021-05-02 23:29:39,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-02 23:29:39,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:39,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-02 23:29:39,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:29:39,921 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:29:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:42,248 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-05-02 23:29:42,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-02 23:29:42,249 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:29:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:42,249 INFO L225 Difference]: With dead ends: 64 [2021-05-02 23:29:42,249 INFO L226 Difference]: Without dead ends: 57 [2021-05-02 23:29:42,250 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 6 SyntacticMatches, 23 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1986.6ms TimeCoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:29:42,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-02 23:29:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-05-02 23:29:42,255 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:29:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2021-05-02 23:29:42,256 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 53 [2021-05-02 23:29:42,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:42,256 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2021-05-02 23:29:42,256 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:29:42,257 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2021-05-02 23:29:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-05-02 23:29:42,257 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:42,257 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:42,257 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-05-02 23:29:42,257 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:42,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:42,258 INFO L82 PathProgramCache]: Analyzing trace with hash -45281440, now seen corresponding path program 22 times [2021-05-02 23:29:42,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:42,258 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [514890918] [2021-05-02 23:29:42,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:42,271 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_345 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_345} OutVars{main_~x~0=v_main_~x~0_345} AuxVars[] AssignedVars[] [2021-05-02 23:29:42,272 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:42,273 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:42,305 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:42,345 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:42,379 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:42,381 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_347 4294967296) 65520) (< (mod (+ v_main_~x~0_347 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_347} OutVars{main_~x~0=v_main_~x~0_347} AuxVars[] AssignedVars[] [2021-05-02 23:29:42,384 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:42,406 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:42,410 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:42,593 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:29:42,644 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:42,651 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:42,688 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:42,728 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:42,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:42,864 INFO 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:29:44,485 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:44,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [514890918] [2021-05-02 23:29:44,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [514890918] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:44,485 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:44,486 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-02 23:29:44,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105776254] [2021-05-02 23:29:44,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 23:29:44,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:44,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 23:29:44,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2021-05-02 23:29:44,487 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:29:47,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:47,236 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2021-05-02 23:29:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-02 23:29:47,236 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:29:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:47,237 INFO L225 Difference]: With dead ends: 66 [2021-05-02 23:29:47,237 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 23:29:47,238 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 6 SyntacticMatches, 24 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 3110.8ms TimeCoverageRelationStatistics Valid=193, Invalid=2357, Unknown=0, NotChecked=0, Total=2550 [2021-05-02 23:29:47,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 23:29:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-02 23:29:47,243 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:29:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2021-05-02 23:29:47,243 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 55 [2021-05-02 23:29:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:47,244 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2021-05-02 23:29:47,244 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:29:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2021-05-02 23:29:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-05-02 23:29:47,244 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:47,244 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:47,244 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-05-02 23:29:47,244 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:47,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:47,245 INFO L82 PathProgramCache]: Analyzing trace with hash 509541245, now seen corresponding path program 23 times [2021-05-02 23:29:47,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:47,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1315857920] [2021-05-02 23:29:47,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:47,251 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_372 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_372} OutVars{main_~x~0=v_main_~x~0_372} AuxVars[] AssignedVars[] [2021-05-02 23:29:47,256 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:47,356 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:47,392 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:47,408 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:47,430 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:47,431 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_374 4294967296) 65520) (< (mod (+ v_main_~x~0_374 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_374} OutVars{main_~x~0=v_main_~x~0_374} AuxVars[] AssignedVars[] [2021-05-02 23:29:47,433 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:47,434 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:47,435 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:48,520 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:29:48,542 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:48,547 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:48,602 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:48,627 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:48,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:48,714 INFO 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:29:49,655 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:49,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1315857920] [2021-05-02 23:29:49,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1315857920] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:49,655 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:49,655 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-05-02 23:29:49,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233571062] [2021-05-02 23:29:49,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-05-02 23:29:49,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:49,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-05-02 23:29:49,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:29:49,656 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:29:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:51,234 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2021-05-02 23:29:51,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-02 23:29:51,234 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:29:51,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:51,235 INFO L225 Difference]: With dead ends: 68 [2021-05-02 23:29:51,235 INFO L226 Difference]: Without dead ends: 61 [2021-05-02 23:29:51,236 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 7 SyntacticMatches, 24 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1796.7ms TimeCoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:29:51,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-02 23:29:51,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-05-02 23:29:51,239 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:29:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2021-05-02 23:29:51,240 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 57 [2021-05-02 23:29:51,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:51,240 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2021-05-02 23:29:51,240 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:29:51,240 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2021-05-02 23:29:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-02 23:29:51,240 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:51,241 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:51,241 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-05-02 23:29:51,241 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:51,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1118196826, now seen corresponding path program 24 times [2021-05-02 23:29:51,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:51,241 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [342438207] [2021-05-02 23:29:51,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:51,256 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_400 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_400} OutVars{main_~x~0=v_main_~x~0_400} AuxVars[] AssignedVars[] [2021-05-02 23:29:51,258 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:51,258 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:51,275 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:51,302 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:51,332 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:51,338 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_402 1) 4294967296) 268435455) (< (mod v_main_~x~0_402 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_402} OutVars{main_~x~0=v_main_~x~0_402} AuxVars[] AssignedVars[] [2021-05-02 23:29:51,340 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:51,365 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:51,368 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:51,434 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:51,443 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:51,493 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:51,536 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:51,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:51,649 INFO 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:29:52,628 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:52,628 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [342438207] [2021-05-02 23:29:52,628 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [342438207] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:52,628 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:52,628 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-02 23:29:52,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333952845] [2021-05-02 23:29:52,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 23:29:52,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:52,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 23:29:52,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:29:52,630 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:29:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:54,334 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-05-02 23:29:54,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-02 23:29:54,335 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:29:54,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:54,335 INFO L225 Difference]: With dead ends: 70 [2021-05-02 23:29:54,335 INFO L226 Difference]: Without dead ends: 63 [2021-05-02 23:29:54,336 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 6 SyntacticMatches, 26 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1885.9ms TimeCoverageRelationStatistics Valid=209, Invalid=2761, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:29:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-02 23:29:54,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-05-02 23:29:54,340 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:29:54,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2021-05-02 23:29:54,340 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 59 [2021-05-02 23:29:54,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:54,340 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2021-05-02 23:29:54,340 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:29:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2021-05-02 23:29:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-05-02 23:29:54,341 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:54,341 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:54,341 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-05-02 23:29:54,341 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:54,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:54,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1920657911, now seen corresponding path program 25 times [2021-05-02 23:29:54,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:54,341 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2070797697] [2021-05-02 23:29:54,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:54,352 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_429 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_429} OutVars{main_~x~0=v_main_~x~0_429} AuxVars[] AssignedVars[] [2021-05-02 23:29:54,354 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:54,354 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:54,381 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:54,417 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:54,449 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:54,451 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_431 1) 4294967296) 268435455) (< (mod v_main_~x~0_431 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_431} OutVars{main_~x~0=v_main_~x~0_431} AuxVars[] AssignedVars[] [2021-05-02 23:29:54,452 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:54,453 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:54,456 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:54,507 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:54,513 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:54,561 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:54,589 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:54,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:54,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:29:55,627 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:55,627 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2070797697] [2021-05-02 23:29:55,627 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2070797697] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:55,628 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:55,628 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-02 23:29:55,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878328024] [2021-05-02 23:29:55,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-02 23:29:55,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:55,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-02 23:29:55,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:29:55,629 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:29:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:57,525 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2021-05-02 23:29:57,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-02 23:29:57,526 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:29:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:57,526 INFO L225 Difference]: With dead ends: 72 [2021-05-02 23:29:57,527 INFO L226 Difference]: Without dead ends: 65 [2021-05-02 23:29:57,527 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 7 SyntacticMatches, 26 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1947.7ms TimeCoverageRelationStatistics Valid=217, Invalid=2975, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:29:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-02 23:29:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-05-02 23:29:57,531 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:29:57,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2021-05-02 23:29:57,531 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 61 [2021-05-02 23:29:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:57,531 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2021-05-02 23:29:57,532 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:29:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2021-05-02 23:29:57,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-05-02 23:29:57,532 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:57,532 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:57,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-02 23:29:57,532 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:57,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:57,533 INFO L82 PathProgramCache]: Analyzing trace with hash -8352684, now seen corresponding path program 26 times [2021-05-02 23:29:57,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:57,533 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [475104622] [2021-05-02 23:29:57,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:57,539 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_459 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_459} OutVars{main_~x~0=v_main_~x~0_459} AuxVars[] AssignedVars[] [2021-05-02 23:29:57,541 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:29:57,551 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:57,573 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:29:57,596 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:29:57,631 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:57,633 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_461 4294967296) 65520) (< (mod (+ v_main_~x~0_461 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_461} OutVars{main_~x~0=v_main_~x~0_461} AuxVars[] AssignedVars[] [2021-05-02 23:29:57,635 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:29:57,636 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:57,638 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:29:57,867 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:29:57,929 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:29:57,942 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:29:58,028 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:29:58,049 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:29:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:58,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:58,107 INFO 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:29:59,105 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:59,105 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [475104622] [2021-05-02 23:29:59,105 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [475104622] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:59,106 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:59,106 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-02 23:29:59,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046886710] [2021-05-02 23:29:59,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-02 23:29:59,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:59,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-02 23:29:59,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2021-05-02 23:29:59,107 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:30:00,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:00,918 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2021-05-02 23:30:00,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-02 23:30:00,919 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:30:00,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:00,919 INFO L225 Difference]: With dead ends: 74 [2021-05-02 23:30:00,919 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 23:30:00,920 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 6 SyntacticMatches, 28 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1951.4ms TimeCoverageRelationStatistics Valid=225, Invalid=3197, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 23:30:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 23:30:00,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-05-02 23:30:00,925 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:30:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2021-05-02 23:30:00,925 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 63 [2021-05-02 23:30:00,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:00,925 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2021-05-02 23:30:00,926 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:30:00,926 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2021-05-02 23:30:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-02 23:30:00,926 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:00,926 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:00,926 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-05-02 23:30:00,926 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:00,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:00,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1638337393, now seen corresponding path program 27 times [2021-05-02 23:30:00,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:00,927 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [679974932] [2021-05-02 23:30:00,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:00,935 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_490 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_490} OutVars{main_~x~0=v_main_~x~0_490} AuxVars[] AssignedVars[] [2021-05-02 23:30:00,937 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:00,938 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:00,959 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:00,985 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:01,025 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:01,027 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_492 1) 4294967296) 268435455) (< (mod v_main_~x~0_492 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_492} OutVars{main_~x~0=v_main_~x~0_492} AuxVars[] AssignedVars[] [2021-05-02 23:30:01,029 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:01,051 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:01,053 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:01,238 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:30:01,251 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:01,267 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:01,310 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:01,337 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:01,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:01,416 INFO 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:30:02,679 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:02,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [679974932] [2021-05-02 23:30:02,679 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [679974932] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:02,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:02,680 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-02 23:30:02,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961931044] [2021-05-02 23:30:02,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-02 23:30:02,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:02,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-02 23:30:02,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:30:02,681 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:30:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:04,982 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2021-05-02 23:30:04,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-02 23:30:04,983 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:30:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:04,983 INFO L225 Difference]: With dead ends: 76 [2021-05-02 23:30:04,983 INFO L226 Difference]: Without dead ends: 69 [2021-05-02 23:30:04,984 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 6 SyntacticMatches, 29 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 2444.6ms TimeCoverageRelationStatistics Valid=233, Invalid=3427, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 23:30:04,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-02 23:30:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-05-02 23:30:04,990 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:30:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2021-05-02 23:30:04,991 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 65 [2021-05-02 23:30:04,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:04,991 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2021-05-02 23:30:04,991 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:30:04,991 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2021-05-02 23:30:04,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-05-02 23:30:04,992 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:04,992 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:04,992 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-05-02 23:30:04,992 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:04,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:04,992 INFO L82 PathProgramCache]: Analyzing trace with hash -735430834, now seen corresponding path program 28 times [2021-05-02 23:30:04,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:04,993 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [884662204] [2021-05-02 23:30:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:05,002 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_522 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_522} OutVars{main_~x~0=v_main_~x~0_522} AuxVars[] AssignedVars[] [2021-05-02 23:30:05,003 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:05,004 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:05,031 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:05,075 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:05,118 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:05,120 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_524 1) 4294967296) 268435455) (< (mod v_main_~x~0_524 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_524} OutVars{main_~x~0=v_main_~x~0_524} AuxVars[] AssignedVars[] [2021-05-02 23:30:05,121 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:05,145 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:05,150 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:05,615 WARN L205 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:30:05,641 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:05,648 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:05,683 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:05,717 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:07,098 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:07,098 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [884662204] [2021-05-02 23:30:07,099 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [884662204] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:07,099 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:07,099 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-02 23:30:07,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424345653] [2021-05-02 23:30:07,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 23:30:07,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:07,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 23:30:07,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 23:30:07,100 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:30:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:09,512 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2021-05-02 23:30:09,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-02 23:30:09,512 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:30:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:09,513 INFO L225 Difference]: With dead ends: 78 [2021-05-02 23:30:09,513 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 23:30:09,514 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 7 SyntacticMatches, 29 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 2534.9ms TimeCoverageRelationStatistics Valid=241, Invalid=3665, Unknown=0, NotChecked=0, Total=3906 [2021-05-02 23:30:09,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 23:30:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-05-02 23:30:09,518 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:30:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2021-05-02 23:30:09,519 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 67 [2021-05-02 23:30:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:09,519 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2021-05-02 23:30:09,519 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:30:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2021-05-02 23:30:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-05-02 23:30:09,519 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:09,520 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:09,520 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-05-02 23:30:09,520 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:09,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:09,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1299062805, now seen corresponding path program 29 times [2021-05-02 23:30:09,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:09,520 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1068832806] [2021-05-02 23:30:09,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:09,539 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_555 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_555} OutVars{main_~x~0=v_main_~x~0_555} AuxVars[] AssignedVars[] [2021-05-02 23:30:09,541 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:09,553 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:09,574 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:09,593 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:09,624 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:09,626 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_557 4294967296) 65520) (< (mod (+ v_main_~x~0_557 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_557} OutVars{main_~x~0=v_main_~x~0_557} AuxVars[] AssignedVars[] [2021-05-02 23:30:09,628 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:09,629 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:09,630 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:09,786 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:09,794 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:09,831 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:09,857 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:09,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:11,531 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:11,531 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1068832806] [2021-05-02 23:30:11,531 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1068832806] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:11,531 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:11,531 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-02 23:30:11,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680537013] [2021-05-02 23:30:11,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-02 23:30:11,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:11,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-02 23:30:11,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:30:11,536 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:30:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:14,323 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-05-02 23:30:14,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-02 23:30:14,324 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:30:14,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:14,325 INFO L225 Difference]: With dead ends: 80 [2021-05-02 23:30:14,325 INFO L226 Difference]: Without dead ends: 73 [2021-05-02 23:30:14,326 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 6 SyntacticMatches, 31 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 3011.6ms TimeCoverageRelationStatistics Valid=249, Invalid=3911, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 23:30:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-02 23:30:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-05-02 23:30:14,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:30:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2021-05-02 23:30:14,333 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 69 [2021-05-02 23:30:14,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:14,333 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2021-05-02 23:30:14,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:30:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2021-05-02 23:30:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-02 23:30:14,334 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:14,334 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:14,334 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-05-02 23:30:14,334 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:14,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:14,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1783507640, now seen corresponding path program 30 times [2021-05-02 23:30:14,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:14,335 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720148883] [2021-05-02 23:30:14,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:14,345 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_589 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_589} OutVars{main_~x~0=v_main_~x~0_589} AuxVars[] AssignedVars[] [2021-05-02 23:30:14,347 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:14,347 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:14,370 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:14,410 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:14,433 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:14,435 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_591 4294967296) 65520) (< (mod (+ v_main_~x~0_591 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_591} OutVars{main_~x~0=v_main_~x~0_591} AuxVars[] AssignedVars[] [2021-05-02 23:30:14,442 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:14,462 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:14,464 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:14,724 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:30:14,727 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:14,732 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:14,764 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:14,788 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:14,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:14,877 INFO 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:30:16,411 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:16,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720148883] [2021-05-02 23:30:16,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1720148883] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:16,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:16,411 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-02 23:30:16,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765504147] [2021-05-02 23:30:16,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-02 23:30:16,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:16,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-02 23:30:16,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 23:30:16,413 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:30:19,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:19,199 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2021-05-02 23:30:19,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-02 23:30:19,200 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:30:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:19,201 INFO L225 Difference]: With dead ends: 82 [2021-05-02 23:30:19,201 INFO L226 Difference]: Without dead ends: 75 [2021-05-02 23:30:19,201 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 6 SyntacticMatches, 32 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 2955.1ms TimeCoverageRelationStatistics Valid=257, Invalid=4165, Unknown=0, NotChecked=0, Total=4422 [2021-05-02 23:30:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-02 23:30:19,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-02 23:30:19,207 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:30:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2021-05-02 23:30:19,208 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 71 [2021-05-02 23:30:19,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:19,208 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2021-05-02 23:30:19,208 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:30:19,208 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2021-05-02 23:30:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-05-02 23:30:19,209 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:19,209 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:19,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-02 23:30:19,209 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:19,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:19,209 INFO L82 PathProgramCache]: Analyzing trace with hash 816441189, now seen corresponding path program 31 times [2021-05-02 23:30:19,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:19,210 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2088406281] [2021-05-02 23:30:19,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:19,217 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_624 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_624} OutVars{main_~x~0=v_main_~x~0_624} AuxVars[] AssignedVars[] [2021-05-02 23:30:19,219 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:19,230 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:19,248 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:19,265 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:19,292 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:19,293 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_626 1) 4294967296) 268435455) (< (mod v_main_~x~0_626 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_626} OutVars{main_~x~0=v_main_~x~0_626} AuxVars[] AssignedVars[] [2021-05-02 23:30:19,295 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:19,322 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:19,324 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:19,413 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:19,425 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:19,457 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:19,487 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:19,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:30:21,359 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:21,360 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2088406281] [2021-05-02 23:30:21,360 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2088406281] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:21,360 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:21,360 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-02 23:30:21,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365429332] [2021-05-02 23:30:21,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-02 23:30:21,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:21,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-02 23:30:21,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:30:21,361 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:30:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:24,811 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2021-05-02 23:30:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-02 23:30:24,812 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:30:24,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:24,812 INFO L225 Difference]: With dead ends: 84 [2021-05-02 23:30:24,812 INFO L226 Difference]: Without dead ends: 77 [2021-05-02 23:30:24,813 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 6 SyntacticMatches, 33 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 3483.7ms TimeCoverageRelationStatistics Valid=265, Invalid=4427, Unknown=0, NotChecked=0, Total=4692 [2021-05-02 23:30:24,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-02 23:30:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-05-02 23:30:24,817 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:30:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2021-05-02 23:30:24,818 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 73 [2021-05-02 23:30:24,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:24,818 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2021-05-02 23:30:24,818 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:30:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2021-05-02 23:30:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-05-02 23:30:24,818 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:24,818 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:24,819 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-05-02 23:30:24,819 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:24,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:24,819 INFO L82 PathProgramCache]: Analyzing trace with hash -303700414, now seen corresponding path program 32 times [2021-05-02 23:30:24,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:24,819 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [381964801] [2021-05-02 23:30:24,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:24,828 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_660 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_660} OutVars{main_~x~0=v_main_~x~0_660} AuxVars[] AssignedVars[] [2021-05-02 23:30:24,830 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:24,846 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:24,870 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:24,897 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:24,961 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:24,963 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_662 1) 4294967296) 268435455) (< (mod v_main_~x~0_662 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_662} OutVars{main_~x~0=v_main_~x~0_662} AuxVars[] AssignedVars[] [2021-05-02 23:30:24,966 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:24,967 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:24,972 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:25,889 WARN L205 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:30:25,950 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:25,961 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:26,013 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:26,048 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:26,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:26,168 INFO 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:30:28,454 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:28,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [381964801] [2021-05-02 23:30:28,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [381964801] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:28,455 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:28,455 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-02 23:30:28,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029355973] [2021-05-02 23:30:28,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-02 23:30:28,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:28,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-02 23:30:28,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 23:30:28,456 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:30:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:32,278 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2021-05-02 23:30:32,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-02 23:30:32,278 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:30:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:32,279 INFO L225 Difference]: With dead ends: 86 [2021-05-02 23:30:32,279 INFO L226 Difference]: Without dead ends: 79 [2021-05-02 23:30:32,280 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 6 SyntacticMatches, 34 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 4179.6ms TimeCoverageRelationStatistics Valid=273, Invalid=4697, Unknown=0, NotChecked=0, Total=4970 [2021-05-02 23:30:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-05-02 23:30:32,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-05-02 23:30:32,285 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:30:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2021-05-02 23:30:32,285 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 75 [2021-05-02 23:30:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:32,286 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2021-05-02 23:30:32,286 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:30:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2021-05-02 23:30:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-02 23:30:32,286 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:32,286 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:32,286 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-05-02 23:30:32,286 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:32,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:32,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1277010399, now seen corresponding path program 33 times [2021-05-02 23:30:32,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:32,287 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [874256836] [2021-05-02 23:30:32,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:32,297 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_697 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_697} OutVars{main_~x~0=v_main_~x~0_697} AuxVars[] AssignedVars[] [2021-05-02 23:30:32,301 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:32,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:32,329 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:32,371 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:32,408 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:32,409 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_699 1) 4294967296) 268435455) (< (mod v_main_~x~0_699 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_699} OutVars{main_~x~0=v_main_~x~0_699} AuxVars[] AssignedVars[] [2021-05-02 23:30:32,410 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:32,437 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:32,439 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:32,591 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:30:32,617 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:32,622 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:32,699 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:32,731 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:32,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:32,834 INFO 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:30:35,184 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:35,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [874256836] [2021-05-02 23:30:35,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [874256836] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:35,184 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:35,184 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-02 23:30:35,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326240189] [2021-05-02 23:30:35,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-02 23:30:35,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:35,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-02 23:30:35,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:30:35,186 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:30:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:39,786 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2021-05-02 23:30:39,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-02 23:30:39,799 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:30:39,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:39,799 INFO L225 Difference]: With dead ends: 88 [2021-05-02 23:30:39,800 INFO L226 Difference]: Without dead ends: 81 [2021-05-02 23:30:39,800 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 7 SyntacticMatches, 34 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 4657.3ms TimeCoverageRelationStatistics Valid=281, Invalid=4975, Unknown=0, NotChecked=0, Total=5256 [2021-05-02 23:30:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-05-02 23:30:39,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-05-02 23:30:39,805 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:30:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2021-05-02 23:30:39,805 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 77 [2021-05-02 23:30:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:39,805 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2021-05-02 23:30:39,805 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:30:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2021-05-02 23:30:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-02 23:30:39,806 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:39,806 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:39,806 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-05-02 23:30:39,806 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:39,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:39,807 INFO L82 PathProgramCache]: Analyzing trace with hash -78321092, now seen corresponding path program 34 times [2021-05-02 23:30:39,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:39,807 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1921369338] [2021-05-02 23:30:39,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:39,817 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_735 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_735} OutVars{main_~x~0=v_main_~x~0_735} AuxVars[] AssignedVars[] [2021-05-02 23:30:39,819 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:39,820 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:39,849 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:39,884 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:39,918 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:39,920 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_737 4294967296) 65520) (< (mod (+ v_main_~x~0_737 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_737} OutVars{main_~x~0=v_main_~x~0_737} AuxVars[] AssignedVars[] [2021-05-02 23:30:39,921 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:39,942 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:39,943 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:40,073 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:40,080 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:40,119 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:40,156 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:40,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:40,262 INFO 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:30:43,164 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:43,164 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1921369338] [2021-05-02 23:30:43,164 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1921369338] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:43,164 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:43,164 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-02 23:30:43,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014238089] [2021-05-02 23:30:43,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-02 23:30:43,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:43,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-02 23:30:43,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2021-05-02 23:30:43,166 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:30:48,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:48,225 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2021-05-02 23:30:48,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-02 23:30:48,226 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:30:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:48,227 INFO L225 Difference]: With dead ends: 90 [2021-05-02 23:30:48,227 INFO L226 Difference]: Without dead ends: 83 [2021-05-02 23:30:48,228 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 7 SyntacticMatches, 35 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 5355.7ms TimeCoverageRelationStatistics Valid=289, Invalid=5261, Unknown=0, NotChecked=0, Total=5550 [2021-05-02 23:30:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-02 23:30:48,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-05-02 23:30:48,233 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:30:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2021-05-02 23:30:48,233 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 79 [2021-05-02 23:30:48,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:48,234 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2021-05-02 23:30:48,234 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:30:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2021-05-02 23:30:48,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-05-02 23:30:48,237 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:48,237 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:48,237 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-05-02 23:30:48,237 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:48,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:48,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1176793255, now seen corresponding path program 35 times [2021-05-02 23:30:48,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:48,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [39352205] [2021-05-02 23:30:48,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:48,245 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_774 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_774} OutVars{main_~x~0=v_main_~x~0_774} AuxVars[] AssignedVars[] [2021-05-02 23:30:48,247 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:48,252 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:48,276 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:48,310 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:48,353 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:48,354 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_776 4294967296) 65520) (< (mod (+ v_main_~x~0_776 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_776} OutVars{main_~x~0=v_main_~x~0_776} AuxVars[] AssignedVars[] [2021-05-02 23:30:48,356 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:48,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:48,366 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:48,519 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:48,525 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:48,612 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:48,669 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:48,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:48,788 INFO 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:30:51,962 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:30:51,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [39352205] [2021-05-02 23:30:51,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [39352205] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:30:51,963 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:30:51,963 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-02 23:30:51,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629657399] [2021-05-02 23:30:51,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-02 23:30:51,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:30:51,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-02 23:30:51,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:30:51,964 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:30:57,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:30:57,369 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2021-05-02 23:30:57,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-02 23:30:57,369 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:30:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:30:57,372 INFO L225 Difference]: With dead ends: 92 [2021-05-02 23:30:57,372 INFO L226 Difference]: Without dead ends: 85 [2021-05-02 23:30:57,373 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 6 SyntacticMatches, 37 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 5819.8ms TimeCoverageRelationStatistics Valid=297, Invalid=5555, Unknown=0, NotChecked=0, Total=5852 [2021-05-02 23:30:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-02 23:30:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-05-02 23:30:57,383 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:30:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2021-05-02 23:30:57,390 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 81 [2021-05-02 23:30:57,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:30:57,390 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2021-05-02 23:30:57,390 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:30:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2021-05-02 23:30:57,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-02 23:30:57,391 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:30:57,391 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:30:57,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-05-02 23:30:57,391 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:30:57,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:30:57,391 INFO L82 PathProgramCache]: Analyzing trace with hash -246587082, now seen corresponding path program 36 times [2021-05-02 23:30:57,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:30:57,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [954015835] [2021-05-02 23:30:57,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:30:57,399 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_814 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_814} OutVars{main_~x~0=v_main_~x~0_814} AuxVars[] AssignedVars[] [2021-05-02 23:30:57,401 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:30:57,401 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:57,426 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:30:57,461 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:30:57,501 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:57,502 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_816 1) 4294967296) 268435455) (< (mod v_main_~x~0_816 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_816} OutVars{main_~x~0=v_main_~x~0_816} AuxVars[] AssignedVars[] [2021-05-02 23:30:57,504 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:30:57,505 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:57,506 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:30:57,588 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:30:57,747 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2021-05-02 23:30:57,748 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:30:57,816 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:30:57,866 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:30:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:57,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:30:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:30:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:01,357 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:01,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [954015835] [2021-05-02 23:31:01,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [954015835] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:01,357 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:01,357 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-02 23:31:01,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574513741] [2021-05-02 23:31:01,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-02 23:31:01,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:01,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-02 23:31:01,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 23:31:01,358 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:31:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:07,244 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-05-02 23:31:07,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-02 23:31:07,245 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:31:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:07,246 INFO L225 Difference]: With dead ends: 94 [2021-05-02 23:31:07,246 INFO L226 Difference]: Without dead ends: 87 [2021-05-02 23:31:07,246 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 6 SyntacticMatches, 38 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 6234.3ms TimeCoverageRelationStatistics Valid=305, Invalid=5857, Unknown=0, NotChecked=0, Total=6162 [2021-05-02 23:31:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-05-02 23:31:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-05-02 23:31:07,253 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:31:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2021-05-02 23:31:07,254 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 83 [2021-05-02 23:31:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:07,254 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2021-05-02 23:31:07,254 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:31:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2021-05-02 23:31:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-05-02 23:31:07,255 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:07,255 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:07,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-05-02 23:31:07,255 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:07,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:07,256 INFO L82 PathProgramCache]: Analyzing trace with hash 328347603, now seen corresponding path program 37 times [2021-05-02 23:31:07,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:07,256 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [819710523] [2021-05-02 23:31:07,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:07,265 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_855 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_855} OutVars{main_~x~0=v_main_~x~0_855} AuxVars[] AssignedVars[] [2021-05-02 23:31:07,267 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:31:07,278 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:07,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:31:07,322 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:31:07,351 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:07,352 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_857 1) 4294967296) 268435455) (< (mod v_main_~x~0_857 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_857} OutVars{main_~x~0=v_main_~x~0_857} AuxVars[] AssignedVars[] [2021-05-02 23:31:07,361 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:31:07,363 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:07,365 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:07,456 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:31:07,470 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:31:07,529 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:31:07,579 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:07,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:11,276 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:11,276 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [819710523] [2021-05-02 23:31:11,276 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [819710523] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:11,276 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:11,277 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-02 23:31:11,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745653646] [2021-05-02 23:31:11,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-02 23:31:11,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:11,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-02 23:31:11,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:31:11,278 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:31:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:17,612 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-05-02 23:31:17,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-02 23:31:17,613 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:31:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:17,613 INFO L225 Difference]: With dead ends: 96 [2021-05-02 23:31:17,613 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 23:31:17,614 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 6 SyntacticMatches, 39 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 6554.2ms TimeCoverageRelationStatistics Valid=313, Invalid=6167, Unknown=0, NotChecked=0, Total=6480 [2021-05-02 23:31:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 23:31:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-05-02 23:31:17,620 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:31:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2021-05-02 23:31:17,621 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 85 [2021-05-02 23:31:17,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:17,621 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2021-05-02 23:31:17,621 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:31:17,621 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2021-05-02 23:31:17,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-05-02 23:31:17,622 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:17,622 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:17,622 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-05-02 23:31:17,622 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:17,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:17,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1210201296, now seen corresponding path program 38 times [2021-05-02 23:31:17,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:17,622 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [625167806] [2021-05-02 23:31:17,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:17,631 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_897 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_897} OutVars{main_~x~0=v_main_~x~0_897} AuxVars[] AssignedVars[] [2021-05-02 23:31:17,633 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:31:17,634 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:17,661 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:31:17,695 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:31:17,736 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:17,738 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_899 1) 4294967296) 268435455) (< (mod v_main_~x~0_899 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_899} OutVars{main_~x~0=v_main_~x~0_899} AuxVars[] AssignedVars[] [2021-05-02 23:31:17,739 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:31:17,762 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:17,763 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:17,940 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:31:18,037 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:31:18,051 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:31:18,104 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:31:18,140 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:18,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:18,230 INFO 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:31:22,198 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:22,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [625167806] [2021-05-02 23:31:22,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [625167806] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:22,199 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:22,199 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-02 23:31:22,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840973586] [2021-05-02 23:31:22,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 23:31:22,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:22,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 23:31:22,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 23:31:22,200 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:31:28,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:28,812 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2021-05-02 23:31:28,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-02 23:31:28,812 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:31:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:28,813 INFO L225 Difference]: With dead ends: 98 [2021-05-02 23:31:28,813 INFO L226 Difference]: Without dead ends: 91 [2021-05-02 23:31:28,814 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 6 SyntacticMatches, 40 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 7058.6ms TimeCoverageRelationStatistics Valid=321, Invalid=6485, Unknown=0, NotChecked=0, Total=6806 [2021-05-02 23:31:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-05-02 23:31:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-05-02 23:31:28,819 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:31:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2021-05-02 23:31:28,820 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 87 [2021-05-02 23:31:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:28,820 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2021-05-02 23:31:28,820 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:31:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2021-05-02 23:31:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-02 23:31:28,821 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:28,821 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:28,821 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-05-02 23:31:28,821 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:28,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:28,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2008023885, now seen corresponding path program 39 times [2021-05-02 23:31:28,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:28,822 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [610429021] [2021-05-02 23:31:28,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:28,830 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_940 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_940} OutVars{main_~x~0=v_main_~x~0_940} AuxVars[] AssignedVars[] [2021-05-02 23:31:28,831 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:31:28,844 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:28,879 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:31:28,901 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:31:28,938 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:28,941 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_942 1) 4294967296) 268435455) (< (mod v_main_~x~0_942 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_942} OutVars{main_~x~0=v_main_~x~0_942} AuxVars[] AssignedVars[] [2021-05-02 23:31:28,957 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:31:28,977 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:28,979 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:29,092 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:31:29,097 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:31:29,179 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:31:29,215 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:29,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:29,322 INFO 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:31:33,478 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:33,479 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [610429021] [2021-05-02 23:31:33,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [610429021] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:33,479 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:33,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-02 23:31:33,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858752950] [2021-05-02 23:31:33,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-02 23:31:33,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:33,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-02 23:31:33,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:31:33,480 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:31:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:38,973 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2021-05-02 23:31:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-02 23:31:38,973 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:31:38,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:38,974 INFO L225 Difference]: With dead ends: 100 [2021-05-02 23:31:38,974 INFO L226 Difference]: Without dead ends: 93 [2021-05-02 23:31:38,974 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 7 SyntacticMatches, 40 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 6809.9ms TimeCoverageRelationStatistics Valid=329, Invalid=6811, Unknown=0, NotChecked=0, Total=7140 [2021-05-02 23:31:38,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-02 23:31:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-05-02 23:31:38,978 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:31:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2021-05-02 23:31:38,979 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 89 [2021-05-02 23:31:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:38,979 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2021-05-02 23:31:38,979 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:31:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2021-05-02 23:31:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-02 23:31:38,980 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:38,980 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:38,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-05-02 23:31:38,980 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1948997590, now seen corresponding path program 40 times [2021-05-02 23:31:38,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:38,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [869396339] [2021-05-02 23:31:38,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:38,988 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_984 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_984} OutVars{main_~x~0=v_main_~x~0_984} AuxVars[] AssignedVars[] [2021-05-02 23:31:38,989 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:31:38,990 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:39,018 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:31:39,049 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:31:39,080 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:39,081 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_986 1) 4294967296) 268435455) (< (mod v_main_~x~0_986 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_986} OutVars{main_~x~0=v_main_~x~0_986} AuxVars[] AssignedVars[] [2021-05-02 23:31:39,083 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:31:39,083 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:39,085 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:39,164 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:31:39,169 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:31:39,218 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:31:39,250 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:39,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:42,112 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:42,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [869396339] [2021-05-02 23:31:42,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [869396339] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:42,112 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:42,112 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-02 23:31:42,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796861218] [2021-05-02 23:31:42,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-02 23:31:42,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:42,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-02 23:31:42,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1938, Unknown=0, NotChecked=0, Total=2070 [2021-05-02 23:31:42,113 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:31:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:46,606 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2021-05-02 23:31:46,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-02 23:31:46,606 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:31:46,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:46,607 INFO L225 Difference]: With dead ends: 102 [2021-05-02 23:31:46,607 INFO L226 Difference]: Without dead ends: 95 [2021-05-02 23:31:46,608 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 7 SyntacticMatches, 41 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 4943.4ms TimeCoverageRelationStatistics Valid=337, Invalid=7145, Unknown=0, NotChecked=0, Total=7482 [2021-05-02 23:31:46,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-02 23:31:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-05-02 23:31:46,613 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:31:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2021-05-02 23:31:46,613 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 91 [2021-05-02 23:31:46,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:46,613 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2021-05-02 23:31:46,614 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:31:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2021-05-02 23:31:46,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-05-02 23:31:46,614 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:46,614 INFO L523 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:46,614 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-02 23:31:46,614 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:46,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:46,614 INFO L82 PathProgramCache]: Analyzing trace with hash 694389191, now seen corresponding path program 41 times [2021-05-02 23:31:46,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:46,615 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2016589836] [2021-05-02 23:31:46,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:46,620 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1029 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1029} OutVars{main_~x~0=v_main_~x~0_1029} AuxVars[] AssignedVars[] [2021-05-02 23:31:46,621 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:31:46,632 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:46,648 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:31:46,664 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:31:46,691 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:46,692 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1031 4294967296) 65520) (< (mod (+ v_main_~x~0_1031 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1031} OutVars{main_~x~0=v_main_~x~0_1031} AuxVars[] AssignedVars[] [2021-05-02 23:31:46,693 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:31:46,725 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:46,727 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:46,862 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:31:46,869 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:31:46,906 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:31:46,936 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:31:49,630 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:49,630 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2016589836] [2021-05-02 23:31:49,631 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2016589836] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:49,631 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:49,631 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-02 23:31:49,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718825448] [2021-05-02 23:31:49,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-02 23:31:49,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:49,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-02 23:31:49,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:31:49,631 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:31:53,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:31:53,994 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2021-05-02 23:31:53,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-02 23:31:53,994 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:31:53,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:31:53,995 INFO L225 Difference]: With dead ends: 104 [2021-05-02 23:31:53,995 INFO L226 Difference]: Without dead ends: 97 [2021-05-02 23:31:53,996 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 7 SyntacticMatches, 42 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 4708.2ms TimeCoverageRelationStatistics Valid=345, Invalid=7487, Unknown=0, NotChecked=0, Total=7832 [2021-05-02 23:31:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-02 23:31:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-05-02 23:31:54,002 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:31:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2021-05-02 23:31:54,003 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 93 [2021-05-02 23:31:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:31:54,003 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2021-05-02 23:31:54,003 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:31:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2021-05-02 23:31:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-02 23:31:54,003 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:31:54,004 INFO L523 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:31:54,004 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-05-02 23:31:54,004 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:31:54,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:31:54,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1631553500, now seen corresponding path program 42 times [2021-05-02 23:31:54,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:31:54,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [901319367] [2021-05-02 23:31:54,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:31:54,012 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1075 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1075} OutVars{main_~x~0=v_main_~x~0_1075} AuxVars[] AssignedVars[] [2021-05-02 23:31:54,014 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:31:54,015 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:54,034 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:31:54,064 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:31:54,088 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:54,089 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1077 1) 4294967296) 268435455) (< (mod v_main_~x~0_1077 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_1077} OutVars{main_~x~0=v_main_~x~0_1077} AuxVars[] AssignedVars[] [2021-05-02 23:31:54,091 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:31:54,091 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:54,093 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:31:54,137 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:31:54,144 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:31:54,190 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:31:54,215 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:31:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:54,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:31:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:31:54,312 INFO 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:31:57,016 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:31:57,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [901319367] [2021-05-02 23:31:57,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [901319367] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:31:57,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:31:57,017 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-02 23:31:57,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551723287] [2021-05-02 23:31:57,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-02 23:31:57,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:31:57,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-02 23:31:57,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2021-05-02 23:31:57,017 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:32:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:02,057 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2021-05-02 23:32:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-02 23:32:02,058 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:32:02,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:02,058 INFO L225 Difference]: With dead ends: 106 [2021-05-02 23:32:02,059 INFO L226 Difference]: Without dead ends: 99 [2021-05-02 23:32:02,059 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 6 SyntacticMatches, 44 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 5121.3ms TimeCoverageRelationStatistics Valid=353, Invalid=7837, Unknown=0, NotChecked=0, Total=8190 [2021-05-02 23:32:02,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-02 23:32:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-05-02 23:32:02,063 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:32:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2021-05-02 23:32:02,064 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 95 [2021-05-02 23:32:02,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:02,064 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2021-05-02 23:32:02,064 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:32:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2021-05-02 23:32:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-05-02 23:32:02,064 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:32:02,064 INFO L523 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:32:02,064 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2021-05-02 23:32:02,065 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:32:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:32:02,065 INFO L82 PathProgramCache]: Analyzing trace with hash 815481665, now seen corresponding path program 43 times [2021-05-02 23:32:02,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:32:02,065 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1838586] [2021-05-02 23:32:02,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:32:02,071 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1122 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1122} OutVars{main_~x~0=v_main_~x~0_1122} AuxVars[] AssignedVars[] [2021-05-02 23:32:02,072 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:32:02,073 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:02,128 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:32:02,158 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:32:02,191 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:02,192 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1124 4294967296) 65520) (< (mod (+ v_main_~x~0_1124 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1124} OutVars{main_~x~0=v_main_~x~0_1124} AuxVars[] AssignedVars[] [2021-05-02 23:32:02,193 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:32:02,211 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:02,213 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:02,249 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:32:02,253 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:32:02,288 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:32:02,316 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:02,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:32:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:02,389 INFO 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:32:05,446 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:32:05,446 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1838586] [2021-05-02 23:32:05,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1838586] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:32:05,447 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:32:05,447 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-02 23:32:05,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44581318] [2021-05-02 23:32:05,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-02 23:32:05,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:32:05,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-02 23:32:05,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:32:05,448 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:32:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:10,924 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2021-05-02 23:32:10,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-02 23:32:10,924 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:32:10,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:10,925 INFO L225 Difference]: With dead ends: 108 [2021-05-02 23:32:10,925 INFO L226 Difference]: Without dead ends: 101 [2021-05-02 23:32:10,925 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 7 SyntacticMatches, 44 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 5645.5ms TimeCoverageRelationStatistics Valid=361, Invalid=8195, Unknown=0, NotChecked=0, Total=8556 [2021-05-02 23:32:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-02 23:32:10,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-05-02 23:32:10,932 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:32:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2021-05-02 23:32:10,932 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 97 [2021-05-02 23:32:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:10,933 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2021-05-02 23:32:10,933 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:32:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2021-05-02 23:32:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-05-02 23:32:10,933 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:32:10,933 INFO L523 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:32:10,934 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2021-05-02 23:32:10,934 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:32:10,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:32:10,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1225802978, now seen corresponding path program 44 times [2021-05-02 23:32:10,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:32:10,934 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1784769906] [2021-05-02 23:32:10,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:32:10,947 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1170 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1170} OutVars{main_~x~0=v_main_~x~0_1170} AuxVars[] AssignedVars[] [2021-05-02 23:32:10,949 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:32:10,964 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:10,987 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:32:11,002 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:32:11,033 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:11,035 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1172 4294967296) 65520) (< (mod (+ v_main_~x~0_1172 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1172} OutVars{main_~x~0=v_main_~x~0_1172} AuxVars[] AssignedVars[] [2021-05-02 23:32:11,036 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:32:11,052 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:11,055 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:11,174 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:32:11,202 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:32:11,207 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:32:11,268 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:32:11,315 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:11,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:32:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:11,404 INFO 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:32:15,365 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:32:15,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1784769906] [2021-05-02 23:32:15,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1784769906] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:32:15,366 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:32:15,366 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-02 23:32:15,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826997716] [2021-05-02 23:32:15,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-02 23:32:15,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:32:15,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-02 23:32:15,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2021-05-02 23:32:15,366 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:32:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:22,537 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2021-05-02 23:32:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-02 23:32:22,537 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:32:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:22,538 INFO L225 Difference]: With dead ends: 110 [2021-05-02 23:32:22,538 INFO L226 Difference]: Without dead ends: 103 [2021-05-02 23:32:22,539 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 7 SyntacticMatches, 45 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 7245.6ms TimeCoverageRelationStatistics Valid=369, Invalid=8561, Unknown=0, NotChecked=0, Total=8930 [2021-05-02 23:32:22,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-05-02 23:32:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-05-02 23:32:22,544 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:32:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2021-05-02 23:32:22,545 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 99 [2021-05-02 23:32:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:22,545 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2021-05-02 23:32:22,545 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:32:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2021-05-02 23:32:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-05-02 23:32:22,546 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:32:22,546 INFO L523 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:32:22,546 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2021-05-02 23:32:22,546 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:32:22,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:32:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash -100290629, now seen corresponding path program 45 times [2021-05-02 23:32:22,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:32:22,547 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [432917551] [2021-05-02 23:32:22,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:32:22,559 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1219 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1219} OutVars{main_~x~0=v_main_~x~0_1219} AuxVars[] AssignedVars[] [2021-05-02 23:32:22,560 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:32:22,561 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:22,582 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:32:22,613 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:32:22,645 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:22,646 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1221 4294967296) 65520) (< (mod (+ v_main_~x~0_1221 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1221} OutVars{main_~x~0=v_main_~x~0_1221} AuxVars[] AssignedVars[] [2021-05-02 23:32:22,648 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:32:22,666 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:22,682 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:25,991 WARN L205 SmtUtils]: Spent 3.31 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:32:26,038 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:32:26,047 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:32:26,070 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:32:26,097 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:26,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:32:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:26,192 INFO 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:32:29,678 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:32:29,678 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [432917551] [2021-05-02 23:32:29,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [432917551] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:32:29,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:32:29,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-02 23:32:29,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075547053] [2021-05-02 23:32:29,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-02 23:32:29,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:32:29,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-02 23:32:29,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2021-05-02 23:32:29,680 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:32:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:35,124 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2021-05-02 23:32:35,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-02 23:32:35,125 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:32:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:35,126 INFO L225 Difference]: With dead ends: 112 [2021-05-02 23:32:35,126 INFO L226 Difference]: Without dead ends: 105 [2021-05-02 23:32:35,126 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 6 SyntacticMatches, 47 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 6076.3ms TimeCoverageRelationStatistics Valid=377, Invalid=8935, Unknown=0, NotChecked=0, Total=9312 [2021-05-02 23:32:35,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-05-02 23:32:35,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-05-02 23:32:35,133 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:32:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2021-05-02 23:32:35,133 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 101 [2021-05-02 23:32:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:35,134 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2021-05-02 23:32:35,134 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:32:35,134 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2021-05-02 23:32:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-05-02 23:32:35,134 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:32:35,134 INFO L523 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:32:35,134 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-05-02 23:32:35,134 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:32:35,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:32:35,135 INFO L82 PathProgramCache]: Analyzing trace with hash -814681832, now seen corresponding path program 46 times [2021-05-02 23:32:35,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:32:35,135 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1608070698] [2021-05-02 23:32:35,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:32:35,143 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1269 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1269} OutVars{main_~x~0=v_main_~x~0_1269} AuxVars[] AssignedVars[] [2021-05-02 23:32:35,144 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:32:35,145 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:35,169 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:32:35,194 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:32:35,219 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:35,220 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1271 4294967296) 65520) (< (mod (+ v_main_~x~0_1271 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1271} OutVars{main_~x~0=v_main_~x~0_1271} AuxVars[] AssignedVars[] [2021-05-02 23:32:35,222 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:32:35,239 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:35,241 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:35,642 WARN L205 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:32:35,685 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:32:35,693 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:32:35,724 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:32:35,748 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:35,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:32:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:35,813 INFO 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:32:38,931 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:32:38,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1608070698] [2021-05-02 23:32:38,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1608070698] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:32:38,932 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:32:38,932 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-02 23:32:38,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894076522] [2021-05-02 23:32:38,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-02 23:32:38,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:32:38,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-02 23:32:38,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2021-05-02 23:32:38,932 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:32:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:44,299 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2021-05-02 23:32:44,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-02 23:32:44,299 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:32:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:44,300 INFO L225 Difference]: With dead ends: 114 [2021-05-02 23:32:44,300 INFO L226 Difference]: Without dead ends: 107 [2021-05-02 23:32:44,301 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 7 SyntacticMatches, 47 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 5626.5ms TimeCoverageRelationStatistics Valid=385, Invalid=9317, Unknown=0, NotChecked=0, Total=9702 [2021-05-02 23:32:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-02 23:32:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-05-02 23:32:44,307 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:32:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2021-05-02 23:32:44,308 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 103 [2021-05-02 23:32:44,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:44,308 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2021-05-02 23:32:44,308 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:32:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2021-05-02 23:32:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-05-02 23:32:44,309 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:32:44,309 INFO L523 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:32:44,309 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2021-05-02 23:32:44,309 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:32:44,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:32:44,309 INFO L82 PathProgramCache]: Analyzing trace with hash -149860555, now seen corresponding path program 47 times [2021-05-02 23:32:44,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:32:44,309 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1239972566] [2021-05-02 23:32:44,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:32:44,315 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1320 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1320} OutVars{main_~x~0=v_main_~x~0_1320} AuxVars[] AssignedVars[] [2021-05-02 23:32:44,316 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:32:44,327 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:44,345 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:32:44,360 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:32:44,383 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:44,385 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1322 4294967296) 65520) (< (mod (+ v_main_~x~0_1322 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1322} OutVars{main_~x~0=v_main_~x~0_1322} AuxVars[] AssignedVars[] [2021-05-02 23:32:44,386 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:32:44,387 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:44,388 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:44,454 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:32:44,464 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:32:44,508 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:32:44,540 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:44,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:32:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:44,601 INFO 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:32:48,258 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:32:48,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1239972566] [2021-05-02 23:32:48,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1239972566] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:32:48,259 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:32:48,259 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-05-02 23:32:48,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247371624] [2021-05-02 23:32:48,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-05-02 23:32:48,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:32:48,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-05-02 23:32:48,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:32:48,260 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:32:54,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:32:54,882 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2021-05-02 23:32:54,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-02 23:32:54,883 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:32:54,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:32:54,883 INFO L225 Difference]: With dead ends: 116 [2021-05-02 23:32:54,884 INFO L226 Difference]: Without dead ends: 109 [2021-05-02 23:32:54,884 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 6 SyntacticMatches, 49 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 6726.2ms TimeCoverageRelationStatistics Valid=393, Invalid=9707, Unknown=0, NotChecked=0, Total=10100 [2021-05-02 23:32:54,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-02 23:32:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-05-02 23:32:54,890 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:32:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2021-05-02 23:32:54,891 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 105 [2021-05-02 23:32:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:32:54,891 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2021-05-02 23:32:54,891 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:32:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2021-05-02 23:32:54,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-02 23:32:54,892 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:32:54,892 INFO L523 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:32:54,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-05-02 23:32:54,892 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:32:54,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:32:54,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1206740462, now seen corresponding path program 48 times [2021-05-02 23:32:54,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:32:54,892 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1359653605] [2021-05-02 23:32:54,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:32:54,899 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1372 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1372} OutVars{main_~x~0=v_main_~x~0_1372} AuxVars[] AssignedVars[] [2021-05-02 23:32:54,900 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:32:54,900 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:54,930 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:32:54,960 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:32:54,994 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:54,995 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1374 4294967296) 65520) (< (mod (+ v_main_~x~0_1374 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1374} OutVars{main_~x~0=v_main_~x~0_1374} AuxVars[] AssignedVars[] [2021-05-02 23:32:54,997 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:32:55,016 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:55,018 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:32:55,137 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:32:55,142 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:32:55,206 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:32:55,243 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:32:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:55,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:32:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:32:55,353 INFO 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:32:59,222 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:32:59,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1359653605] [2021-05-02 23:32:59,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1359653605] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:32:59,222 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:32:59,222 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-02 23:32:59,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52797538] [2021-05-02 23:32:59,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-02 23:32:59,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:32:59,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-02 23:32:59,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2706, Unknown=0, NotChecked=0, Total=2862 [2021-05-02 23:32:59,223 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:33:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:33:05,649 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2021-05-02 23:33:05,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-02 23:33:05,649 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:33:05,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:33:05,650 INFO L225 Difference]: With dead ends: 118 [2021-05-02 23:33:05,650 INFO L226 Difference]: Without dead ends: 111 [2021-05-02 23:33:05,651 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 6 SyntacticMatches, 50 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 6890.9ms TimeCoverageRelationStatistics Valid=401, Invalid=10105, Unknown=0, NotChecked=0, Total=10506 [2021-05-02 23:33:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-05-02 23:33:05,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-05-02 23:33:05,658 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:33:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2021-05-02 23:33:05,659 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 107 [2021-05-02 23:33:05,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:33:05,659 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2021-05-02 23:33:05,659 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:33:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2021-05-02 23:33:05,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-05-02 23:33:05,660 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:33:05,660 INFO L523 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:33:05,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-05-02 23:33:05,660 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:33:05,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:33:05,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1038918063, now seen corresponding path program 49 times [2021-05-02 23:33:05,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:33:05,660 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [231484843] [2021-05-02 23:33:05,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:33:05,669 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1425 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1425} OutVars{main_~x~0=v_main_~x~0_1425} AuxVars[] AssignedVars[] [2021-05-02 23:33:05,671 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:33:05,672 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:05,696 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:33:05,727 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:33:05,763 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:05,778 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1427 1) 4294967296) 268435455) (< (mod v_main_~x~0_1427 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_1427} OutVars{main_~x~0=v_main_~x~0_1427} AuxVars[] AssignedVars[] [2021-05-02 23:33:05,780 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:33:05,801 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:05,805 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:09,943 WARN L205 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:33:10,976 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:33:11,005 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:33:11,011 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:33:11,055 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:33:11,086 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:11,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:33:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:33:15,223 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:33:15,223 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [231484843] [2021-05-02 23:33:15,223 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [231484843] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:33:15,223 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:33:15,223 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-05-02 23:33:15,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308437154] [2021-05-02 23:33:15,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-05-02 23:33:15,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:33:15,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-05-02 23:33:15,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:33:15,224 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:33:22,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:33:22,707 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2021-05-02 23:33:22,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-02 23:33:22,708 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:33:22,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:33:22,709 INFO L225 Difference]: With dead ends: 120 [2021-05-02 23:33:22,709 INFO L226 Difference]: Without dead ends: 113 [2021-05-02 23:33:22,709 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 6 SyntacticMatches, 51 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 7543.6ms TimeCoverageRelationStatistics Valid=409, Invalid=10511, Unknown=0, NotChecked=0, Total=10920 [2021-05-02 23:33:22,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-02 23:33:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-05-02 23:33:22,714 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:33:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2021-05-02 23:33:22,715 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 109 [2021-05-02 23:33:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:33:22,715 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2021-05-02 23:33:22,715 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:33:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2021-05-02 23:33:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-05-02 23:33:22,716 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:33:22,716 INFO L523 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:33:22,716 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-05-02 23:33:22,716 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:33:22,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:33:22,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1251789300, now seen corresponding path program 50 times [2021-05-02 23:33:22,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:33:22,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [352042938] [2021-05-02 23:33:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:33:22,722 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1479 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1479} OutVars{main_~x~0=v_main_~x~0_1479} AuxVars[] AssignedVars[] [2021-05-02 23:33:22,724 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:33:22,724 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:22,749 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:33:22,789 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:33:22,815 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:22,817 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1481 1) 4294967296) 268435455) (< (mod v_main_~x~0_1481 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_1481} OutVars{main_~x~0=v_main_~x~0_1481} AuxVars[] AssignedVars[] [2021-05-02 23:33:22,818 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:33:22,819 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:22,821 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:23,016 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:33:23,019 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:33:23,028 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:33:23,076 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:33:23,108 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:23,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:33:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:23,200 INFO 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:33:27,085 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:33:27,085 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [352042938] [2021-05-02 23:33:27,085 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [352042938] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:33:27,085 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:33:27,085 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-02 23:33:27,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523690507] [2021-05-02 23:33:27,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-02 23:33:27,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:33:27,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-02 23:33:27,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2918, Unknown=0, NotChecked=0, Total=3080 [2021-05-02 23:33:27,086 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:33:33,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:33:33,762 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2021-05-02 23:33:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-02 23:33:33,763 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:33:33,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:33:33,763 INFO L225 Difference]: With dead ends: 122 [2021-05-02 23:33:33,763 INFO L226 Difference]: Without dead ends: 115 [2021-05-02 23:33:33,764 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 6 SyntacticMatches, 52 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1474 ImplicationChecksByTransitivity, 7015.6ms TimeCoverageRelationStatistics Valid=417, Invalid=10925, Unknown=0, NotChecked=0, Total=11342 [2021-05-02 23:33:33,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-05-02 23:33:33,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2021-05-02 23:33:33,772 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:33:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2021-05-02 23:33:33,772 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 111 [2021-05-02 23:33:33,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:33:33,772 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2021-05-02 23:33:33,773 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:33:33,773 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2021-05-02 23:33:33,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-02 23:33:33,773 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:33:33,773 INFO L523 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:33:33,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-05-02 23:33:33,773 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:33:33,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:33:33,774 INFO L82 PathProgramCache]: Analyzing trace with hash 696657705, now seen corresponding path program 51 times [2021-05-02 23:33:33,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:33:33,774 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1788787737] [2021-05-02 23:33:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:33:33,782 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1534 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1534} OutVars{main_~x~0=v_main_~x~0_1534} AuxVars[] AssignedVars[] [2021-05-02 23:33:33,784 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:33:33,800 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:33,838 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:33:33,864 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:33:33,911 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:33,913 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1536 4294967296) 65520) (< (mod (+ v_main_~x~0_1536 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1536} OutVars{main_~x~0=v_main_~x~0_1536} AuxVars[] AssignedVars[] [2021-05-02 23:33:33,915 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:33:33,940 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:33,942 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:34,020 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:33:34,037 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:33:34,083 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:33:34,125 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:34,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:33:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:34,213 INFO 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:33:38,321 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:33:38,321 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1788787737] [2021-05-02 23:33:38,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1788787737] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:33:38,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:33:38,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-02 23:33:38,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283488367] [2021-05-02 23:33:38,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-02 23:33:38,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:33:38,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-02 23:33:38,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:33:38,323 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:33:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:33:45,091 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2021-05-02 23:33:45,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-02 23:33:45,092 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:33:45,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:33:45,093 INFO L225 Difference]: With dead ends: 124 [2021-05-02 23:33:45,093 INFO L226 Difference]: Without dead ends: 117 [2021-05-02 23:33:45,094 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 7 SyntacticMatches, 52 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1529 ImplicationChecksByTransitivity, 7235.5ms TimeCoverageRelationStatistics Valid=425, Invalid=11347, Unknown=0, NotChecked=0, Total=11772 [2021-05-02 23:33:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-05-02 23:33:45,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-05-02 23:33:45,100 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:33:45,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2021-05-02 23:33:45,100 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 113 [2021-05-02 23:33:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:33:45,100 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2021-05-02 23:33:45,100 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:33:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2021-05-02 23:33:45,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-05-02 23:33:45,101 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:33:45,101 INFO L523 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:33:45,101 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-05-02 23:33:45,101 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:33:45,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:33:45,101 INFO L82 PathProgramCache]: Analyzing trace with hash 548488454, now seen corresponding path program 52 times [2021-05-02 23:33:45,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:33:45,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [721258226] [2021-05-02 23:33:45,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:33:45,108 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1590 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1590} OutVars{main_~x~0=v_main_~x~0_1590} AuxVars[] AssignedVars[] [2021-05-02 23:33:45,110 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:33:45,124 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:45,153 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:33:45,177 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:33:45,219 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:45,220 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1592 4294967296) 65520) (< (mod (+ v_main_~x~0_1592 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1592} OutVars{main_~x~0=v_main_~x~0_1592} AuxVars[] AssignedVars[] [2021-05-02 23:33:45,222 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:33:45,247 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:45,249 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:45,370 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:33:45,376 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:33:45,423 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:33:45,450 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:45,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:33:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:45,511 INFO 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:33:49,641 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:33:49,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [721258226] [2021-05-02 23:33:49,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [721258226] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:33:49,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:33:49,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2021-05-02 23:33:49,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775973538] [2021-05-02 23:33:49,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-05-02 23:33:49,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:33:49,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-05-02 23:33:49,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2021-05-02 23:33:49,643 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:33:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:33:57,069 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2021-05-02 23:33:57,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-05-02 23:33:57,069 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:33:57,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:33:57,070 INFO L225 Difference]: With dead ends: 126 [2021-05-02 23:33:57,070 INFO L226 Difference]: Without dead ends: 119 [2021-05-02 23:33:57,072 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 6 SyntacticMatches, 54 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 7486.3ms TimeCoverageRelationStatistics Valid=433, Invalid=11777, Unknown=0, NotChecked=0, Total=12210 [2021-05-02 23:33:57,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-02 23:33:57,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-05-02 23:33:57,078 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:33:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2021-05-02 23:33:57,078 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 115 [2021-05-02 23:33:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:33:57,078 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2021-05-02 23:33:57,078 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:33:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2021-05-02 23:33:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-05-02 23:33:57,079 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:33:57,079 INFO L523 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:33:57,079 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-05-02 23:33:57,079 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:33:57,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:33:57,079 INFO L82 PathProgramCache]: Analyzing trace with hash -108240989, now seen corresponding path program 53 times [2021-05-02 23:33:57,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:33:57,079 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [285086084] [2021-05-02 23:33:57,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:33:57,090 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1647 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1647} OutVars{main_~x~0=v_main_~x~0_1647} AuxVars[] AssignedVars[] [2021-05-02 23:33:57,092 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:33:57,092 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:57,116 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:33:57,144 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:33:57,171 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:57,172 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1649 4294967296) 65520) (< (mod (+ v_main_~x~0_1649 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1649} OutVars{main_~x~0=v_main_~x~0_1649} AuxVars[] AssignedVars[] [2021-05-02 23:33:57,174 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:33:57,192 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:57,194 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:33:59,410 WARN L205 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:33:59,448 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:33:59,459 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:33:59,490 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:33:59,528 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:33:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:59,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:33:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:33:59,618 INFO 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:34:04,177 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:34:04,177 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [285086084] [2021-05-02 23:34:04,177 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [285086084] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:34:04,177 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:34:04,177 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2021-05-02 23:34:04,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863324384] [2021-05-02 23:34:04,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2021-05-02 23:34:04,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:34:04,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-05-02 23:34:04,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 23:34:04,179 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:34:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:34:12,181 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2021-05-02 23:34:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-02 23:34:12,182 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:34:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:34:12,183 INFO L225 Difference]: With dead ends: 128 [2021-05-02 23:34:12,183 INFO L226 Difference]: Without dead ends: 121 [2021-05-02 23:34:12,184 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 6 SyntacticMatches, 55 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1642 ImplicationChecksByTransitivity, 8166.4ms TimeCoverageRelationStatistics Valid=441, Invalid=12215, Unknown=0, NotChecked=0, Total=12656 [2021-05-02 23:34:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-05-02 23:34:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-05-02 23:34:12,191 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:34:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2021-05-02 23:34:12,191 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 117 [2021-05-02 23:34:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:34:12,192 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2021-05-02 23:34:12,192 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:34:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2021-05-02 23:34:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-05-02 23:34:12,192 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:34:12,192 INFO L523 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:34:12,192 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-05-02 23:34:12,193 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:34:12,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:34:12,193 INFO L82 PathProgramCache]: Analyzing trace with hash 134956800, now seen corresponding path program 54 times [2021-05-02 23:34:12,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:34:12,193 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [213449901] [2021-05-02 23:34:12,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:34:12,201 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1705 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1705} OutVars{main_~x~0=v_main_~x~0_1705} AuxVars[] AssignedVars[] [2021-05-02 23:34:12,203 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:34:12,204 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:12,228 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:34:12,261 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:34:12,289 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:34:12,290 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1707 1) 4294967296) 268435455) (< (mod v_main_~x~0_1707 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_1707} OutVars{main_~x~0=v_main_~x~0_1707} AuxVars[] AssignedVars[] [2021-05-02 23:34:12,291 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:34:12,307 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:12,309 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:12,501 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:34:12,543 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:34:12,552 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:34:14,590 WARN L205 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:34:14,613 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:34:14,646 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:34:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:34:14,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:34:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:34:14,760 INFO 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:34:19,582 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:34:19,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [213449901] [2021-05-02 23:34:19,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [213449901] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:34:19,582 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:34:19,582 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-02 23:34:19,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238437521] [2021-05-02 23:34:19,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-02 23:34:19,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:34:19,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-02 23:34:19,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2021-05-02 23:34:19,583 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:34:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:34:28,341 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2021-05-02 23:34:28,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-02 23:34:28,341 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:34:28,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:34:28,342 INFO L225 Difference]: With dead ends: 130 [2021-05-02 23:34:28,342 INFO L226 Difference]: Without dead ends: 123 [2021-05-02 23:34:28,343 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 6 SyntacticMatches, 56 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1700 ImplicationChecksByTransitivity, 8751.3ms TimeCoverageRelationStatistics Valid=449, Invalid=12661, Unknown=0, NotChecked=0, Total=13110 [2021-05-02 23:34:28,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-05-02 23:34:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-05-02 23:34:28,348 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:34:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2021-05-02 23:34:28,348 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 119 [2021-05-02 23:34:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:34:28,348 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2021-05-02 23:34:28,348 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:34:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2021-05-02 23:34:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-05-02 23:34:28,349 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:34:28,349 INFO L523 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:34:28,349 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-05-02 23:34:28,349 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:34:28,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:34:28,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1919798045, now seen corresponding path program 55 times [2021-05-02 23:34:28,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:34:28,349 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1232947288] [2021-05-02 23:34:28,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:34:28,355 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1764 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1764} OutVars{main_~x~0=v_main_~x~0_1764} AuxVars[] AssignedVars[] [2021-05-02 23:34:28,357 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:34:28,357 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:28,374 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:34:28,400 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:34:28,438 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:34:28,439 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1766 4294967296) 65520) (< (mod (+ v_main_~x~0_1766 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1766} OutVars{main_~x~0=v_main_~x~0_1766} AuxVars[] AssignedVars[] [2021-05-02 23:34:28,441 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:34:28,463 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:28,465 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:28,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:34:28,565 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:34:28,597 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:34:28,630 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:34:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:34:28,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:34:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:34:28,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:34:34,052 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:34:34,052 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1232947288] [2021-05-02 23:34:34,052 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1232947288] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:34:34,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:34:34,052 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2021-05-02 23:34:34,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982566105] [2021-05-02 23:34:34,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-05-02 23:34:34,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:34:34,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-05-02 23:34:34,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 23:34:34,053 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:34:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:34:43,474 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2021-05-02 23:34:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-02 23:34:43,475 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:34:43,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:34:43,476 INFO L225 Difference]: With dead ends: 132 [2021-05-02 23:34:43,476 INFO L226 Difference]: Without dead ends: 125 [2021-05-02 23:34:43,476 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 7 SyntacticMatches, 56 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 9502.5ms TimeCoverageRelationStatistics Valid=457, Invalid=13115, Unknown=0, NotChecked=0, Total=13572 [2021-05-02 23:34:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-05-02 23:34:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-05-02 23:34:43,484 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:34:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2021-05-02 23:34:43,484 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 121 [2021-05-02 23:34:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:34:43,485 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2021-05-02 23:34:43,485 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:34:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2021-05-02 23:34:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-05-02 23:34:43,485 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:34:43,486 INFO L523 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:34:43,486 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-05-02 23:34:43,486 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:34:43,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:34:43,486 INFO L82 PathProgramCache]: Analyzing trace with hash -834683910, now seen corresponding path program 56 times [2021-05-02 23:34:43,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:34:43,486 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1274736485] [2021-05-02 23:34:43,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:34:43,495 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1824 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1824} OutVars{main_~x~0=v_main_~x~0_1824} AuxVars[] AssignedVars[] [2021-05-02 23:34:43,496 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:34:43,513 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:43,534 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:34:43,555 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:34:43,584 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:34:43,586 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_1826 4294967296) 65520) (< (mod (+ v_main_~x~0_1826 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_1826} OutVars{main_~x~0=v_main_~x~0_1826} AuxVars[] AssignedVars[] [2021-05-02 23:34:43,587 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:34:43,606 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:43,607 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:34:43,760 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:34:43,895 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:34:43,900 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:34:43,942 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:34:43,974 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:34:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:34:44,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:34:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:34:44,041 INFO 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:34:50,262 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:34:50,263 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1274736485] [2021-05-02 23:34:50,263 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1274736485] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:34:50,263 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:34:50,263 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2021-05-02 23:34:50,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675181462] [2021-05-02 23:34:50,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2021-05-02 23:34:50,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:34:50,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-05-02 23:34:50,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3602, Unknown=0, NotChecked=0, Total=3782 [2021-05-02 23:34:50,264 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:35:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:35:00,883 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2021-05-02 23:35:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-05-02 23:35:00,884 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:35:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:35:00,885 INFO L225 Difference]: With dead ends: 134 [2021-05-02 23:35:00,885 INFO L226 Difference]: Without dead ends: 127 [2021-05-02 23:35:00,885 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 7 SyntacticMatches, 57 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 10871.9ms TimeCoverageRelationStatistics Valid=465, Invalid=13577, Unknown=0, NotChecked=0, Total=14042 [2021-05-02 23:35:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-05-02 23:35:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-05-02 23:35:00,893 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:35:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2021-05-02 23:35:00,894 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 123 [2021-05-02 23:35:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:35:00,894 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2021-05-02 23:35:00,894 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:35:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2021-05-02 23:35:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-02 23:35:00,895 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:35:00,895 INFO L523 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:35:00,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-05-02 23:35:00,895 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:35:00,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:35:00,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2102978967, now seen corresponding path program 57 times [2021-05-02 23:35:00,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:35:00,896 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1169298896] [2021-05-02 23:35:00,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:35:00,903 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1885 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1885} OutVars{main_~x~0=v_main_~x~0_1885} AuxVars[] AssignedVars[] [2021-05-02 23:35:00,905 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:35:00,905 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:00,923 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:35:00,953 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:35:00,990 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:35:00,991 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1887 1) 4294967296) 268435455) (< (mod v_main_~x~0_1887 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_1887} OutVars{main_~x~0=v_main_~x~0_1887} AuxVars[] AssignedVars[] [2021-05-02 23:35:00,993 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:35:00,994 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:00,995 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:01,053 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:35:01,060 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:35:01,113 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:35:01,147 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:35:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:35:01,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:35:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:35:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:35:08,646 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:35:08,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1169298896] [2021-05-02 23:35:08,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1169298896] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:35:08,647 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:35:08,647 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2021-05-02 23:35:08,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769803555] [2021-05-02 23:35:08,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-02 23:35:08,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:35:08,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-02 23:35:08,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2021-05-02 23:35:08,648 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:35:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:35:21,357 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-05-02 23:35:21,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-05-02 23:35:21,357 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:35:21,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:35:21,358 INFO L225 Difference]: With dead ends: 136 [2021-05-02 23:35:21,358 INFO L226 Difference]: Without dead ends: 129 [2021-05-02 23:35:21,359 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 7 SyntacticMatches, 58 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 12939.0ms TimeCoverageRelationStatistics Valid=473, Invalid=14047, Unknown=0, NotChecked=0, Total=14520 [2021-05-02 23:35:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-05-02 23:35:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-05-02 23:35:21,367 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:35:21,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2021-05-02 23:35:21,368 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 125 [2021-05-02 23:35:21,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:35:21,368 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2021-05-02 23:35:21,368 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:35:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2021-05-02 23:35:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-05-02 23:35:21,369 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:35:21,369 INFO L523 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:35:21,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-05-02 23:35:21,369 INFO L428 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:35:21,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:35:21,370 INFO L82 PathProgramCache]: Analyzing trace with hash -891477004, now seen corresponding path program 58 times [2021-05-02 23:35:21,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:35:21,370 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [661937919] [2021-05-02 23:35:21,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:35:21,382 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_1947 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_1947} OutVars{main_~x~0=v_main_~x~0_1947} AuxVars[] AssignedVars[] [2021-05-02 23:35:21,388 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:35:21,389 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:21,425 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:35:21,472 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:35:21,528 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:35:21,530 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_1949 1) 4294967296) 268435455) (< (mod v_main_~x~0_1949 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_1949} OutVars{main_~x~0=v_main_~x~0_1949} AuxVars[] AssignedVars[] [2021-05-02 23:35:21,533 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:35:21,563 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:21,566 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:22,940 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:35:22,968 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:35:22,974 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:35:23,010 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:35:23,042 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:35:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:35:23,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:35:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:35:23,152 INFO 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:35:31,246 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:35:31,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [661937919] [2021-05-02 23:35:31,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [661937919] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:35:31,246 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:35:31,246 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2021-05-02 23:35:31,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716971322] [2021-05-02 23:35:31,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2021-05-02 23:35:31,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:35:31,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-05-02 23:35:31,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3846, Unknown=0, NotChecked=0, Total=4032 [2021-05-02 23:35:31,248 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:35:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:35:45,708 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2021-05-02 23:35:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-05-02 23:35:45,709 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:35:45,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:35:45,710 INFO L225 Difference]: With dead ends: 138 [2021-05-02 23:35:45,710 INFO L226 Difference]: Without dead ends: 131 [2021-05-02 23:35:45,711 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 7 SyntacticMatches, 59 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 14274.2ms TimeCoverageRelationStatistics Valid=481, Invalid=14525, Unknown=0, NotChecked=0, Total=15006 [2021-05-02 23:35:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-02 23:35:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-05-02 23:35:45,717 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:35:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2021-05-02 23:35:45,717 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 127 [2021-05-02 23:35:45,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:35:45,717 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2021-05-02 23:35:45,717 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:35:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2021-05-02 23:35:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-05-02 23:35:45,718 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:35:45,718 INFO L523 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:35:45,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-05-02 23:35:45,718 INFO L428 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:35:45,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:35:45,718 INFO L82 PathProgramCache]: Analyzing trace with hash -935576815, now seen corresponding path program 59 times [2021-05-02 23:35:45,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:35:45,718 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [820886552] [2021-05-02 23:35:45,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:35:45,726 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2010 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_2010} OutVars{main_~x~0=v_main_~x~0_2010} AuxVars[] AssignedVars[] [2021-05-02 23:35:45,727 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:35:45,727 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:45,752 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:35:45,787 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:35:45,826 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:35:45,827 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2012 4294967296) 65520) (< (mod (+ v_main_~x~0_2012 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_2012} OutVars{main_~x~0=v_main_~x~0_2012} AuxVars[] AssignedVars[] [2021-05-02 23:35:45,829 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:35:45,850 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:45,852 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:35:45,962 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 1 [2021-05-02 23:35:46,055 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:35:46,065 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:35:46,107 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:35:46,146 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:35:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:35:46,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:35:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:35:46,257 INFO 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:35:54,901 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:35:54,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [820886552] [2021-05-02 23:35:54,902 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [820886552] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:35:54,902 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:35:54,902 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2021-05-02 23:35:54,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167165747] [2021-05-02 23:35:54,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2021-05-02 23:35:54,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:35:54,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-05-02 23:35:54,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 23:35:54,903 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:36:10,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:36:10,640 INFO L93 Difference]: Finished difference Result 140 states and 144 transitions. [2021-05-02 23:36:10,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-05-02 23:36:10,641 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:36:10,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:36:10,642 INFO L225 Difference]: With dead ends: 140 [2021-05-02 23:36:10,642 INFO L226 Difference]: Without dead ends: 133 [2021-05-02 23:36:10,642 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 6 SyntacticMatches, 61 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2005 ImplicationChecksByTransitivity, 15327.8ms TimeCoverageRelationStatistics Valid=489, Invalid=15011, Unknown=0, NotChecked=0, Total=15500 [2021-05-02 23:36:10,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-05-02 23:36:10,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-05-02 23:36:10,650 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:36:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2021-05-02 23:36:10,651 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 129 [2021-05-02 23:36:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:36:10,651 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2021-05-02 23:36:10,651 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:36:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2021-05-02 23:36:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-05-02 23:36:10,652 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:36:10,652 INFO L523 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:36:10,652 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-05-02 23:36:10,652 INFO L428 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:36:10,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:36:10,653 INFO L82 PathProgramCache]: Analyzing trace with hash -365822226, now seen corresponding path program 60 times [2021-05-02 23:36:10,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:36:10,653 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [985345452] [2021-05-02 23:36:10,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:36:10,660 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2074 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_2074} OutVars{main_~x~0=v_main_~x~0_2074} AuxVars[] AssignedVars[] [2021-05-02 23:36:10,662 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:36:10,662 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:36:10,697 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:36:10,738 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:36:10,777 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:36:10,779 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2076 4294967296) 65520) (< (mod (+ v_main_~x~0_2076 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_2076} OutVars{main_~x~0=v_main_~x~0_2076} AuxVars[] AssignedVars[] [2021-05-02 23:36:10,780 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:36:10,805 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:36:10,807 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:36:11,008 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:36:11,063 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:36:11,076 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:36:11,124 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:36:11,163 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:36:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:36:11,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:36:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:36:11,252 INFO 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:36:21,253 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:36:21,253 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [985345452] [2021-05-02 23:36:21,253 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [985345452] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:36:21,253 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:36:21,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2021-05-02 23:36:21,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362803053] [2021-05-02 23:36:21,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-02 23:36:21,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:36:21,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-02 23:36:21,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=4098, Unknown=0, NotChecked=0, Total=4290 [2021-05-02 23:36:21,255 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:36:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:36:39,231 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2021-05-02 23:36:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-05-02 23:36:39,232 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:36:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:36:39,233 INFO L225 Difference]: With dead ends: 142 [2021-05-02 23:36:39,233 INFO L226 Difference]: Without dead ends: 135 [2021-05-02 23:36:39,234 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 6 SyntacticMatches, 62 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 17461.8ms TimeCoverageRelationStatistics Valid=497, Invalid=15505, Unknown=0, NotChecked=0, Total=16002 [2021-05-02 23:36:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-05-02 23:36:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2021-05-02 23:36:39,240 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:36:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2021-05-02 23:36:39,240 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 131 [2021-05-02 23:36:39,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:36:39,241 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2021-05-02 23:36:39,241 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:36:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2021-05-02 23:36:39,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-05-02 23:36:39,241 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:36:39,242 INFO L523 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:36:39,242 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-05-02 23:36:39,242 INFO L428 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:36:39,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:36:39,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1707491211, now seen corresponding path program 61 times [2021-05-02 23:36:39,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:36:39,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [964192766] [2021-05-02 23:36:39,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:36:39,253 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2139 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_2139} OutVars{main_~x~0=v_main_~x~0_2139} AuxVars[] AssignedVars[] [2021-05-02 23:36:39,255 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:36:39,271 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:36:39,297 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:36:39,324 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:36:39,375 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:36:39,377 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2141 4294967296) 65520) (< (mod (+ v_main_~x~0_2141 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_2141} OutVars{main_~x~0=v_main_~x~0_2141} AuxVars[] AssignedVars[] [2021-05-02 23:36:39,379 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:36:39,400 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:36:39,403 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:36:41,489 WARN L205 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 15 [2021-05-02 23:36:44,125 WARN L205 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:36:44,176 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:36:44,185 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:36:44,242 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:36:44,307 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:36:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:36:44,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:36:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:36:44,430 INFO 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:36:56,358 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:36:56,358 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [964192766] [2021-05-02 23:36:56,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [964192766] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:36:56,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:36:56,358 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2021-05-02 23:36:56,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953566060] [2021-05-02 23:36:56,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-05-02 23:36:56,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:36:56,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-05-02 23:36:56,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2021-05-02 23:36:56,359 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:37:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:37:17,365 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2021-05-02 23:37:17,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-05-02 23:37:17,366 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:37:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:37:17,367 INFO L225 Difference]: With dead ends: 144 [2021-05-02 23:37:17,367 INFO L226 Difference]: Without dead ends: 137 [2021-05-02 23:37:17,368 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 6 SyntacticMatches, 63 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 20516.1ms TimeCoverageRelationStatistics Valid=505, Invalid=16007, Unknown=0, NotChecked=0, Total=16512 [2021-05-02 23:37:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-05-02 23:37:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-05-02 23:37:17,374 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:37:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2021-05-02 23:37:17,375 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 133 [2021-05-02 23:37:17,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:37:17,375 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2021-05-02 23:37:17,375 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:37:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2021-05-02 23:37:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-05-02 23:37:17,375 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:37:17,375 INFO L523 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:37:17,376 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-05-02 23:37:17,376 INFO L428 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:37:17,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:37:17,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1296878824, now seen corresponding path program 62 times [2021-05-02 23:37:17,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:37:17,376 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1904500209] [2021-05-02 23:37:17,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:37:17,400 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2205 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_2205} OutVars{main_~x~0=v_main_~x~0_2205} AuxVars[] AssignedVars[] [2021-05-02 23:37:17,405 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:37:17,407 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:37:17,447 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:37:17,498 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:37:17,554 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:37:17,556 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2207 1) 4294967296) 268435455) (< (mod v_main_~x~0_2207 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_2207} OutVars{main_~x~0=v_main_~x~0_2207} AuxVars[] AssignedVars[] [2021-05-02 23:37:17,558 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:37:17,559 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:37:17,563 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:37:17,607 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:37:17,619 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:37:17,700 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:37:17,770 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:37:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:37:17,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:37:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:37:17,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:37:31,310 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:37:31,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1904500209] [2021-05-02 23:37:31,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1904500209] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:37:31,311 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:37:31,311 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2021-05-02 23:37:31,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283826873] [2021-05-02 23:37:31,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2021-05-02 23:37:31,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:37:31,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-05-02 23:37:31,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2021-05-02 23:37:31,312 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:37:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:37:56,539 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2021-05-02 23:37:56,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-05-02 23:37:56,541 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:37:56,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:37:56,542 INFO L225 Difference]: With dead ends: 146 [2021-05-02 23:37:56,542 INFO L226 Difference]: Without dead ends: 139 [2021-05-02 23:37:56,543 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 7 SyntacticMatches, 63 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2200 ImplicationChecksByTransitivity, 23536.6ms TimeCoverageRelationStatistics Valid=513, Invalid=16517, Unknown=0, NotChecked=0, Total=17030 [2021-05-02 23:37:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-02 23:37:56,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-05-02 23:37:56,551 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:37:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2021-05-02 23:37:56,551 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 135 [2021-05-02 23:37:56,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:37:56,552 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2021-05-02 23:37:56,552 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:37:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2021-05-02 23:37:56,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-05-02 23:37:56,553 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:37:56,553 INFO L523 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:37:56,553 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-05-02 23:37:56,553 INFO L428 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:37:56,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:37:56,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1835366149, now seen corresponding path program 63 times [2021-05-02 23:37:56,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:37:56,554 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [908985733] [2021-05-02 23:37:56,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:37:56,568 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2272 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_2272} OutVars{main_~x~0=v_main_~x~0_2272} AuxVars[] AssignedVars[] [2021-05-02 23:37:56,570 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:37:56,588 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:37:56,623 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:37:56,658 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:37:56,725 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:37:56,727 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2274 1) 4294967296) 268435455) (< (mod v_main_~x~0_2274 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_2274} OutVars{main_~x~0=v_main_~x~0_2274} AuxVars[] AssignedVars[] [2021-05-02 23:37:56,729 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:37:56,763 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:37:56,765 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:37:56,864 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:37:56,876 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:37:56,972 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:37:57,038 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:37:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:37:57,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:37:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:37:57,211 INFO 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:38:12,322 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:38:12,323 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [908985733] [2021-05-02 23:38:12,323 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [908985733] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:38:12,323 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:38:12,323 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2021-05-02 23:38:12,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717442313] [2021-05-02 23:38:12,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2021-05-02 23:38:12,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:38:12,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-05-02 23:38:12,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2021-05-02 23:38:12,324 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:38:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:38:40,579 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2021-05-02 23:38:40,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-05-02 23:38:40,581 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:38:40,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:38:40,582 INFO L225 Difference]: With dead ends: 148 [2021-05-02 23:38:40,582 INFO L226 Difference]: Without dead ends: 141 [2021-05-02 23:38:40,583 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 6 SyntacticMatches, 65 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2267 ImplicationChecksByTransitivity, 26324.5ms TimeCoverageRelationStatistics Valid=521, Invalid=17035, Unknown=0, NotChecked=0, Total=17556 [2021-05-02 23:38:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-05-02 23:38:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2021-05-02 23:38:40,590 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:38:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2021-05-02 23:38:40,590 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 137 [2021-05-02 23:38:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:38:40,590 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2021-05-02 23:38:40,590 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:38:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2021-05-02 23:38:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-05-02 23:38:40,591 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:38:40,591 INFO L523 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:38:40,592 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-05-02 23:38:40,592 INFO L428 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:38:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:38:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash -369357342, now seen corresponding path program 64 times [2021-05-02 23:38:40,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:38:40,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [873757965] [2021-05-02 23:38:40,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:38:40,603 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2340 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_2340} OutVars{main_~x~0=v_main_~x~0_2340} AuxVars[] AssignedVars[] [2021-05-02 23:38:40,608 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:38:40,630 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:38:40,667 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:38:40,702 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:38:40,770 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:38:40,773 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2342 4294967296) 65520) (< (mod (+ v_main_~x~0_2342 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_2342} OutVars{main_~x~0=v_main_~x~0_2342} AuxVars[] AssignedVars[] [2021-05-02 23:38:40,775 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:38:40,807 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:38:40,811 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:38:44,070 WARN L205 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 15 DAG size of output: 1 [2021-05-02 23:38:44,135 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:38:44,148 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:38:44,222 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:38:44,292 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:38:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:38:44,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:38:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:38:44,430 INFO 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:39:01,133 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:39:01,134 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [873757965] [2021-05-02 23:39:01,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [873757965] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:39:01,134 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:39:01,134 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2021-05-02 23:39:01,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180144365] [2021-05-02 23:39:01,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2021-05-02 23:39:01,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:39:01,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-05-02 23:39:01,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=4626, Unknown=0, NotChecked=0, Total=4830 [2021-05-02 23:39:01,135 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:39:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:39:32,236 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2021-05-02 23:39:32,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-05-02 23:39:32,238 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:39:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:39:32,239 INFO L225 Difference]: With dead ends: 150 [2021-05-02 23:39:32,239 INFO L226 Difference]: Without dead ends: 143 [2021-05-02 23:39:32,240 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 7 SyntacticMatches, 65 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2335 ImplicationChecksByTransitivity, 29026.5ms TimeCoverageRelationStatistics Valid=529, Invalid=17561, Unknown=0, NotChecked=0, Total=18090 [2021-05-02 23:39:32,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-05-02 23:39:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-05-02 23:39:32,248 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:39:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2021-05-02 23:39:32,248 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 139 [2021-05-02 23:39:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:39:32,248 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2021-05-02 23:39:32,248 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:39:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2021-05-02 23:39:32,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-05-02 23:39:32,249 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:39:32,249 INFO L523 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:39:32,249 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-05-02 23:39:32,249 INFO L428 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:39:32,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:39:32,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1689755265, now seen corresponding path program 65 times [2021-05-02 23:39:32,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:39:32,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [356035385] [2021-05-02 23:39:32,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:39:32,275 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2409 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_2409} OutVars{main_~x~0=v_main_~x~0_2409} AuxVars[] AssignedVars[] [2021-05-02 23:39:32,278 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:39:32,280 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:39:32,322 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:39:32,379 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:39:32,449 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:39:32,452 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod v_main_~x~0_2411 4294967296) 65520) (< (mod (+ v_main_~x~0_2411 1) 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_2411} OutVars{main_~x~0=v_main_~x~0_2411} AuxVars[] AssignedVars[] [2021-05-02 23:39:32,454 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:39:32,456 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:39:32,459 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:39:32,532 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:39:32,545 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:39:32,647 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:39:32,713 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:39:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:39:32,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:39:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:39:32,878 INFO 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:39:51,558 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:39:51,558 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [356035385] [2021-05-02 23:39:51,558 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [356035385] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:39:51,558 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:39:51,558 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2021-05-02 23:39:51,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933007400] [2021-05-02 23:39:51,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2021-05-02 23:39:51,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:39:51,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-05-02 23:39:51,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2021-05-02 23:39:51,559 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:39:52,208 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-05-02 23:40:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:40:26,735 INFO L93 Difference]: Finished difference Result 152 states and 156 transitions. [2021-05-02 23:40:26,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-05-02 23:40:26,737 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:40:26,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:40:26,738 INFO L225 Difference]: With dead ends: 152 [2021-05-02 23:40:26,738 INFO L226 Difference]: Without dead ends: 145 [2021-05-02 23:40:26,739 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 6 SyntacticMatches, 67 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2404 ImplicationChecksByTransitivity, 32438.0ms TimeCoverageRelationStatistics Valid=537, Invalid=18095, Unknown=0, NotChecked=0, Total=18632 [2021-05-02 23:40:26,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-05-02 23:40:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2021-05-02 23:40:26,746 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:40:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2021-05-02 23:40:26,747 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 141 [2021-05-02 23:40:26,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:40:26,747 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2021-05-02 23:40:26,747 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:40:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2021-05-02 23:40:26,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-05-02 23:40:26,748 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:40:26,748 INFO L523 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:40:26,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-05-02 23:40:26,748 INFO L428 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:40:26,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:40:26,749 INFO L82 PathProgramCache]: Analyzing trace with hash 718160348, now seen corresponding path program 66 times [2021-05-02 23:40:26,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:40:26,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1449210100] [2021-05-02 23:40:26,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:40:26,760 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2479 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_2479} OutVars{main_~x~0=v_main_~x~0_2479} AuxVars[] AssignedVars[] [2021-05-02 23:40:26,762 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:40:26,764 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:40:26,801 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:40:26,859 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:40:26,931 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:40:26,933 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2481 1) 4294967296) 268435455) (< (mod v_main_~x~0_2481 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_2481} OutVars{main_~x~0=v_main_~x~0_2481} AuxVars[] AssignedVars[] [2021-05-02 23:40:26,936 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:40:26,937 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:40:26,940 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:40:27,257 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 3 DAG size of output: 1 [2021-05-02 23:40:27,333 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:40:27,343 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:40:27,449 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:40:27,526 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:40:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:40:27,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:40:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:40:27,752 INFO 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:40:48,928 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:40:48,928 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1449210100] [2021-05-02 23:40:48,928 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1449210100] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:40:48,928 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:40:48,928 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2021-05-02 23:40:48,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717802188] [2021-05-02 23:40:48,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2021-05-02 23:40:48,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:40:48,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-05-02 23:40:48,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4902, Unknown=0, NotChecked=0, Total=5112 [2021-05-02 23:40:48,930 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:40:49,607 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-05-02 23:40:51,892 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-05-02 23:41:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:41:26,767 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2021-05-02 23:41:26,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-05-02 23:41:26,770 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:41:26,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:41:26,771 INFO L225 Difference]: With dead ends: 154 [2021-05-02 23:41:26,771 INFO L226 Difference]: Without dead ends: 147 [2021-05-02 23:41:26,772 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 6 SyntacticMatches, 68 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2474 ImplicationChecksByTransitivity, 36232.5ms TimeCoverageRelationStatistics Valid=545, Invalid=18637, Unknown=0, NotChecked=0, Total=19182 [2021-05-02 23:41:26,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-05-02 23:41:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-05-02 23:41:26,781 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:41:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2021-05-02 23:41:26,782 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 143 [2021-05-02 23:41:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:41:26,782 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2021-05-02 23:41:26,782 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:41:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2021-05-02 23:41:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-05-02 23:41:26,783 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:41:26,783 INFO L523 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:41:26,783 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-05-02 23:41:26,783 INFO L428 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:41:26,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:41:26,783 INFO L82 PathProgramCache]: Analyzing trace with hash -262308103, now seen corresponding path program 67 times [2021-05-02 23:41:26,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:41:26,783 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1186735098] [2021-05-02 23:41:26,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:41:26,796 INFO L181 rdanLoopAcceleration]: Guard: Formula: (< (mod v_main_~x~0_2550 4294967296) 65520) InVars {main_~x~0=v_main_~x~0_2550} OutVars{main_~x~0=v_main_~x~0_2550} AuxVars[] AssignedVars[] [2021-05-02 23:41:26,798 WARN L240 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size [2021-05-02 23:41:26,824 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:41:26,866 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-05-02 23:41:26,915 WARN L245 tifierPushTermWalker]: treesize reduction 4, result has 93.2 percent of original size 55 [2021-05-02 23:41:27,006 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:41:27,008 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (< (mod (+ v_main_~x~0_2552 1) 4294967296) 268435455) (< (mod v_main_~x~0_2552 4294967296) 65520)) InVars {main_~x~0=v_main_~x~0_2552} OutVars{main_~x~0=v_main_~x~0_2552} AuxVars[] AssignedVars[] [2021-05-02 23:41:27,010 WARN L240 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size [2021-05-02 23:41:27,012 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:41:27,015 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:41:27,184 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-05-02 23:41:27,197 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-05-02 23:41:27,329 WARN L245 tifierPushTermWalker]: treesize reduction 6, result has 93.6 percent of original size 88 [2021-05-02 23:41:27,429 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:41:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:27,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:41:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:41:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.