/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:03:03,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:03:03,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:03:03,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:03:03,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:03:03,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:03:03,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:03:03,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:03:03,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:03:03,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:03:03,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:03:03,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:03:03,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:03:03,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:03:03,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:03:03,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:03:03,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:03:03,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:03:03,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:03:03,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:03:03,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:03:03,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:03:03,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:03:03,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:03:03,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:03:03,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:03:03,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:03:03,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:03:03,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:03:03,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:03:03,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:03:03,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:03:03,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:03:03,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:03:03,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:03:03,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:03:03,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:03:03,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:03:03,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:03:03,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:03:03,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:03:03,821 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:03:03,832 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:03:03,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:03:03,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:03:03,833 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:03:03,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:03:03,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:03:03,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:03:03,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:03:03,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:03:03,834 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:03:03,834 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:03:03,834 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:03:03,834 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:03:03,835 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:03:03,835 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:03:03,835 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:03:03,835 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:03:03,835 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:03:03,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:03:03,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:03:03,836 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:03:03,836 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:03:03,836 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:03:03,836 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:03:04,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:03:04,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:03:04,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:03:04,107 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:03:04,108 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:03:04,109 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2021-05-02 23:03:04,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24a02bdcb/7ebe042007cb4d60b62dd375f33bdca0/FLAG6f71375a1 [2021-05-02 23:03:04,538 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:03:04,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2021-05-02 23:03:04,543 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24a02bdcb/7ebe042007cb4d60b62dd375f33bdca0/FLAG6f71375a1 [2021-05-02 23:03:04,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24a02bdcb/7ebe042007cb4d60b62dd375f33bdca0 [2021-05-02 23:03:04,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:03:04,978 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:03:04,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:03:04,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:03:04,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:03:04,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:03:04" (1/1) ... [2021-05-02 23:03:04,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34521ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:03:04, skipping insertion in model container [2021-05-02 23:03:04,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:03:04" (1/1) ... [2021-05-02 23:03:04,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:03:05,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:03:05,093 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i[834,847] [2021-05-02 23:03:05,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:03:05,112 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:03:05,122 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i[834,847] [2021-05-02 23:03:05,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:03:05,136 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:03:05,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:03:05 WrapperNode [2021-05-02 23:03:05,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:03:05,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:03:05,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:03:05,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:03:05,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:03:05" (1/1) ... [2021-05-02 23:03:05,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:03:05" (1/1) ... [2021-05-02 23:03:05,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:03:05" (1/1) ... [2021-05-02 23:03:05,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:03:05" (1/1) ... [2021-05-02 23:03:05,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:03:05" (1/1) ... [2021-05-02 23:03:05,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:03:05" (1/1) ... [2021-05-02 23:03:05,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:03:05" (1/1) ... [2021-05-02 23:03:05,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:03:05,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:03:05,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:03:05,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:03:05,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:03:05" (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:03:05,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:03:05,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:03:05,277 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:03:05,277 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:03:05,277 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:03:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:03:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:03:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-02 23:03:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-02 23:03:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:03:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:03:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:03:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2021-05-02 23:03:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:03:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:03:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:03:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:03:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:03:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:03:05,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:03:05,423 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:03:05,423 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 23:03:05,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:03:05 BoogieIcfgContainer [2021-05-02 23:03:05,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:03:05,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:03:05,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:03:05,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:03:05,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:03:04" (1/3) ... [2021-05-02 23:03:05,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660516fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:03:05, skipping insertion in model container [2021-05-02 23:03:05,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:03:05" (2/3) ... [2021-05-02 23:03:05,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660516fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:03:05, skipping insertion in model container [2021-05-02 23:03:05,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:03:05" (3/3) ... [2021-05-02 23:03:05,429 INFO L111 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case.i [2021-05-02 23:03:05,434 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:03:05,436 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:03:05,469 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:03:05,492 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:03:05,492 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:03:05,492 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:03:05,492 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:03:05,492 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:03:05,492 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:03:05,492 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:03:05,492 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:03:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:03:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:03:05,524 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:05,525 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:05,525 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:05,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:05,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1466806487, now seen corresponding path program 1 times [2021-05-02 23:03:05,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:05,534 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1997946284] [2021-05-02 23:03:05,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:05,572 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:03:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:05,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:05,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:03:05,743 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:05,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1997946284] [2021-05-02 23:03:05,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1997946284] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:05,745 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:05,745 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 23:03:05,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138147363] [2021-05-02 23:03:05,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 23:03:05,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:05,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 23:03:05,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:03:05,759 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:05,820 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-05-02 23:03:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 23:03:05,822 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:03:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:05,826 INFO L225 Difference]: With dead ends: 31 [2021-05-02 23:03:05,826 INFO L226 Difference]: Without dead ends: 14 [2021-05-02 23:03:05,829 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:03:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-05-02 23:03:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-05-02 23:03:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:05,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-05-02 23:03:05,862 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-05-02 23:03:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:05,863 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-05-02 23:03:05,863 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:03:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-05-02 23:03:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:03:05,864 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:05,864 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:05,864 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:03:05,864 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:05,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:05,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1456647756, now seen corresponding path program 1 times [2021-05-02 23:03:05,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:05,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [243066586] [2021-05-02 23:03:05,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:05,872 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:03:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:05,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:06,003 INFO 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:03:06,003 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:06,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [243066586] [2021-05-02 23:03:06,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [243066586] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:06,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:06,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:03:06,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811534840] [2021-05-02 23:03:06,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:03:06,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:06,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:03:06,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:03:06,005 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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:03:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:06,134 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-05-02 23:03:06,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:03:06,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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:03:06,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:06,135 INFO L225 Difference]: With dead ends: 20 [2021-05-02 23:03:06,135 INFO L226 Difference]: Without dead ends: 15 [2021-05-02 23:03:06,136 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 116.3ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:03:06,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-05-02 23:03:06,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-05-02 23:03:06,143 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:03:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2021-05-02 23:03:06,144 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2021-05-02 23:03:06,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:06,144 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2021-05-02 23:03:06,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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:03:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2021-05-02 23:03:06,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 23:03:06,145 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:06,145 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:06,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:03:06,145 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:06,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:06,145 INFO L82 PathProgramCache]: Analyzing trace with hash 193151625, now seen corresponding path program 1 times [2021-05-02 23:03:06,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:06,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1015749930] [2021-05-02 23:03:06,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:06,175 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_11 v_main_~n~0_6) (= v_main_~i~0_11 4)) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_6} OutVars{main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_6} AuxVars[] AssignedVars[] [2021-05-02 23:03:06,185 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:06,216 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:06,233 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:06,249 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:06,254 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:06,258 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:06,280 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:06,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:06,359 INFO 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:03:06,418 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:06,418 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1015749930] [2021-05-02 23:03:06,418 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1015749930] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:06,418 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:06,418 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:03:06,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044276240] [2021-05-02 23:03:06,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:03:06,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:06,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:03:06,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:03:06,421 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:06,597 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2021-05-02 23:03:06,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:03:06,597 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-02 23:03:06,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:06,598 INFO L225 Difference]: With dead ends: 24 [2021-05-02 23:03:06,598 INFO L226 Difference]: Without dead ends: 19 [2021-05-02 23:03:06,599 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 159.9ms TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:03:06,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-02 23:03:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-05-02 23:03:06,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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:03:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-05-02 23:03:06,605 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2021-05-02 23:03:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:06,605 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-05-02 23:03:06,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2021-05-02 23:03:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 23:03:06,606 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:06,606 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:06,606 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:03:06,606 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:06,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:06,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1968158987, now seen corresponding path program 1 times [2021-05-02 23:03:06,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:06,610 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [806489563] [2021-05-02 23:03:06,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:06,621 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_15 4)) (<= v_main_~i~0_15 v_main_~n~0_7)) InVars {main_~i~0=v_main_~i~0_15, main_~n~0=v_main_~n~0_7} OutVars{main_~i~0=v_main_~i~0_15, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[] [2021-05-02 23:03:06,633 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:06,657 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:06,665 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:06,679 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:06,688 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:06,711 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:06,737 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:06,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:06,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:06,993 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:06,994 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [806489563] [2021-05-02 23:03:06,994 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [806489563] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:06,994 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:06,994 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:03:06,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474826506] [2021-05-02 23:03:06,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:03:06,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:06,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:03:06,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:03:06,995 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:07,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:07,252 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-05-02 23:03:07,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:03:07,252 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-02 23:03:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:07,253 INFO L225 Difference]: With dead ends: 31 [2021-05-02 23:03:07,253 INFO L226 Difference]: Without dead ends: 18 [2021-05-02 23:03:07,253 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 321.5ms TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:03:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-05-02 23:03:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-05-02 23:03:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2021-05-02 23:03:07,257 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2021-05-02 23:03:07,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:07,257 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2021-05-02 23:03:07,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2021-05-02 23:03:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:03:07,257 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:07,257 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:07,257 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:03:07,258 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:07,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:07,258 INFO L82 PathProgramCache]: Analyzing trace with hash 80268138, now seen corresponding path program 1 times [2021-05-02 23:03:07,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:07,258 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [802934996] [2021-05-02 23:03:07,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:07,265 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_19 4)) (<= (+ v_main_~i~0_19 1) v_main_~n~0_8)) InVars {main_~i~0=v_main_~i~0_19, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_19, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] [2021-05-02 23:03:07,270 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:07,286 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:07,291 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:07,304 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:07,311 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:07,328 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:07,349 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:07,355 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_21 4)) (<= v_main_~i~0_21 v_main_~n~0_9)) InVars {main_~i~0=v_main_~i~0_21, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_21, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[] [2021-05-02 23:03:07,360 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:07,363 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:07,371 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:07,383 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:07,390 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:07,420 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:07,468 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_23 v_main_~n~0_10) (= v_main_~i~0_23 4)) InVars {main_~i~0=v_main_~i~0_23, main_~n~0=v_main_~n~0_10} OutVars{main_~i~0=v_main_~i~0_23, main_~n~0=v_main_~n~0_10} AuxVars[] AssignedVars[] [2021-05-02 23:03:07,472 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:07,474 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:07,477 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:07,491 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:07,493 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:07,505 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:07,519 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:07,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:07,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:03:07,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:07,769 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:07,769 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [802934996] [2021-05-02 23:03:07,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [802934996] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:07,769 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:07,769 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-02 23:03:07,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416957374] [2021-05-02 23:03:07,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-02 23:03:07,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:07,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-02 23:03:07,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:03:07,770 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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:03:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:07,940 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2021-05-02 23:03:07,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:03:07,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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:03:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:07,941 INFO L225 Difference]: With dead ends: 28 [2021-05-02 23:03:07,941 INFO L226 Difference]: Without dead ends: 20 [2021-05-02 23:03:07,941 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 244.1ms TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2021-05-02 23:03:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-05-02 23:03:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2021-05-02 23:03:07,944 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:03:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2021-05-02 23:03:07,944 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2021-05-02 23:03:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:07,944 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2021-05-02 23:03:07,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 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:03:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2021-05-02 23:03:07,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:03:07,945 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:07,945 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:07,945 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 23:03:07,945 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:07,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:07,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1855275500, now seen corresponding path program 2 times [2021-05-02 23:03:07,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:07,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1211339596] [2021-05-02 23:03:07,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:07,951 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_28 4)) (<= (+ v_main_~i~0_28 1) v_main_~n~0_11)) InVars {main_~i~0=v_main_~i~0_28, main_~n~0=v_main_~n~0_11} OutVars{main_~i~0=v_main_~i~0_28, main_~n~0=v_main_~n~0_11} AuxVars[] AssignedVars[] [2021-05-02 23:03:07,954 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:07,975 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:07,978 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:07,989 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:07,996 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:08,022 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:08,042 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:08,045 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_30 v_main_~n~0_12) (not (= v_main_~i~0_30 4))) InVars {main_~i~0=v_main_~i~0_30, main_~n~0=v_main_~n~0_12} OutVars{main_~i~0=v_main_~i~0_30, main_~n~0=v_main_~n~0_12} AuxVars[] AssignedVars[] [2021-05-02 23:03:08,048 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:08,061 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:08,066 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:08,076 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:08,082 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:08,099 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:08,122 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:08,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:08,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:03:08,322 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:08,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1211339596] [2021-05-02 23:03:08,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1211339596] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:08,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:08,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-02 23:03:08,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923957116] [2021-05-02 23:03:08,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 23:03:08,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:08,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 23:03:08,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-05-02 23:03:08,325 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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:03:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:08,639 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2021-05-02 23:03:08,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 23:03:08,639 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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:03:08,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:08,640 INFO L225 Difference]: With dead ends: 26 [2021-05-02 23:03:08,640 INFO L226 Difference]: Without dead ends: 21 [2021-05-02 23:03:08,640 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 342.3ms TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:03:08,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-05-02 23:03:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-05-02 23:03:08,643 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:03:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-05-02 23:03:08,643 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 17 [2021-05-02 23:03:08,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:08,643 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-05-02 23:03:08,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 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:03:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-05-02 23:03:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 23:03:08,644 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:08,644 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:08,644 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 23:03:08,644 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:08,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:08,645 INFO L82 PathProgramCache]: Analyzing trace with hash 127699689, now seen corresponding path program 2 times [2021-05-02 23:03:08,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:08,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1916849156] [2021-05-02 23:03:08,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:08,652 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_35 1) v_main_~n~0_13) (not (= v_main_~i~0_35 4))) InVars {main_~i~0=v_main_~i~0_35, main_~n~0=v_main_~n~0_13} OutVars{main_~i~0=v_main_~i~0_35, main_~n~0=v_main_~n~0_13} AuxVars[] AssignedVars[] [2021-05-02 23:03:08,655 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:08,657 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:08,660 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:08,672 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:08,677 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:08,707 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:08,731 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:08,735 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_37 4)) (<= v_main_~i~0_37 v_main_~n~0_14)) InVars {main_~i~0=v_main_~i~0_37, main_~n~0=v_main_~n~0_14} OutVars{main_~i~0=v_main_~i~0_37, main_~n~0=v_main_~n~0_14} AuxVars[] AssignedVars[] [2021-05-02 23:03:08,744 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:08,760 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:08,763 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:08,778 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:08,784 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:08,805 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:08,831 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_39 4) (<= v_main_~i~0_39 v_main_~n~0_15)) InVars {main_~i~0=v_main_~i~0_39, main_~n~0=v_main_~n~0_15} OutVars{main_~i~0=v_main_~i~0_39, main_~n~0=v_main_~n~0_15} AuxVars[] AssignedVars[] [2021-05-02 23:03:08,833 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:08,834 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:08,838 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:08,849 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:08,851 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:08,863 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:08,870 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:08,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:08,967 INFO 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:03:08,983 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:09,058 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:09,184 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:09,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1916849156] [2021-05-02 23:03:09,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1916849156] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:09,184 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:09,185 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-02 23:03:09,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320569734] [2021-05-02 23:03:09,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-02 23:03:09,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:09,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-02 23:03:09,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-05-02 23:03:09,190 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:09,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:09,710 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2021-05-02 23:03:09,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 23:03:09,711 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-02 23:03:09,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:09,711 INFO L225 Difference]: With dead ends: 43 [2021-05-02 23:03:09,711 INFO L226 Difference]: Without dead ends: 30 [2021-05-02 23:03:09,712 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 590.6ms TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2021-05-02 23:03:09,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-05-02 23:03:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2021-05-02 23:03:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-05-02 23:03:09,716 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2021-05-02 23:03:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:09,716 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-05-02 23:03:09,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-05-02 23:03:09,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 23:03:09,716 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:09,716 INFO L523 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:09,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 23:03:09,717 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:09,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:09,717 INFO L82 PathProgramCache]: Analyzing trace with hash 116795146, now seen corresponding path program 3 times [2021-05-02 23:03:09,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:09,717 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [520604640] [2021-05-02 23:03:09,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:09,735 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_45 4)) (<= (+ v_main_~i~0_45 1) v_main_~n~0_16)) InVars {main_~i~0=v_main_~i~0_45, main_~n~0=v_main_~n~0_16} OutVars{main_~i~0=v_main_~i~0_45, main_~n~0=v_main_~n~0_16} AuxVars[] AssignedVars[] [2021-05-02 23:03:09,737 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:09,739 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,741 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,753 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:09,759 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:09,794 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:09,814 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2021-05-02 23:03:09,820 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_47 4)) (<= v_main_~i~0_47 v_main_~n~0_17)) InVars {main_~i~0=v_main_~i~0_47, main_~n~0=v_main_~n~0_17} OutVars{main_~i~0=v_main_~i~0_47, main_~n~0=v_main_~n~0_17} AuxVars[] AssignedVars[] [2021-05-02 23:03:09,822 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:09,844 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,847 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,860 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:09,865 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:09,889 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:09,915 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_49 v_main_~n~0_18) (= v_main_~i~0_49 4)) InVars {main_~i~0=v_main_~i~0_49, main_~n~0=v_main_~n~0_18} OutVars{main_~i~0=v_main_~i~0_49, main_~n~0=v_main_~n~0_18} AuxVars[] AssignedVars[] [2021-05-02 23:03:09,922 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:09,938 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,940 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:09,955 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:09,957 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:09,970 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:09,978 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:10,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:10,059 INFO 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:03:10,062 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:10,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:10,310 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:10,311 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [520604640] [2021-05-02 23:03:10,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [520604640] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:10,311 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:10,311 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-02 23:03:10,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347553383] [2021-05-02 23:03:10,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-02 23:03:10,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:10,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-02 23:03:10,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2021-05-02 23:03:10,312 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 15 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:03:10,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:10,700 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2021-05-02 23:03:10,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 23:03:10,700 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.1875) internal successors, (19), 15 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:03:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:10,701 INFO L225 Difference]: With dead ends: 44 [2021-05-02 23:03:10,701 INFO L226 Difference]: Without dead ends: 27 [2021-05-02 23:03:10,701 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 489.4ms TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-05-02 23:03:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-05-02 23:03:10,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-05-02 23:03:10,704 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:03:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-05-02 23:03:10,705 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2021-05-02 23:03:10,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:10,705 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-05-02 23:03:10,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 16 states have (on average 1.1875) internal successors, (19), 15 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:03:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2021-05-02 23:03:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-02 23:03:10,705 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:10,706 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:10,706 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 23:03:10,706 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:10,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:10,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2070096139, now seen corresponding path program 4 times [2021-05-02 23:03:10,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:10,706 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1931073468] [2021-05-02 23:03:10,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:10,726 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_57 4) (<= (+ v_main_~i~0_57 1) v_main_~n~0_19)) InVars {main_~i~0=v_main_~i~0_57, main_~n~0=v_main_~n~0_19} OutVars{main_~i~0=v_main_~i~0_57, main_~n~0=v_main_~n~0_19} AuxVars[] AssignedVars[] [2021-05-02 23:03:10,728 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:10,729 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:10,731 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:10,739 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:10,741 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:10,751 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:10,761 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_59 4)) (<= (+ v_main_~i~0_59 1) v_main_~n~0_20)) InVars {main_~i~0=v_main_~i~0_59, main_~n~0=v_main_~n~0_20} OutVars{main_~i~0=v_main_~i~0_59, main_~n~0=v_main_~n~0_20} AuxVars[] AssignedVars[] [2021-05-02 23:03:10,763 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:10,775 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:10,778 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:10,788 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:10,794 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:10,811 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:10,831 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:10,834 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_61 v_main_~n~0_21) (not (= v_main_~i~0_61 4))) InVars {main_~i~0=v_main_~i~0_61, main_~n~0=v_main_~n~0_21} OutVars{main_~i~0=v_main_~i~0_61, main_~n~0=v_main_~n~0_21} AuxVars[] AssignedVars[] [2021-05-02 23:03:10,840 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:10,841 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:10,846 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:10,857 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:10,862 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:10,888 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:10,910 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_63 4) (<= v_main_~i~0_63 v_main_~n~0_22)) InVars {main_~i~0=v_main_~i~0_63, main_~n~0=v_main_~n~0_22} OutVars{main_~i~0=v_main_~i~0_63, main_~n~0=v_main_~n~0_22} AuxVars[] AssignedVars[] [2021-05-02 23:03:10,912 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:10,913 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:10,915 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:10,924 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:10,926 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:10,936 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:10,943 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:11,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:11,031 INFO 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:03:11,034 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:11,104 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:11,291 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:11,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1931073468] [2021-05-02 23:03:11,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1931073468] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:11,292 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:11,292 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-05-02 23:03:11,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719553779] [2021-05-02 23:03:11,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-05-02 23:03:11,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:11,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-05-02 23:03:11,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2021-05-02 23:03:11,293 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:11,724 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2021-05-02 23:03:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 23:03:11,725 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-05-02 23:03:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:11,725 INFO L225 Difference]: With dead ends: 37 [2021-05-02 23:03:11,725 INFO L226 Difference]: Without dead ends: 29 [2021-05-02 23:03:11,726 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 524.7ms TimeCoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2021-05-02 23:03:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-02 23:03:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-05-02 23:03:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2021-05-02 23:03:11,729 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2021-05-02 23:03:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:11,730 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-05-02 23:03:11,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2021-05-02 23:03:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-02 23:03:11,730 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:11,730 INFO L523 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:11,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-05-02 23:03:11,730 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:11,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:11,731 INFO L82 PathProgramCache]: Analyzing trace with hash -449863795, now seen corresponding path program 5 times [2021-05-02 23:03:11,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:11,731 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [401927669] [2021-05-02 23:03:11,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:11,745 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_71 1) v_main_~n~0_23) (= v_main_~i~0_71 4)) InVars {main_~i~0=v_main_~i~0_71, main_~n~0=v_main_~n~0_23} OutVars{main_~i~0=v_main_~i~0_71, main_~n~0=v_main_~n~0_23} AuxVars[] AssignedVars[] [2021-05-02 23:03:11,747 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:11,748 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:11,749 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:11,760 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:11,762 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:11,772 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:11,787 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_73 1) v_main_~n~0_24) (not (= v_main_~i~0_73 4))) InVars {main_~i~0=v_main_~i~0_73, main_~n~0=v_main_~n~0_24} OutVars{main_~i~0=v_main_~i~0_73, main_~n~0=v_main_~n~0_24} AuxVars[] AssignedVars[] [2021-05-02 23:03:11,789 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:11,802 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:11,804 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:11,814 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:11,820 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:11,835 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:11,857 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:11,859 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_75 4)) (<= v_main_~i~0_75 v_main_~n~0_25)) InVars {main_~i~0=v_main_~i~0_75, main_~n~0=v_main_~n~0_25} OutVars{main_~i~0=v_main_~i~0_75, main_~n~0=v_main_~n~0_25} AuxVars[] AssignedVars[] [2021-05-02 23:03:11,861 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:11,874 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:11,876 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:11,886 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:11,892 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:11,908 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:11,930 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_77 v_main_~n~0_26) (= v_main_~i~0_77 4)) InVars {main_~i~0=v_main_~i~0_77, main_~n~0=v_main_~n~0_26} OutVars{main_~i~0=v_main_~i~0_77, main_~n~0=v_main_~n~0_26} AuxVars[] AssignedVars[] [2021-05-02 23:03:11,932 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:11,945 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:11,947 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:11,957 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:11,959 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:11,961 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:11,968 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:12,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:12,037 INFO 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:03:12,039 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:12,275 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:12,275 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [401927669] [2021-05-02 23:03:12,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [401927669] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:12,275 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:12,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-05-02 23:03:12,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443465238] [2021-05-02 23:03:12,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-05-02 23:03:12,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:12,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-05-02 23:03:12,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2021-05-02 23:03:12,276 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:12,717 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2021-05-02 23:03:12,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-02 23:03:12,718 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-05-02 23:03:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:12,718 INFO L225 Difference]: With dead ends: 35 [2021-05-02 23:03:12,718 INFO L226 Difference]: Without dead ends: 30 [2021-05-02 23:03:12,719 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 510.3ms TimeCoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 23:03:12,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-05-02 23:03:12,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-05-02 23:03:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2021-05-02 23:03:12,723 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2021-05-02 23:03:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:12,723 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2021-05-02 23:03:12,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2021-05-02 23:03:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 23:03:12,724 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:12,724 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:12,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-05-02 23:03:12,724 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:12,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:12,724 INFO L82 PathProgramCache]: Analyzing trace with hash -44941912, now seen corresponding path program 6 times [2021-05-02 23:03:12,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:12,725 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [84555489] [2021-05-02 23:03:12,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:12,733 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_86 4) (<= (+ v_main_~i~0_86 1) v_main_~n~0_27)) InVars {main_~i~0=v_main_~i~0_86, main_~n~0=v_main_~n~0_27} OutVars{main_~i~0=v_main_~i~0_86, main_~n~0=v_main_~n~0_27} AuxVars[] AssignedVars[] [2021-05-02 23:03:12,734 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:12,746 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:12,748 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:12,756 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:12,758 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:12,760 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:12,769 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_88 4)) (<= (+ v_main_~i~0_88 1) v_main_~n~0_28)) InVars {main_~i~0=v_main_~i~0_88, main_~n~0=v_main_~n~0_28} OutVars{main_~i~0=v_main_~i~0_88, main_~n~0=v_main_~n~0_28} AuxVars[] AssignedVars[] [2021-05-02 23:03:12,770 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:12,783 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:12,784 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:12,794 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:12,801 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:12,828 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:12,849 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:12,851 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_90 v_main_~n~0_29) (not (= v_main_~i~0_90 4))) InVars {main_~i~0=v_main_~i~0_90, main_~n~0=v_main_~n~0_29} OutVars{main_~i~0=v_main_~i~0_90, main_~n~0=v_main_~n~0_29} AuxVars[] AssignedVars[] [2021-05-02 23:03:12,861 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:12,877 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:12,879 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:12,890 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:12,895 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:12,910 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:12,939 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_92 4) (<= v_main_~i~0_92 v_main_~n~0_30)) InVars {main_~i~0=v_main_~i~0_92, main_~n~0=v_main_~n~0_30} OutVars{main_~i~0=v_main_~i~0_92, main_~n~0=v_main_~n~0_30} AuxVars[] AssignedVars[] [2021-05-02 23:03:12,940 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:12,954 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:12,955 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:12,966 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:12,968 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:12,969 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:12,976 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:13,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:13,068 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:13,321 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:13,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [84555489] [2021-05-02 23:03:13,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [84555489] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:13,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:13,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-05-02 23:03:13,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998454694] [2021-05-02 23:03:13,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-05-02 23:03:13,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:13,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-05-02 23:03:13,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2021-05-02 23:03:13,323 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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:03:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:13,843 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2021-05-02 23:03:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-05-02 23:03:13,844 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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:03:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:13,844 INFO L225 Difference]: With dead ends: 40 [2021-05-02 23:03:13,844 INFO L226 Difference]: Without dead ends: 32 [2021-05-02 23:03:13,845 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 592.9ms TimeCoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 23:03:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-05-02 23:03:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-05-02 23:03:13,848 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:03:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2021-05-02 23:03:13,849 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2021-05-02 23:03:13,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:13,849 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2021-05-02 23:03:13,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 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:03:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2021-05-02 23:03:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 23:03:13,849 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:13,849 INFO L523 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:13,850 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-05-02 23:03:13,850 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:13,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:13,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1730065450, now seen corresponding path program 7 times [2021-05-02 23:03:13,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:13,850 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1786181298] [2021-05-02 23:03:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:13,856 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_101) (<= (+ v_main_~i~0_101 1) v_main_~n~0_31)) InVars {main_~i~0=v_main_~i~0_101, main_~n~0=v_main_~n~0_31} OutVars{main_~i~0=v_main_~i~0_101, main_~n~0=v_main_~n~0_31} AuxVars[] AssignedVars[] [2021-05-02 23:03:13,857 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:13,870 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:13,877 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:13,886 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:13,888 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:13,890 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:13,903 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_103)) (<= (+ v_main_~i~0_103 1) v_main_~n~0_32)) InVars {main_~i~0=v_main_~i~0_103, main_~n~0=v_main_~n~0_32} OutVars{main_~i~0=v_main_~i~0_103, main_~n~0=v_main_~n~0_32} AuxVars[] AssignedVars[] [2021-05-02 23:03:13,909 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:13,911 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:13,918 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:13,927 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:13,933 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:13,958 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:13,981 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:13,983 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_105)) (<= v_main_~i~0_105 v_main_~n~0_33)) InVars {main_~i~0=v_main_~i~0_105, main_~n~0=v_main_~n~0_33} OutVars{main_~i~0=v_main_~i~0_105, main_~n~0=v_main_~n~0_33} AuxVars[] AssignedVars[] [2021-05-02 23:03:13,985 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:14,004 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:14,007 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:14,018 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:14,024 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:14,039 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:14,068 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_107) (<= v_main_~i~0_107 v_main_~n~0_34)) InVars {main_~i~0=v_main_~i~0_107, main_~n~0=v_main_~n~0_34} OutVars{main_~i~0=v_main_~i~0_107, main_~n~0=v_main_~n~0_34} AuxVars[] AssignedVars[] [2021-05-02 23:03:14,069 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:14,070 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:14,072 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:14,090 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:14,091 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:14,101 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:14,108 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:14,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:14,234 INFO 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:03:14,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:14,330 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:14,591 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:14,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1786181298] [2021-05-02 23:03:14,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1786181298] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:14,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:14,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-05-02 23:03:14,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930119931] [2021-05-02 23:03:14,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-02 23:03:14,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:14,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-02 23:03:14,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-05-02 23:03:14,593 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 19 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:03:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:15,135 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2021-05-02 23:03:15,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-05-02 23:03:15,136 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.25) internal successors, (25), 19 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:03:15,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:15,136 INFO L225 Difference]: With dead ends: 38 [2021-05-02 23:03:15,136 INFO L226 Difference]: Without dead ends: 33 [2021-05-02 23:03:15,137 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 685.9ms TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 23:03:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-02 23:03:15,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-05-02 23:03:15,140 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:03:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-05-02 23:03:15,140 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2021-05-02 23:03:15,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:15,141 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-05-02 23:03:15,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 20 states have (on average 1.25) internal successors, (25), 19 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:03:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-05-02 23:03:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-02 23:03:15,141 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:15,141 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:15,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-05-02 23:03:15,141 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:15,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:15,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1973286933, now seen corresponding path program 8 times [2021-05-02 23:03:15,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:15,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1051362438] [2021-05-02 23:03:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:15,148 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_117 1) v_main_~n~0_35) (= 4 v_main_~i~0_117)) InVars {main_~i~0=v_main_~i~0_117, main_~n~0=v_main_~n~0_35} OutVars{main_~i~0=v_main_~i~0_117, main_~n~0=v_main_~n~0_35} AuxVars[] AssignedVars[] [2021-05-02 23:03:15,149 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:15,150 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:15,152 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:15,165 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:15,167 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:15,179 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:15,188 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_119 1) v_main_~n~0_36) (not (= 4 v_main_~i~0_119))) InVars {main_~i~0=v_main_~i~0_119, main_~n~0=v_main_~n~0_36} OutVars{main_~i~0=v_main_~i~0_119, main_~n~0=v_main_~n~0_36} AuxVars[] AssignedVars[] [2021-05-02 23:03:15,190 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:15,190 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:15,192 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:15,203 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:15,209 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:15,234 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:15,255 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:15,258 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_121)) (<= v_main_~i~0_121 v_main_~n~0_37)) InVars {main_~i~0=v_main_~i~0_121, main_~n~0=v_main_~n~0_37} OutVars{main_~i~0=v_main_~i~0_121, main_~n~0=v_main_~n~0_37} AuxVars[] AssignedVars[] [2021-05-02 23:03:15,259 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:15,277 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:15,278 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:15,291 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:15,297 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:15,313 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:15,335 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_123 v_main_~n~0_38) (= 4 v_main_~i~0_123)) InVars {main_~i~0=v_main_~i~0_123, main_~n~0=v_main_~n~0_38} OutVars{main_~i~0=v_main_~i~0_123, main_~n~0=v_main_~n~0_38} AuxVars[] AssignedVars[] [2021-05-02 23:03:15,336 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:15,351 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:15,356 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:15,365 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:15,366 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:15,368 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:15,375 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:15,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:15,452 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:15,532 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:15,812 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:15,812 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1051362438] [2021-05-02 23:03:15,812 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1051362438] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:15,812 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:15,812 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-05-02 23:03:15,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636260702] [2021-05-02 23:03:15,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-05-02 23:03:15,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:15,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-05-02 23:03:15,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2021-05-02 23:03:15,813 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:16,412 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2021-05-02 23:03:16,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-05-02 23:03:16,412 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-05-02 23:03:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:16,413 INFO L225 Difference]: With dead ends: 43 [2021-05-02 23:03:16,413 INFO L226 Difference]: Without dead ends: 35 [2021-05-02 23:03:16,413 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 699.5ms TimeCoverageRelationStatistics Valid=154, Invalid=1406, Unknown=0, NotChecked=0, Total=1560 [2021-05-02 23:03:16,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-05-02 23:03:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-05-02 23:03:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2021-05-02 23:03:16,418 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2021-05-02 23:03:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:16,418 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-05-02 23:03:16,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2021-05-02 23:03:16,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-02 23:03:16,418 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:16,418 INFO L523 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:16,419 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-05-02 23:03:16,419 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:16,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:16,419 INFO L82 PathProgramCache]: Analyzing trace with hash -198279571, now seen corresponding path program 9 times [2021-05-02 23:03:16,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:16,419 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [904480699] [2021-05-02 23:03:16,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:16,426 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_133 1) v_main_~n~0_39) (= 4 v_main_~i~0_133)) InVars {main_~i~0=v_main_~i~0_133, main_~n~0=v_main_~n~0_39} OutVars{main_~i~0=v_main_~i~0_133, main_~n~0=v_main_~n~0_39} AuxVars[] AssignedVars[] [2021-05-02 23:03:16,427 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:16,440 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:16,442 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:16,451 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:16,453 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:16,455 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:16,464 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_135 1) v_main_~n~0_40) (not (= 4 v_main_~i~0_135))) InVars {main_~i~0=v_main_~i~0_135, main_~n~0=v_main_~n~0_40} OutVars{main_~i~0=v_main_~i~0_135, main_~n~0=v_main_~n~0_40} AuxVars[] AssignedVars[] [2021-05-02 23:03:16,465 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:16,466 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:16,468 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:16,480 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:16,486 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:16,518 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:16,545 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:16,548 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_137 v_main_~n~0_41) (not (= 4 v_main_~i~0_137))) InVars {main_~i~0=v_main_~i~0_137, main_~n~0=v_main_~n~0_41} OutVars{main_~i~0=v_main_~i~0_137, main_~n~0=v_main_~n~0_41} AuxVars[] AssignedVars[] [2021-05-02 23:03:16,550 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:16,565 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:16,566 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:16,575 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:16,581 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:16,596 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:16,642 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_139 v_main_~n~0_42) (= 4 v_main_~i~0_139)) InVars {main_~i~0=v_main_~i~0_139, main_~n~0=v_main_~n~0_42} OutVars{main_~i~0=v_main_~i~0_139, main_~n~0=v_main_~n~0_42} AuxVars[] AssignedVars[] [2021-05-02 23:03:16,643 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:16,644 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:16,646 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:16,657 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:16,659 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:16,670 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:16,678 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:16,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:16,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:03:16,837 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:16,909 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:17,209 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:17,209 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [904480699] [2021-05-02 23:03:17,209 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [904480699] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:17,209 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:17,209 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-05-02 23:03:17,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217253792] [2021-05-02 23:03:17,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-05-02 23:03:17,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:17,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-05-02 23:03:17,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2021-05-02 23:03:17,210 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:17,821 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2021-05-02 23:03:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 23:03:17,821 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-05-02 23:03:17,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:17,822 INFO L225 Difference]: With dead ends: 41 [2021-05-02 23:03:17,822 INFO L226 Difference]: Without dead ends: 36 [2021-05-02 23:03:17,822 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 778.7ms TimeCoverageRelationStatistics Valid=158, Invalid=1564, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 23:03:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-05-02 23:03:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-05-02 23:03:17,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2021-05-02 23:03:17,826 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 32 [2021-05-02 23:03:17,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:17,827 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2021-05-02 23:03:17,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:17,827 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2021-05-02 23:03:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 23:03:17,827 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:17,827 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:17,827 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-05-02 23:03:17,827 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:17,828 INFO L82 PathProgramCache]: Analyzing trace with hash 182743752, now seen corresponding path program 10 times [2021-05-02 23:03:17,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:17,828 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [616657206] [2021-05-02 23:03:17,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:17,837 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_150 1) v_main_~n~0_43) (= 4 v_main_~i~0_150)) InVars {main_~i~0=v_main_~i~0_150, main_~n~0=v_main_~n~0_43} OutVars{main_~i~0=v_main_~i~0_150, main_~n~0=v_main_~n~0_43} AuxVars[] AssignedVars[] [2021-05-02 23:03:17,839 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:17,840 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,841 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,850 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:17,851 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:17,862 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:17,871 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_152)) (<= (+ v_main_~i~0_152 1) v_main_~n~0_44)) InVars {main_~i~0=v_main_~i~0_152, main_~n~0=v_main_~n~0_44} OutVars{main_~i~0=v_main_~i~0_152, main_~n~0=v_main_~n~0_44} AuxVars[] AssignedVars[] [2021-05-02 23:03:17,872 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:17,890 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,892 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,903 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:17,909 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:17,927 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:17,954 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:17,958 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_154)) (<= v_main_~i~0_154 v_main_~n~0_45)) InVars {main_~i~0=v_main_~i~0_154, main_~n~0=v_main_~n~0_45} OutVars{main_~i~0=v_main_~i~0_154, main_~n~0=v_main_~n~0_45} AuxVars[] AssignedVars[] [2021-05-02 23:03:17,965 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:17,984 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,986 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:17,995 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:18,000 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:18,016 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:18,045 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_156) (<= v_main_~i~0_156 v_main_~n~0_46)) InVars {main_~i~0=v_main_~i~0_156, main_~n~0=v_main_~n~0_46} OutVars{main_~i~0=v_main_~i~0_156, main_~n~0=v_main_~n~0_46} AuxVars[] AssignedVars[] [2021-05-02 23:03:18,046 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:18,058 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:18,059 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:18,068 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:18,070 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:18,072 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:18,092 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:18,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:18,159 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:18,229 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:18,512 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:18,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [616657206] [2021-05-02 23:03:18,512 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [616657206] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:18,512 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:18,512 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-05-02 23:03:18,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134219974] [2021-05-02 23:03:18,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-05-02 23:03:18,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:18,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-05-02 23:03:18,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2021-05-02 23:03:18,513 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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:03:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:19,157 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2021-05-02 23:03:19,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-05-02 23:03:19,158 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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:03:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:19,158 INFO L225 Difference]: With dead ends: 46 [2021-05-02 23:03:19,158 INFO L226 Difference]: Without dead ends: 38 [2021-05-02 23:03:19,160 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 744.7ms TimeCoverageRelationStatistics Valid=177, Invalid=1715, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 23:03:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-05-02 23:03:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2021-05-02 23:03:19,172 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:03:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-05-02 23:03:19,173 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2021-05-02 23:03:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:19,173 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-05-02 23:03:19,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 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:03:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-05-02 23:03:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 23:03:19,175 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:19,175 INFO L523 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:19,175 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-05-02 23:03:19,175 INFO L428 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:19,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:19,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1957751114, now seen corresponding path program 11 times [2021-05-02 23:03:19,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:19,176 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [942408637] [2021-05-02 23:03:19,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:19,185 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_167 1) v_main_~n~0_47) (= 4 v_main_~i~0_167)) InVars {main_~i~0=v_main_~i~0_167, main_~n~0=v_main_~n~0_47} OutVars{main_~i~0=v_main_~i~0_167, main_~n~0=v_main_~n~0_47} AuxVars[] AssignedVars[] [2021-05-02 23:03:19,187 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:19,188 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:19,189 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:19,197 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:19,199 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:19,207 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:19,216 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_169 1) v_main_~n~0_48) (not (= 4 v_main_~i~0_169))) InVars {main_~i~0=v_main_~i~0_169, main_~n~0=v_main_~n~0_48} OutVars{main_~i~0=v_main_~i~0_169, main_~n~0=v_main_~n~0_48} AuxVars[] AssignedVars[] [2021-05-02 23:03:19,220 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:19,231 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:19,234 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:19,248 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:19,253 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:19,267 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:19,287 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:19,289 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_171)) (<= v_main_~i~0_171 v_main_~n~0_49)) InVars {main_~i~0=v_main_~i~0_171, main_~n~0=v_main_~n~0_49} OutVars{main_~i~0=v_main_~i~0_171, main_~n~0=v_main_~n~0_49} AuxVars[] AssignedVars[] [2021-05-02 23:03:19,290 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:19,302 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:19,303 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:19,312 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:19,317 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:19,331 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:19,352 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_173) (<= v_main_~i~0_173 v_main_~n~0_50)) InVars {main_~i~0=v_main_~i~0_173, main_~n~0=v_main_~n~0_50} OutVars{main_~i~0=v_main_~i~0_173, main_~n~0=v_main_~n~0_50} AuxVars[] AssignedVars[] [2021-05-02 23:03:19,353 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:19,354 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:19,356 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:19,363 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:19,364 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:19,374 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:19,381 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:19,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:19,454 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:19,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:19,834 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:19,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [942408637] [2021-05-02 23:03:19,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [942408637] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:19,834 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:19,834 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-05-02 23:03:19,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684864851] [2021-05-02 23:03:19,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-05-02 23:03:19,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:19,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-05-02 23:03:19,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2021-05-02 23:03:19,835 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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:03:20,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:20,662 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2021-05-02 23:03:20,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-02 23:03:20,663 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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:03:20,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:20,663 INFO L225 Difference]: With dead ends: 50 [2021-05-02 23:03:20,663 INFO L226 Difference]: Without dead ends: 42 [2021-05-02 23:03:20,664 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 848.4ms TimeCoverageRelationStatistics Valid=200, Invalid=2152, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:03:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-05-02 23:03:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-05-02 23:03:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 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:03:20,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2021-05-02 23:03:20,668 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 35 [2021-05-02 23:03:20,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:20,668 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2021-05-02 23:03:20,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 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:03:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2021-05-02 23:03:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-02 23:03:20,668 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:20,669 INFO L523 BasicCegarLoop]: trace histogram [9, 9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:20,669 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-05-02 23:03:20,669 INFO L428 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:20,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:20,670 INFO L82 PathProgramCache]: Analyzing trace with hash -743031093, now seen corresponding path program 12 times [2021-05-02 23:03:20,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:20,670 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1185238456] [2021-05-02 23:03:20,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:20,677 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_185) (<= (+ v_main_~i~0_185 1) v_main_~n~0_51)) InVars {main_~i~0=v_main_~i~0_185, main_~n~0=v_main_~n~0_51} OutVars{main_~i~0=v_main_~i~0_185, main_~n~0=v_main_~n~0_51} AuxVars[] AssignedVars[] [2021-05-02 23:03:20,679 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:20,680 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:20,681 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:20,689 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:20,691 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:20,701 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:20,709 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_187 1) v_main_~n~0_52) (not (= 4 v_main_~i~0_187))) InVars {main_~i~0=v_main_~i~0_187, main_~n~0=v_main_~n~0_52} OutVars{main_~i~0=v_main_~i~0_187, main_~n~0=v_main_~n~0_52} AuxVars[] AssignedVars[] [2021-05-02 23:03:20,710 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:20,723 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:20,724 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:20,736 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:20,742 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:20,760 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:20,785 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:20,786 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_189)) (<= v_main_~i~0_189 v_main_~n~0_53)) InVars {main_~i~0=v_main_~i~0_189, main_~n~0=v_main_~n~0_53} OutVars{main_~i~0=v_main_~i~0_189, main_~n~0=v_main_~n~0_53} AuxVars[] AssignedVars[] [2021-05-02 23:03:20,788 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:20,802 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:20,803 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:20,813 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:20,819 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:20,836 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:20,863 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_191) (<= v_main_~i~0_191 v_main_~n~0_54)) InVars {main_~i~0=v_main_~i~0_191, main_~n~0=v_main_~n~0_54} OutVars{main_~i~0=v_main_~i~0_191, main_~n~0=v_main_~n~0_54} AuxVars[] AssignedVars[] [2021-05-02 23:03:20,864 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:20,878 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:20,880 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:20,891 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:20,893 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:20,895 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:20,903 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:20,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:20,969 INFO 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:03:20,971 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:21,323 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:21,323 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1185238456] [2021-05-02 23:03:21,323 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1185238456] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:21,323 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:21,323 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-05-02 23:03:21,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36143317] [2021-05-02 23:03:21,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-05-02 23:03:21,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:21,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-05-02 23:03:21,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2021-05-02 23:03:21,324 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:22,051 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2021-05-02 23:03:22,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-05-02 23:03:22,051 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2021-05-02 23:03:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:22,052 INFO L225 Difference]: With dead ends: 50 [2021-05-02 23:03:22,052 INFO L226 Difference]: Without dead ends: 42 [2021-05-02 23:03:22,053 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 814.6ms TimeCoverageRelationStatistics Valid=203, Invalid=2149, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:03:22,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-05-02 23:03:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-05-02 23:03:22,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.054054054054054) internal successors, (39), 37 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:22,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2021-05-02 23:03:22,057 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 38 [2021-05-02 23:03:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:22,057 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2021-05-02 23:03:22,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 26 states, 25 states have (on average 1.36) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2021-05-02 23:03:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-02 23:03:22,057 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:22,058 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:22,058 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-05-02 23:03:22,058 INFO L428 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:22,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:22,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1778536424, now seen corresponding path program 13 times [2021-05-02 23:03:22,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:22,058 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1370697621] [2021-05-02 23:03:22,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:22,066 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_203) (<= (+ v_main_~i~0_203 1) v_main_~n~0_55)) InVars {main_~i~0=v_main_~i~0_203, main_~n~0=v_main_~n~0_55} OutVars{main_~i~0=v_main_~i~0_203, main_~n~0=v_main_~n~0_55} AuxVars[] AssignedVars[] [2021-05-02 23:03:22,067 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:22,079 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,081 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,090 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:22,092 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:22,094 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:22,109 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_205)) (<= (+ v_main_~i~0_205 1) v_main_~n~0_56)) InVars {main_~i~0=v_main_~i~0_205, main_~n~0=v_main_~n~0_56} OutVars{main_~i~0=v_main_~i~0_205, main_~n~0=v_main_~n~0_56} AuxVars[] AssignedVars[] [2021-05-02 23:03:22,110 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:22,125 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,127 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,139 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:22,146 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:22,163 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:22,188 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:22,190 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_207 v_main_~n~0_57) (not (= 4 v_main_~i~0_207))) InVars {main_~i~0=v_main_~i~0_207, main_~n~0=v_main_~n~0_57} OutVars{main_~i~0=v_main_~i~0_207, main_~n~0=v_main_~n~0_57} AuxVars[] AssignedVars[] [2021-05-02 23:03:22,193 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:22,194 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,203 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,213 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:22,218 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:22,244 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:22,266 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_209 v_main_~n~0_58) (= 4 v_main_~i~0_209)) InVars {main_~i~0=v_main_~i~0_209, main_~n~0=v_main_~n~0_58} OutVars{main_~i~0=v_main_~i~0_209, main_~n~0=v_main_~n~0_58} AuxVars[] AssignedVars[] [2021-05-02 23:03:22,268 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:22,279 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,281 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:22,290 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:22,291 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:22,293 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:22,305 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:22,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:22,368 INFO 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:03:22,371 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:22,441 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:22,800 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:22,800 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1370697621] [2021-05-02 23:03:22,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1370697621] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:22,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:22,800 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-05-02 23:03:22,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747798729] [2021-05-02 23:03:22,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-05-02 23:03:22,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:22,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-05-02 23:03:22,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2021-05-02 23:03:22,801 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 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:03:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:23,626 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2021-05-02 23:03:23,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-05-02 23:03:23,627 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 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:03:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:23,627 INFO L225 Difference]: With dead ends: 52 [2021-05-02 23:03:23,627 INFO L226 Difference]: Without dead ends: 44 [2021-05-02 23:03:23,628 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 935.4ms TimeCoverageRelationStatistics Valid=215, Invalid=2437, Unknown=0, NotChecked=0, Total=2652 [2021-05-02 23:03:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-05-02 23:03:23,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2021-05-02 23:03:23,631 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:03:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-05-02 23:03:23,632 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2021-05-02 23:03:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:23,632 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-05-02 23:03:23,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 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:03:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-05-02 23:03:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-02 23:03:23,634 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:23,634 INFO L523 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:23,634 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-05-02 23:03:23,634 INFO L428 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:23,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:23,634 INFO L82 PathProgramCache]: Analyzing trace with hash -741423510, now seen corresponding path program 14 times [2021-05-02 23:03:23,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:23,635 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1793146517] [2021-05-02 23:03:23,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:23,640 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_222 1) v_main_~n~0_59) (= 4 v_main_~i~0_222)) InVars {main_~i~0=v_main_~i~0_222, main_~n~0=v_main_~n~0_59} OutVars{main_~i~0=v_main_~i~0_222, main_~n~0=v_main_~n~0_59} AuxVars[] AssignedVars[] [2021-05-02 23:03:23,641 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:23,642 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:23,648 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:23,656 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:23,658 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:23,668 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:23,685 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_224)) (<= (+ v_main_~i~0_224 1) v_main_~n~0_60)) InVars {main_~i~0=v_main_~i~0_224, main_~n~0=v_main_~n~0_60} OutVars{main_~i~0=v_main_~i~0_224, main_~n~0=v_main_~n~0_60} AuxVars[] AssignedVars[] [2021-05-02 23:03:23,687 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:23,688 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:23,689 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:23,700 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:23,705 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:23,730 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:23,756 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:23,758 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_226 v_main_~n~0_61) (not (= 4 v_main_~i~0_226))) InVars {main_~i~0=v_main_~i~0_226, main_~n~0=v_main_~n~0_61} OutVars{main_~i~0=v_main_~i~0_226, main_~n~0=v_main_~n~0_61} AuxVars[] AssignedVars[] [2021-05-02 23:03:23,759 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:23,771 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:23,774 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:23,783 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:23,789 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:23,804 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:23,826 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_228) (<= v_main_~i~0_228 v_main_~n~0_62)) InVars {main_~i~0=v_main_~i~0_228, main_~n~0=v_main_~n~0_62} OutVars{main_~i~0=v_main_~i~0_228, main_~n~0=v_main_~n~0_62} AuxVars[] AssignedVars[] [2021-05-02 23:03:23,828 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:23,828 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:23,831 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:23,838 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:23,840 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:23,850 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:23,857 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:23,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:23,951 INFO 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:03:23,953 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:24,022 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:24,434 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:24,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1793146517] [2021-05-02 23:03:24,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1793146517] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:24,435 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:24,435 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2021-05-02 23:03:24,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442396594] [2021-05-02 23:03:24,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-05-02 23:03:24,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:24,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-05-02 23:03:24,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2021-05-02 23:03:24,436 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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:03:25,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:25,294 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2021-05-02 23:03:25,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-02 23:03:25,294 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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:03:25,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:25,295 INFO L225 Difference]: With dead ends: 50 [2021-05-02 23:03:25,295 INFO L226 Difference]: Without dead ends: 45 [2021-05-02 23:03:25,295 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1019.9ms TimeCoverageRelationStatistics Valid=210, Invalid=2652, Unknown=0, NotChecked=0, Total=2862 [2021-05-02 23:03:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-05-02 23:03:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-05-02 23:03:25,299 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:03:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-05-02 23:03:25,300 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 41 [2021-05-02 23:03:25,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:25,300 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-05-02 23:03:25,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 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:03:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-05-02 23:03:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-02 23:03:25,300 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:25,300 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:25,300 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-05-02 23:03:25,300 INFO L428 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:25,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:25,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1476538965, now seen corresponding path program 15 times [2021-05-02 23:03:25,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:25,301 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1684082919] [2021-05-02 23:03:25,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:25,308 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_242 1) v_main_~n~0_63) (= 4 v_main_~i~0_242)) InVars {main_~i~0=v_main_~i~0_242, main_~n~0=v_main_~n~0_63} OutVars{main_~i~0=v_main_~i~0_242, main_~n~0=v_main_~n~0_63} AuxVars[] AssignedVars[] [2021-05-02 23:03:25,309 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:25,321 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:25,323 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:25,331 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:25,333 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:25,334 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:25,343 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_244)) (<= (+ v_main_~i~0_244 1) v_main_~n~0_64)) InVars {main_~i~0=v_main_~i~0_244, main_~n~0=v_main_~n~0_64} OutVars{main_~i~0=v_main_~i~0_244, main_~n~0=v_main_~n~0_64} AuxVars[] AssignedVars[] [2021-05-02 23:03:25,344 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:25,356 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:25,357 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:25,366 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:25,372 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:25,387 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:25,411 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:25,413 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_246 v_main_~n~0_65) (not (= 4 v_main_~i~0_246))) InVars {main_~i~0=v_main_~i~0_246, main_~n~0=v_main_~n~0_65} OutVars{main_~i~0=v_main_~i~0_246, main_~n~0=v_main_~n~0_65} AuxVars[] AssignedVars[] [2021-05-02 23:03:25,415 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:25,416 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:25,417 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:25,426 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:25,432 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:25,457 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:25,482 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_248 v_main_~n~0_66) (= 4 v_main_~i~0_248)) InVars {main_~i~0=v_main_~i~0_248, main_~n~0=v_main_~n~0_66} OutVars{main_~i~0=v_main_~i~0_248, main_~n~0=v_main_~n~0_66} AuxVars[] AssignedVars[] [2021-05-02 23:03:25,483 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:25,484 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:25,485 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:25,492 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:25,494 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:25,504 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:25,511 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:25,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:25,613 INFO 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:03:25,615 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:25,692 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:26,125 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:26,125 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1684082919] [2021-05-02 23:03:26,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1684082919] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:26,125 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:26,125 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-05-02 23:03:26,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506909919] [2021-05-02 23:03:26,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-05-02 23:03:26,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:26,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-05-02 23:03:26,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2021-05-02 23:03:26,126 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:27,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:27,098 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2021-05-02 23:03:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-05-02 23:03:27,098 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-05-02 23:03:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:27,099 INFO L225 Difference]: With dead ends: 55 [2021-05-02 23:03:27,099 INFO L226 Difference]: Without dead ends: 47 [2021-05-02 23:03:27,100 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 1094.5ms TimeCoverageRelationStatistics Valid=214, Invalid=2866, Unknown=0, NotChecked=0, Total=3080 [2021-05-02 23:03:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-02 23:03:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-05-02 23:03:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2021-05-02 23:03:27,104 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2021-05-02 23:03:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:27,104 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2021-05-02 23:03:27,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 28 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2021-05-02 23:03:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-02 23:03:27,104 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:27,104 INFO L523 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:27,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-05-02 23:03:27,104 INFO L428 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:27,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash 298468397, now seen corresponding path program 16 times [2021-05-02 23:03:27,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:27,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [364241920] [2021-05-02 23:03:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:27,119 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_262) (<= (+ v_main_~i~0_262 1) v_main_~n~0_67)) InVars {main_~i~0=v_main_~i~0_262, main_~n~0=v_main_~n~0_67} OutVars{main_~i~0=v_main_~i~0_262, main_~n~0=v_main_~n~0_67} AuxVars[] AssignedVars[] [2021-05-02 23:03:27,120 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:27,132 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,133 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,142 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:27,144 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:27,146 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:27,156 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_264)) (<= (+ v_main_~i~0_264 1) v_main_~n~0_68)) InVars {main_~i~0=v_main_~i~0_264, main_~n~0=v_main_~n~0_68} OutVars{main_~i~0=v_main_~i~0_264, main_~n~0=v_main_~n~0_68} AuxVars[] AssignedVars[] [2021-05-02 23:03:27,157 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:27,158 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,159 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,169 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:27,175 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:27,206 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:27,232 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:27,234 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_266)) (<= v_main_~i~0_266 v_main_~n~0_69)) InVars {main_~i~0=v_main_~i~0_266, main_~n~0=v_main_~n~0_69} OutVars{main_~i~0=v_main_~i~0_266, main_~n~0=v_main_~n~0_69} AuxVars[] AssignedVars[] [2021-05-02 23:03:27,237 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:27,238 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,240 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,251 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:27,257 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:27,286 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:27,309 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_268) (<= v_main_~i~0_268 v_main_~n~0_70)) InVars {main_~i~0=v_main_~i~0_268, main_~n~0=v_main_~n~0_70} OutVars{main_~i~0=v_main_~i~0_268, main_~n~0=v_main_~n~0_70} AuxVars[] AssignedVars[] [2021-05-02 23:03:27,310 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:27,324 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,326 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:27,336 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:27,338 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:27,340 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:27,348 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:27,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:27,474 INFO 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:03:27,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:27,976 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:27,976 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [364241920] [2021-05-02 23:03:27,976 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [364241920] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:27,976 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:27,976 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-05-02 23:03:27,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057239038] [2021-05-02 23:03:27,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-02 23:03:27,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:27,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-02 23:03:27,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2021-05-02 23:03:27,977 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 29 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:28,939 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2021-05-02 23:03:28,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-05-02 23:03:28,939 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 29 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2021-05-02 23:03:28,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:28,939 INFO L225 Difference]: With dead ends: 53 [2021-05-02 23:03:28,939 INFO L226 Difference]: Without dead ends: 48 [2021-05-02 23:03:28,940 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1153.9ms TimeCoverageRelationStatistics Valid=209, Invalid=3097, Unknown=0, NotChecked=0, Total=3306 [2021-05-02 23:03:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-05-02 23:03:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-05-02 23:03:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 43 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2021-05-02 23:03:28,944 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 44 [2021-05-02 23:03:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:28,944 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2021-05-02 23:03:28,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 29 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:28,945 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2021-05-02 23:03:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 23:03:28,945 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:28,945 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:28,945 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2021-05-02 23:03:28,945 INFO L428 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:28,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:28,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1655843576, now seen corresponding path program 17 times [2021-05-02 23:03:28,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:28,945 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938738821] [2021-05-02 23:03:28,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:28,953 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_283) (<= (+ v_main_~i~0_283 1) v_main_~n~0_71)) InVars {main_~i~0=v_main_~i~0_283, main_~n~0=v_main_~n~0_71} OutVars{main_~i~0=v_main_~i~0_283, main_~n~0=v_main_~n~0_71} AuxVars[] AssignedVars[] [2021-05-02 23:03:28,954 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:28,966 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:28,968 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:28,977 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:28,978 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:28,980 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:28,988 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_285)) (<= (+ v_main_~i~0_285 1) v_main_~n~0_72)) InVars {main_~i~0=v_main_~i~0_285, main_~n~0=v_main_~n~0_72} OutVars{main_~i~0=v_main_~i~0_285, main_~n~0=v_main_~n~0_72} AuxVars[] AssignedVars[] [2021-05-02 23:03:28,990 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:29,002 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:29,003 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:29,014 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:29,019 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:29,034 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:29,054 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:29,056 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_287)) (<= v_main_~i~0_287 v_main_~n~0_73)) InVars {main_~i~0=v_main_~i~0_287, main_~n~0=v_main_~n~0_73} OutVars{main_~i~0=v_main_~i~0_287, main_~n~0=v_main_~n~0_73} AuxVars[] AssignedVars[] [2021-05-02 23:03:29,057 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:29,058 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:29,059 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:29,070 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:29,076 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:29,104 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:29,127 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_289 v_main_~n~0_74) (= 4 v_main_~i~0_289)) InVars {main_~i~0=v_main_~i~0_289, main_~n~0=v_main_~n~0_74} OutVars{main_~i~0=v_main_~i~0_289, main_~n~0=v_main_~n~0_74} AuxVars[] AssignedVars[] [2021-05-02 23:03:29,128 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:29,129 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:29,130 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:29,137 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:29,139 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:29,149 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:29,169 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:29,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:29,235 INFO 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:03:29,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:29,308 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:29,786 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:29,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [938738821] [2021-05-02 23:03:29,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [938738821] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:29,786 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:29,786 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2021-05-02 23:03:29,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800186387] [2021-05-02 23:03:29,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 23:03:29,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:29,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 23:03:29,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2021-05-02 23:03:29,787 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 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:03:30,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:30,826 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2021-05-02 23:03:30,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-05-02 23:03:30,827 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 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:03:30,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:30,827 INFO L225 Difference]: With dead ends: 58 [2021-05-02 23:03:30,827 INFO L226 Difference]: Without dead ends: 50 [2021-05-02 23:03:30,828 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1158.8ms TimeCoverageRelationStatistics Valid=243, Invalid=3297, Unknown=0, NotChecked=0, Total=3540 [2021-05-02 23:03:30,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-05-02 23:03:30,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2021-05-02 23:03:30,832 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:03:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2021-05-02 23:03:30,832 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2021-05-02 23:03:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:30,832 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2021-05-02 23:03:30,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 30 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:03:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2021-05-02 23:03:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-05-02 23:03:30,833 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:30,833 INFO L523 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:30,833 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2021-05-02 23:03:30,833 INFO L428 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:30,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:30,833 INFO L82 PathProgramCache]: Analyzing trace with hash 119163786, now seen corresponding path program 18 times [2021-05-02 23:03:30,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:30,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [449729137] [2021-05-02 23:03:30,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:30,839 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_304) (<= (+ v_main_~i~0_304 1) v_main_~n~0_75)) InVars {main_~i~0=v_main_~i~0_304, main_~n~0=v_main_~n~0_75} OutVars{main_~i~0=v_main_~i~0_304, main_~n~0=v_main_~n~0_75} AuxVars[] AssignedVars[] [2021-05-02 23:03:30,840 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:30,841 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:30,842 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:30,852 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:30,854 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:30,865 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:30,874 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_306 1) v_main_~n~0_76) (not (= 4 v_main_~i~0_306))) InVars {main_~i~0=v_main_~i~0_306, main_~n~0=v_main_~n~0_76} OutVars{main_~i~0=v_main_~i~0_306, main_~n~0=v_main_~n~0_76} AuxVars[] AssignedVars[] [2021-05-02 23:03:30,875 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:30,876 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:30,887 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:30,897 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:30,903 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:30,930 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:30,954 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:30,965 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_308 v_main_~n~0_77) (not (= 4 v_main_~i~0_308))) InVars {main_~i~0=v_main_~i~0_308, main_~n~0=v_main_~n~0_77} OutVars{main_~i~0=v_main_~i~0_308, main_~n~0=v_main_~n~0_77} AuxVars[] AssignedVars[] [2021-05-02 23:03:30,967 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:30,982 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:30,983 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:30,995 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:31,002 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:31,022 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:31,049 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_310) (<= v_main_~i~0_310 v_main_~n~0_78)) InVars {main_~i~0=v_main_~i~0_310, main_~n~0=v_main_~n~0_78} OutVars{main_~i~0=v_main_~i~0_310, main_~n~0=v_main_~n~0_78} AuxVars[] AssignedVars[] [2021-05-02 23:03:31,051 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:31,051 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:31,053 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:31,062 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:31,064 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:31,076 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:31,084 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:31,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:31,167 INFO 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:03:31,169 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:31,755 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:31,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [449729137] [2021-05-02 23:03:31,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [449729137] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:31,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:31,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2021-05-02 23:03:31,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583045800] [2021-05-02 23:03:31,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-05-02 23:03:31,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:31,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-05-02 23:03:31,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2021-05-02 23:03:31,756 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 31 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:03:32,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:32,883 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2021-05-02 23:03:32,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-05-02 23:03:32,883 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.34375) internal successors, (43), 31 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:03:32,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:32,883 INFO L225 Difference]: With dead ends: 56 [2021-05-02 23:03:32,884 INFO L226 Difference]: Without dead ends: 51 [2021-05-02 23:03:32,884 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898 ImplicationChecksByTransitivity, 1291.2ms TimeCoverageRelationStatistics Valid=232, Invalid=3550, Unknown=0, NotChecked=0, Total=3782 [2021-05-02 23:03:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-05-02 23:03:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-05-02 23:03:32,888 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:03:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2021-05-02 23:03:32,889 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 47 [2021-05-02 23:03:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:32,889 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2021-05-02 23:03:32,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 33 states, 32 states have (on average 1.34375) internal successors, (43), 31 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:03:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2021-05-02 23:03:32,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-05-02 23:03:32,889 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:32,890 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:32,890 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-05-02 23:03:32,890 INFO L428 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:32,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:32,890 INFO L82 PathProgramCache]: Analyzing trace with hash -380193653, now seen corresponding path program 19 times [2021-05-02 23:03:32,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:32,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [37454808] [2021-05-02 23:03:32,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:32,897 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_326) (<= (+ v_main_~i~0_326 1) v_main_~n~0_79)) InVars {main_~i~0=v_main_~i~0_326, main_~n~0=v_main_~n~0_79} OutVars{main_~i~0=v_main_~i~0_326, main_~n~0=v_main_~n~0_79} AuxVars[] AssignedVars[] [2021-05-02 23:03:32,898 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:32,899 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:32,901 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:32,914 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:32,916 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:32,926 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:32,935 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_328 1) v_main_~n~0_80) (not (= 4 v_main_~i~0_328))) InVars {main_~i~0=v_main_~i~0_328, main_~n~0=v_main_~n~0_80} OutVars{main_~i~0=v_main_~i~0_328, main_~n~0=v_main_~n~0_80} AuxVars[] AssignedVars[] [2021-05-02 23:03:32,937 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:32,938 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:32,939 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:32,949 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:32,955 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:32,986 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:33,012 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:33,014 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_330)) (<= v_main_~i~0_330 v_main_~n~0_81)) InVars {main_~i~0=v_main_~i~0_330, main_~n~0=v_main_~n~0_81} OutVars{main_~i~0=v_main_~i~0_330, main_~n~0=v_main_~n~0_81} AuxVars[] AssignedVars[] [2021-05-02 23:03:33,017 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:33,030 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:33,031 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:33,042 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:33,052 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:33,070 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:33,093 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_332 v_main_~n~0_82) (= 4 v_main_~i~0_332)) InVars {main_~i~0=v_main_~i~0_332, main_~n~0=v_main_~n~0_82} OutVars{main_~i~0=v_main_~i~0_332, main_~n~0=v_main_~n~0_82} AuxVars[] AssignedVars[] [2021-05-02 23:03:33,094 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:33,095 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:33,097 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:33,104 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:33,106 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:33,123 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:33,130 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:33,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:33,191 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:33,262 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:33,755 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:33,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [37454808] [2021-05-02 23:03:33,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [37454808] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:33,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:33,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2021-05-02 23:03:33,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141674341] [2021-05-02 23:03:33,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-05-02 23:03:33,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:33,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-05-02 23:03:33,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1218, Unknown=0, NotChecked=0, Total=1332 [2021-05-02 23:03:33,757 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 32 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:34,887 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2021-05-02 23:03:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-05-02 23:03:34,887 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 32 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-05-02 23:03:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:34,888 INFO L225 Difference]: With dead ends: 61 [2021-05-02 23:03:34,888 INFO L226 Difference]: Without dead ends: 53 [2021-05-02 23:03:34,889 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1237.9ms TimeCoverageRelationStatistics Valid=257, Invalid=3775, Unknown=0, NotChecked=0, Total=4032 [2021-05-02 23:03:34,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-02 23:03:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2021-05-02 23:03:34,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2021-05-02 23:03:34,893 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2021-05-02 23:03:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:34,893 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2021-05-02 23:03:34,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 32 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2021-05-02 23:03:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-05-02 23:03:34,894 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:34,894 INFO L523 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:34,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-05-02 23:03:34,894 INFO L428 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:34,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:34,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1394813709, now seen corresponding path program 20 times [2021-05-02 23:03:34,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:34,894 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1362218763] [2021-05-02 23:03:34,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:34,899 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_348 1) v_main_~n~0_83) (= 4 v_main_~i~0_348)) InVars {main_~i~0=v_main_~i~0_348, main_~n~0=v_main_~n~0_83} OutVars{main_~i~0=v_main_~i~0_348, main_~n~0=v_main_~n~0_83} AuxVars[] AssignedVars[] [2021-05-02 23:03:34,900 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:34,901 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:34,902 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:34,911 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:34,913 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:34,923 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:34,931 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_350)) (<= (+ v_main_~i~0_350 1) v_main_~n~0_84)) InVars {main_~i~0=v_main_~i~0_350, main_~n~0=v_main_~n~0_84} OutVars{main_~i~0=v_main_~i~0_350, main_~n~0=v_main_~n~0_84} AuxVars[] AssignedVars[] [2021-05-02 23:03:34,933 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:34,934 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:34,935 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:34,947 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:34,952 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:34,982 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:35,006 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:35,008 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_352)) (<= v_main_~i~0_352 v_main_~n~0_85)) InVars {main_~i~0=v_main_~i~0_352, main_~n~0=v_main_~n~0_85} OutVars{main_~i~0=v_main_~i~0_352, main_~n~0=v_main_~n~0_85} AuxVars[] AssignedVars[] [2021-05-02 23:03:35,009 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:35,010 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:35,012 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:35,024 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:35,030 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:35,065 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:35,092 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_354 v_main_~n~0_86) (= 4 v_main_~i~0_354)) InVars {main_~i~0=v_main_~i~0_354, main_~n~0=v_main_~n~0_86} OutVars{main_~i~0=v_main_~i~0_354, main_~n~0=v_main_~n~0_86} AuxVars[] AssignedVars[] [2021-05-02 23:03:35,093 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:35,094 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:35,095 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:35,106 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:35,108 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:35,119 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:35,128 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:35,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:35,240 INFO 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:03:35,242 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:35,870 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:35,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1362218763] [2021-05-02 23:03:35,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1362218763] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:35,870 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:35,870 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2021-05-02 23:03:35,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7113742] [2021-05-02 23:03:35,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-05-02 23:03:35,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:35,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-05-02 23:03:35,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1306, Unknown=0, NotChecked=0, Total=1406 [2021-05-02 23:03:35,871 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:37,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:37,091 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2021-05-02 23:03:37,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-05-02 23:03:37,091 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-05-02 23:03:37,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:37,093 INFO L225 Difference]: With dead ends: 59 [2021-05-02 23:03:37,093 INFO L226 Difference]: Without dead ends: 54 [2021-05-02 23:03:37,094 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 1433.5ms TimeCoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290 [2021-05-02 23:03:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-05-02 23:03:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-05-02 23:03:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 49 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2021-05-02 23:03:37,100 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 50 [2021-05-02 23:03:37,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:37,100 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2021-05-02 23:03:37,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2021-05-02 23:03:37,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-02 23:03:37,100 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:37,100 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:37,100 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-05-02 23:03:37,100 INFO L428 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:37,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:37,101 INFO L82 PathProgramCache]: Analyzing trace with hash 636027432, now seen corresponding path program 21 times [2021-05-02 23:03:37,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:37,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [614495201] [2021-05-02 23:03:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:37,109 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_371) (<= (+ v_main_~i~0_371 1) v_main_~n~0_87)) InVars {main_~i~0=v_main_~i~0_371, main_~n~0=v_main_~n~0_87} OutVars{main_~i~0=v_main_~i~0_371, main_~n~0=v_main_~n~0_87} AuxVars[] AssignedVars[] [2021-05-02 23:03:37,110 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:37,111 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:37,112 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:37,121 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:37,122 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:37,133 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:37,142 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_373 1) v_main_~n~0_88) (not (= 4 v_main_~i~0_373))) InVars {main_~i~0=v_main_~i~0_373, main_~n~0=v_main_~n~0_88} OutVars{main_~i~0=v_main_~i~0_373, main_~n~0=v_main_~n~0_88} AuxVars[] AssignedVars[] [2021-05-02 23:03:37,143 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:37,156 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:37,161 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:37,171 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:37,176 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:37,191 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:37,212 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:37,214 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_375)) (<= v_main_~i~0_375 v_main_~n~0_89)) InVars {main_~i~0=v_main_~i~0_375, main_~n~0=v_main_~n~0_89} OutVars{main_~i~0=v_main_~i~0_375, main_~n~0=v_main_~n~0_89} AuxVars[] AssignedVars[] [2021-05-02 23:03:37,215 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:37,216 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:37,217 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:37,227 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:37,232 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:37,258 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:37,281 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_377) (<= v_main_~i~0_377 v_main_~n~0_90)) InVars {main_~i~0=v_main_~i~0_377, main_~n~0=v_main_~n~0_90} OutVars{main_~i~0=v_main_~i~0_377, main_~n~0=v_main_~n~0_90} AuxVars[] AssignedVars[] [2021-05-02 23:03:37,282 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:37,283 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:37,284 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:37,293 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:37,295 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:37,308 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:37,316 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:37,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:37,378 INFO 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:03:37,380 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:37,458 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:38,047 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:38,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [614495201] [2021-05-02 23:03:38,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [614495201] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:38,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:38,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-05-02 23:03:38,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144809380] [2021-05-02 23:03:38,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-05-02 23:03:38,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:38,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-05-02 23:03:38,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1363, Unknown=0, NotChecked=0, Total=1482 [2021-05-02 23:03:38,049 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 36 states, 35 states have (on average 1.4) internal successors, (49), 34 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:03:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:39,322 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2021-05-02 23:03:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-05-02 23:03:39,323 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.4) internal successors, (49), 34 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:03:39,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:39,323 INFO L225 Difference]: With dead ends: 64 [2021-05-02 23:03:39,323 INFO L226 Difference]: Without dead ends: 56 [2021-05-02 23:03:39,323 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1410.3ms TimeCoverageRelationStatistics Valid=271, Invalid=4285, Unknown=0, NotChecked=0, Total=4556 [2021-05-02 23:03:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-05-02 23:03:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2021-05-02 23:03:39,328 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:03:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-05-02 23:03:39,328 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2021-05-02 23:03:39,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:39,329 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-05-02 23:03:39,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 36 states, 35 states have (on average 1.4) internal successors, (49), 34 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:03:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-05-02 23:03:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-05-02 23:03:39,329 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:39,329 INFO L523 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:39,329 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-05-02 23:03:39,329 INFO L428 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:39,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:39,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1883932502, now seen corresponding path program 22 times [2021-05-02 23:03:39,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:39,330 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [811639021] [2021-05-02 23:03:39,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:39,336 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_394) (<= (+ v_main_~i~0_394 1) v_main_~n~0_91)) InVars {main_~i~0=v_main_~i~0_394, main_~n~0=v_main_~n~0_91} OutVars{main_~i~0=v_main_~i~0_394, main_~n~0=v_main_~n~0_91} AuxVars[] AssignedVars[] [2021-05-02 23:03:39,340 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:39,353 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:39,354 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:39,363 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:39,364 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:39,366 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:39,375 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_396 1) v_main_~n~0_92) (not (= 4 v_main_~i~0_396))) InVars {main_~i~0=v_main_~i~0_396, main_~n~0=v_main_~n~0_92} OutVars{main_~i~0=v_main_~i~0_396, main_~n~0=v_main_~n~0_92} AuxVars[] AssignedVars[] [2021-05-02 23:03:39,376 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:39,377 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:39,381 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:39,391 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:39,396 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:39,422 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:39,444 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:39,446 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_398)) (<= v_main_~i~0_398 v_main_~n~0_93)) InVars {main_~i~0=v_main_~i~0_398, main_~n~0=v_main_~n~0_93} OutVars{main_~i~0=v_main_~i~0_398, main_~n~0=v_main_~n~0_93} AuxVars[] AssignedVars[] [2021-05-02 23:03:39,447 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:39,448 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:39,449 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:39,458 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:39,464 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:39,490 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:39,513 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_400) (<= v_main_~i~0_400 v_main_~n~0_94)) InVars {main_~i~0=v_main_~i~0_400, main_~n~0=v_main_~n~0_94} OutVars{main_~i~0=v_main_~i~0_400, main_~n~0=v_main_~n~0_94} AuxVars[] AssignedVars[] [2021-05-02 23:03:39,515 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:39,516 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:39,517 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:39,526 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:39,528 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:39,551 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:39,558 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:39,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:39,638 INFO 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:03:39,641 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:39,722 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:40,394 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:40,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [811639021] [2021-05-02 23:03:40,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [811639021] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:40,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:40,394 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-05-02 23:03:40,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944437688] [2021-05-02 23:03:40,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-05-02 23:03:40,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:40,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-05-02 23:03:40,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1450, Unknown=0, NotChecked=0, Total=1560 [2021-05-02 23:03:40,395 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 35 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:03:41,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:41,864 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2021-05-02 23:03:41,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-05-02 23:03:41,865 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 35 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:03:41,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:41,868 INFO L225 Difference]: With dead ends: 62 [2021-05-02 23:03:41,868 INFO L226 Difference]: Without dead ends: 57 [2021-05-02 23:03:41,869 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 1634.0ms TimeCoverageRelationStatistics Valid=256, Invalid=4574, Unknown=0, NotChecked=0, Total=4830 [2021-05-02 23:03:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-02 23:03:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-05-02 23:03:41,874 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:03:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2021-05-02 23:03:41,874 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 53 [2021-05-02 23:03:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:41,874 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2021-05-02 23:03:41,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 35 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:03:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2021-05-02 23:03:41,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-05-02 23:03:41,874 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:41,875 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:41,875 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-05-02 23:03:41,875 INFO L428 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:41,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:41,875 INFO L82 PathProgramCache]: Analyzing trace with hash -346098837, now seen corresponding path program 23 times [2021-05-02 23:03:41,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:41,875 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2072473699] [2021-05-02 23:03:41,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:41,881 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_418) (<= (+ v_main_~i~0_418 1) v_main_~n~0_95)) InVars {main_~i~0=v_main_~i~0_418, main_~n~0=v_main_~n~0_95} OutVars{main_~i~0=v_main_~i~0_418, main_~n~0=v_main_~n~0_95} AuxVars[] AssignedVars[] [2021-05-02 23:03:41,882 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:41,883 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:41,884 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:41,897 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:41,899 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:41,910 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:41,919 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_420 1) v_main_~n~0_96) (not (= 4 v_main_~i~0_420))) InVars {main_~i~0=v_main_~i~0_420, main_~n~0=v_main_~n~0_96} OutVars{main_~i~0=v_main_~i~0_420, main_~n~0=v_main_~n~0_96} AuxVars[] AssignedVars[] [2021-05-02 23:03:41,924 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:41,938 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:41,940 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:41,950 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:41,956 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:41,973 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:41,996 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:41,997 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_422 v_main_~n~0_97) (not (= 4 v_main_~i~0_422))) InVars {main_~i~0=v_main_~i~0_422, main_~n~0=v_main_~n~0_97} OutVars{main_~i~0=v_main_~i~0_422, main_~n~0=v_main_~n~0_97} AuxVars[] AssignedVars[] [2021-05-02 23:03:41,999 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:42,014 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:42,015 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:42,026 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:42,032 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:42,049 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:42,073 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_424) (<= v_main_~i~0_424 v_main_~n~0_98)) InVars {main_~i~0=v_main_~i~0_424, main_~n~0=v_main_~n~0_98} OutVars{main_~i~0=v_main_~i~0_424, main_~n~0=v_main_~n~0_98} AuxVars[] AssignedVars[] [2021-05-02 23:03:42,074 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:42,075 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:42,078 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:42,087 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:42,100 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:42,111 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:42,119 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:42,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:42,224 INFO 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:03:42,226 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:42,988 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:42,989 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2072473699] [2021-05-02 23:03:42,989 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2072473699] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:42,989 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:42,989 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2021-05-02 23:03:42,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831765472] [2021-05-02 23:03:42,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-05-02 23:03:42,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:42,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-05-02 23:03:42,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1534, Unknown=0, NotChecked=0, Total=1640 [2021-05-02 23:03:42,990 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 38 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 36 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:44,473 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2021-05-02 23:03:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-05-02 23:03:44,474 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 36 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2021-05-02 23:03:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:44,474 INFO L225 Difference]: With dead ends: 67 [2021-05-02 23:03:44,474 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 23:03:44,475 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 1692.1ms TimeCoverageRelationStatistics Valid=251, Invalid=4861, Unknown=0, NotChecked=0, Total=5112 [2021-05-02 23:03:44,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 23:03:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2021-05-02 23:03:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2021-05-02 23:03:44,480 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2021-05-02 23:03:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:44,480 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2021-05-02 23:03:44,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 38 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 36 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2021-05-02 23:03:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-05-02 23:03:44,480 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:44,480 INFO L523 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:44,480 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-05-02 23:03:44,480 INFO L428 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:44,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1428908525, now seen corresponding path program 24 times [2021-05-02 23:03:44,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:44,481 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1953466224] [2021-05-02 23:03:44,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:44,487 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_442 1) v_main_~n~0_99) (= 4 v_main_~i~0_442)) InVars {main_~i~0=v_main_~i~0_442, main_~n~0=v_main_~n~0_99} OutVars{main_~i~0=v_main_~i~0_442, main_~n~0=v_main_~n~0_99} AuxVars[] AssignedVars[] [2021-05-02 23:03:44,488 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:44,489 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:44,490 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:44,499 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:44,500 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:44,511 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:44,520 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_444 1) v_main_~n~0_100) (not (= 4 v_main_~i~0_444))) InVars {main_~i~0=v_main_~i~0_444, main_~n~0=v_main_~n~0_100} OutVars{main_~i~0=v_main_~i~0_444, main_~n~0=v_main_~n~0_100} AuxVars[] AssignedVars[] [2021-05-02 23:03:44,522 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:44,534 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:44,536 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:44,546 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:44,551 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:44,567 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:44,589 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:44,591 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_446 v_main_~n~0_101) (not (= 4 v_main_~i~0_446))) InVars {main_~i~0=v_main_~i~0_446, main_~n~0=v_main_~n~0_101} OutVars{main_~i~0=v_main_~i~0_446, main_~n~0=v_main_~n~0_101} AuxVars[] AssignedVars[] [2021-05-02 23:03:44,592 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:44,605 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:44,606 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:44,616 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:44,621 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:44,637 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:44,661 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_448) (<= v_main_~i~0_448 v_main_~n~0_102)) InVars {main_~i~0=v_main_~i~0_448, main_~n~0=v_main_~n~0_102} OutVars{main_~i~0=v_main_~i~0_448, main_~n~0=v_main_~n~0_102} AuxVars[] AssignedVars[] [2021-05-02 23:03:44,662 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:44,674 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:44,676 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:44,685 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:44,686 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:44,688 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:44,695 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:44,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:44,835 INFO 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:03:44,837 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:44,910 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:45,620 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:45,620 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1953466224] [2021-05-02 23:03:45,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1953466224] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:45,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:45,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2021-05-02 23:03:45,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14850589] [2021-05-02 23:03:45,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-05-02 23:03:45,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:45,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-05-02 23:03:45,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2021-05-02 23:03:45,621 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 37 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:47,129 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2021-05-02 23:03:47,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-05-02 23:03:47,129 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 37 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2021-05-02 23:03:47,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:47,130 INFO L225 Difference]: With dead ends: 65 [2021-05-02 23:03:47,130 INFO L226 Difference]: Without dead ends: 60 [2021-05-02 23:03:47,130 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 1686.1ms TimeCoverageRelationStatistics Valid=280, Invalid=5122, Unknown=0, NotChecked=0, Total=5402 [2021-05-02 23:03:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-05-02 23:03:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-05-02 23:03:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 55 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2021-05-02 23:03:47,135 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 56 [2021-05-02 23:03:47,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:47,135 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2021-05-02 23:03:47,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 37 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2021-05-02 23:03:47,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-02 23:03:47,136 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:47,136 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:47,136 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-05-02 23:03:47,136 INFO L428 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:47,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1552558264, now seen corresponding path program 25 times [2021-05-02 23:03:47,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:47,136 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [91633836] [2021-05-02 23:03:47,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:47,156 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_467) (<= (+ v_main_~i~0_467 1) v_main_~n~0_103)) InVars {main_~i~0=v_main_~i~0_467, main_~n~0=v_main_~n~0_103} OutVars{main_~i~0=v_main_~i~0_467, main_~n~0=v_main_~n~0_103} AuxVars[] AssignedVars[] [2021-05-02 23:03:47,157 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:47,158 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:47,160 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:47,170 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:47,172 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:47,182 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:47,191 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_469 1) v_main_~n~0_104) (not (= 4 v_main_~i~0_469))) InVars {main_~i~0=v_main_~i~0_469, main_~n~0=v_main_~n~0_104} OutVars{main_~i~0=v_main_~i~0_469, main_~n~0=v_main_~n~0_104} AuxVars[] AssignedVars[] [2021-05-02 23:03:47,193 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:47,193 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:47,195 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:47,205 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:47,211 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:47,255 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:47,278 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:47,280 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_471)) (<= v_main_~i~0_471 v_main_~n~0_105)) InVars {main_~i~0=v_main_~i~0_471, main_~n~0=v_main_~n~0_105} OutVars{main_~i~0=v_main_~i~0_471, main_~n~0=v_main_~n~0_105} AuxVars[] AssignedVars[] [2021-05-02 23:03:47,281 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:47,282 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:47,283 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:47,295 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:47,301 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:47,335 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:47,360 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_473) (<= v_main_~i~0_473 v_main_~n~0_106)) InVars {main_~i~0=v_main_~i~0_473, main_~n~0=v_main_~n~0_106} OutVars{main_~i~0=v_main_~i~0_473, main_~n~0=v_main_~n~0_106} AuxVars[] AssignedVars[] [2021-05-02 23:03:47,362 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:47,362 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:47,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:47,373 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:47,375 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:47,387 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:47,395 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:47,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:47,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:48,277 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:48,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [91633836] [2021-05-02 23:03:48,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [91633836] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:48,278 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:48,278 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2021-05-02 23:03:48,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456940646] [2021-05-02 23:03:48,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-05-02 23:03:48,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:48,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-05-02 23:03:48,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1677, Unknown=0, NotChecked=0, Total=1806 [2021-05-02 23:03:48,279 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 40 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 38 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:03:49,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:49,886 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-05-02 23:03:49,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-05-02 23:03:49,886 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 38 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:03:49,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:49,887 INFO L225 Difference]: With dead ends: 70 [2021-05-02 23:03:49,887 INFO L226 Difference]: Without dead ends: 62 [2021-05-02 23:03:49,887 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 1707.3ms TimeCoverageRelationStatistics Valid=299, Invalid=5401, Unknown=0, NotChecked=0, Total=5700 [2021-05-02 23:03:49,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-05-02 23:03:49,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2021-05-02 23:03:49,892 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:03:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2021-05-02 23:03:49,893 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2021-05-02 23:03:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:49,893 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2021-05-02 23:03:49,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 40 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 38 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:03:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2021-05-02 23:03:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-05-02 23:03:49,893 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:49,893 INFO L523 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:49,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-05-02 23:03:49,894 INFO L428 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:49,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:49,894 INFO L82 PathProgramCache]: Analyzing trace with hash 222449098, now seen corresponding path program 26 times [2021-05-02 23:03:49,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:49,894 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [917621413] [2021-05-02 23:03:49,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:49,902 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_492 1) v_main_~n~0_107) (= 4 v_main_~i~0_492)) InVars {main_~i~0=v_main_~i~0_492, main_~n~0=v_main_~n~0_107} OutVars{main_~i~0=v_main_~i~0_492, main_~n~0=v_main_~n~0_107} AuxVars[] AssignedVars[] [2021-05-02 23:03:49,903 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:49,916 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:49,918 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:49,926 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:49,928 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:49,930 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:49,940 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_494 1) v_main_~n~0_108) (not (= 4 v_main_~i~0_494))) InVars {main_~i~0=v_main_~i~0_494, main_~n~0=v_main_~n~0_108} OutVars{main_~i~0=v_main_~i~0_494, main_~n~0=v_main_~n~0_108} AuxVars[] AssignedVars[] [2021-05-02 23:03:49,941 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:49,942 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:49,954 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:49,964 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:49,970 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:49,998 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:50,033 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:50,035 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_496 v_main_~n~0_109) (not (= 4 v_main_~i~0_496))) InVars {main_~i~0=v_main_~i~0_496, main_~n~0=v_main_~n~0_109} OutVars{main_~i~0=v_main_~i~0_496, main_~n~0=v_main_~n~0_109} AuxVars[] AssignedVars[] [2021-05-02 23:03:50,037 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:50,052 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:50,053 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:50,064 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:50,070 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:50,089 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:50,115 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_498) (<= v_main_~i~0_498 v_main_~n~0_110)) InVars {main_~i~0=v_main_~i~0_498, main_~n~0=v_main_~n~0_110} OutVars{main_~i~0=v_main_~i~0_498, main_~n~0=v_main_~n~0_110} AuxVars[] AssignedVars[] [2021-05-02 23:03:50,117 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:50,117 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:50,119 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:50,129 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:50,131 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:50,143 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:50,151 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:50,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:50,234 INFO 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:03:50,236 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:50,316 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:51,073 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:51,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [917621413] [2021-05-02 23:03:51,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [917621413] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:51,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:51,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2021-05-02 23:03:51,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638198278] [2021-05-02 23:03:51,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-05-02 23:03:51,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:51,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-05-02 23:03:51,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1761, Unknown=0, NotChecked=0, Total=1892 [2021-05-02 23:03:51,074 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 39 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:03:52,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:52,735 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2021-05-02 23:03:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-05-02 23:03:52,736 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.375) internal successors, (55), 39 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:03:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:52,736 INFO L225 Difference]: With dead ends: 68 [2021-05-02 23:03:52,736 INFO L226 Difference]: Without dead ends: 63 [2021-05-02 23:03:52,737 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1573 ImplicationChecksByTransitivity, 1810.1ms TimeCoverageRelationStatistics Valid=305, Invalid=5701, Unknown=0, NotChecked=0, Total=6006 [2021-05-02 23:03:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-02 23:03:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-05-02 23:03:52,742 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:03:52,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2021-05-02 23:03:52,742 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 59 [2021-05-02 23:03:52,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:52,742 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2021-05-02 23:03:52,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 41 states, 40 states have (on average 1.375) internal successors, (55), 39 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:03:52,743 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2021-05-02 23:03:52,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-02 23:03:52,743 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:52,743 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:52,743 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-05-02 23:03:52,743 INFO L428 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:52,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:52,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1395952203, now seen corresponding path program 27 times [2021-05-02 23:03:52,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:52,743 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [570816385] [2021-05-02 23:03:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:52,754 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_518 1) v_main_~n~0_111) (= 4 v_main_~i~0_518)) InVars {main_~i~0=v_main_~i~0_518, main_~n~0=v_main_~n~0_111} OutVars{main_~i~0=v_main_~i~0_518, main_~n~0=v_main_~n~0_111} AuxVars[] AssignedVars[] [2021-05-02 23:03:52,756 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:52,768 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:52,770 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:52,779 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:52,781 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:52,782 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:52,791 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_520)) (<= (+ v_main_~i~0_520 1) v_main_~n~0_112)) InVars {main_~i~0=v_main_~i~0_520, main_~n~0=v_main_~n~0_112} OutVars{main_~i~0=v_main_~i~0_520, main_~n~0=v_main_~n~0_112} AuxVars[] AssignedVars[] [2021-05-02 23:03:52,793 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:52,808 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:52,809 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:52,822 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:52,827 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:52,843 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:52,866 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:52,868 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_522 v_main_~n~0_113) (not (= 4 v_main_~i~0_522))) InVars {main_~i~0=v_main_~i~0_522, main_~n~0=v_main_~n~0_113} OutVars{main_~i~0=v_main_~i~0_522, main_~n~0=v_main_~n~0_113} AuxVars[] AssignedVars[] [2021-05-02 23:03:52,869 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:52,870 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:52,871 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:52,881 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:52,887 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:52,915 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:52,946 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_524) (<= v_main_~i~0_524 v_main_~n~0_114)) InVars {main_~i~0=v_main_~i~0_524, main_~n~0=v_main_~n~0_114} OutVars{main_~i~0=v_main_~i~0_524, main_~n~0=v_main_~n~0_114} AuxVars[] AssignedVars[] [2021-05-02 23:03:52,947 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:52,948 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:52,949 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:52,958 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:52,961 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:52,974 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:52,983 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:53,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:03:53,047 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:53,125 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:53,970 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:53,971 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [570816385] [2021-05-02 23:03:53,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [570816385] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:53,971 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:53,971 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2021-05-02 23:03:53,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553772755] [2021-05-02 23:03:53,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-05-02 23:03:53,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:53,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-05-02 23:03:53,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1846, Unknown=0, NotChecked=0, Total=1980 [2021-05-02 23:03:53,972 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 40 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:55,785 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2021-05-02 23:03:55,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-05-02 23:03:55,786 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 40 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2021-05-02 23:03:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:55,786 INFO L225 Difference]: With dead ends: 73 [2021-05-02 23:03:55,786 INFO L226 Difference]: Without dead ends: 65 [2021-05-02 23:03:55,787 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1677 ImplicationChecksByTransitivity, 1891.5ms TimeCoverageRelationStatistics Valid=313, Invalid=6007, Unknown=0, NotChecked=0, Total=6320 [2021-05-02 23:03:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-02 23:03:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-05-02 23:03:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2021-05-02 23:03:55,793 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2021-05-02 23:03:55,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:55,793 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2021-05-02 23:03:55,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 40 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2021-05-02 23:03:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-05-02 23:03:55,793 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:55,793 INFO L523 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:55,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-05-02 23:03:55,793 INFO L428 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:55,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1124007731, now seen corresponding path program 28 times [2021-05-02 23:03:55,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:55,794 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1377835272] [2021-05-02 23:03:55,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:55,800 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_544) (<= (+ v_main_~i~0_544 1) v_main_~n~0_115)) InVars {main_~i~0=v_main_~i~0_544, main_~n~0=v_main_~n~0_115} OutVars{main_~i~0=v_main_~i~0_544, main_~n~0=v_main_~n~0_115} AuxVars[] AssignedVars[] [2021-05-02 23:03:55,801 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:55,802 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:55,803 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:55,812 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:55,813 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:55,823 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:55,832 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_546)) (<= (+ v_main_~i~0_546 1) v_main_~n~0_116)) InVars {main_~i~0=v_main_~i~0_546, main_~n~0=v_main_~n~0_116} OutVars{main_~i~0=v_main_~i~0_546, main_~n~0=v_main_~n~0_116} AuxVars[] AssignedVars[] [2021-05-02 23:03:55,833 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:55,834 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:55,835 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:55,846 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:55,852 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:55,877 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:55,899 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:55,901 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_548)) (<= v_main_~i~0_548 v_main_~n~0_117)) InVars {main_~i~0=v_main_~i~0_548, main_~n~0=v_main_~n~0_117} OutVars{main_~i~0=v_main_~i~0_548, main_~n~0=v_main_~n~0_117} AuxVars[] AssignedVars[] [2021-05-02 23:03:55,902 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:55,903 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:55,904 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:55,915 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:55,920 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:55,945 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:55,969 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_550) (<= v_main_~i~0_550 v_main_~n~0_118)) InVars {main_~i~0=v_main_~i~0_550, main_~n~0=v_main_~n~0_118} OutVars{main_~i~0=v_main_~i~0_550, main_~n~0=v_main_~n~0_118} AuxVars[] AssignedVars[] [2021-05-02 23:03:55,970 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:55,971 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:55,978 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:55,986 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:55,987 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:55,998 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:56,008 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:56,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:56,077 INFO 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:03:56,079 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:03:56,982 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:03:56,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1377835272] [2021-05-02 23:03:56,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1377835272] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:03:56,982 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:03:56,982 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2021-05-02 23:03:56,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206011487] [2021-05-02 23:03:56,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2021-05-02 23:03:56,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:03:56,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-05-02 23:03:56,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1934, Unknown=0, NotChecked=0, Total=2070 [2021-05-02 23:03:56,983 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 41 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:03:58,843 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2021-05-02 23:03:58,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-05-02 23:03:58,843 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 41 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2021-05-02 23:03:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:03:58,844 INFO L225 Difference]: With dead ends: 71 [2021-05-02 23:03:58,844 INFO L226 Difference]: Without dead ends: 66 [2021-05-02 23:03:58,844 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1746 ImplicationChecksByTransitivity, 1977.0ms TimeCoverageRelationStatistics Valid=319, Invalid=6323, Unknown=0, NotChecked=0, Total=6642 [2021-05-02 23:03:58,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-05-02 23:03:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-05-02 23:03:58,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.0327868852459017) internal successors, (63), 61 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2021-05-02 23:03:58,850 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 62 [2021-05-02 23:03:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:03:58,850 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2021-05-02 23:03:58,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 43 states, 42 states have (on average 1.380952380952381) internal successors, (58), 41 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:03:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2021-05-02 23:03:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-02 23:03:58,851 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:03:58,851 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:03:58,851 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2021-05-02 23:03:58,851 INFO L428 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:03:58,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:03:58,851 INFO L82 PathProgramCache]: Analyzing trace with hash -199863192, now seen corresponding path program 29 times [2021-05-02 23:03:58,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:03:58,851 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1979154930] [2021-05-02 23:03:58,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:03:58,857 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_571) (<= (+ v_main_~i~0_571 1) v_main_~n~0_119)) InVars {main_~i~0=v_main_~i~0_571, main_~n~0=v_main_~n~0_119} OutVars{main_~i~0=v_main_~i~0_571, main_~n~0=v_main_~n~0_119} AuxVars[] AssignedVars[] [2021-05-02 23:03:58,859 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:03:58,859 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:58,861 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:58,869 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:58,871 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:58,883 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:03:58,892 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_573)) (<= (+ v_main_~i~0_573 1) v_main_~n~0_120)) InVars {main_~i~0=v_main_~i~0_573, main_~n~0=v_main_~n~0_120} OutVars{main_~i~0=v_main_~i~0_573, main_~n~0=v_main_~n~0_120} AuxVars[] AssignedVars[] [2021-05-02 23:03:58,894 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:03:58,907 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:58,908 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:58,918 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:03:58,924 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:03:58,940 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:03:58,963 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:58,965 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_575)) (<= v_main_~i~0_575 v_main_~n~0_121)) InVars {main_~i~0=v_main_~i~0_575, main_~n~0=v_main_~n~0_121} OutVars{main_~i~0=v_main_~i~0_575, main_~n~0=v_main_~n~0_121} AuxVars[] AssignedVars[] [2021-05-02 23:03:58,966 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:03:58,967 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:58,968 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:58,983 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:03:58,989 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:03:59,016 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:03:59,045 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_577 v_main_~n~0_122) (= 4 v_main_~i~0_577)) InVars {main_~i~0=v_main_~i~0_577, main_~n~0=v_main_~n~0_122} OutVars{main_~i~0=v_main_~i~0_577, main_~n~0=v_main_~n~0_122} AuxVars[] AssignedVars[] [2021-05-02 23:03:59,046 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:03:59,047 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:59,048 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:03:59,057 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:03:59,059 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:03:59,070 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:03:59,077 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:03:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:59,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:03:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:03:59,158 INFO 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:03:59,160 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:00,084 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:00,084 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1979154930] [2021-05-02 23:04:00,084 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1979154930] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:00,084 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:00,084 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2021-05-02 23:04:00,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786681917] [2021-05-02 23:04:00,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-05-02 23:04:00,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:00,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-05-02 23:04:00,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2038, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 23:04:00,085 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 44 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 42 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:04:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:02,051 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-05-02 23:04:02,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-05-02 23:04:02,051 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 42 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:04:02,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:02,051 INFO L225 Difference]: With dead ends: 76 [2021-05-02 23:04:02,052 INFO L226 Difference]: Without dead ends: 68 [2021-05-02 23:04:02,052 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 2105.5ms TimeCoverageRelationStatistics Valid=298, Invalid=6674, Unknown=0, NotChecked=0, Total=6972 [2021-05-02 23:04:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-02 23:04:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2021-05-02 23:04:02,057 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:04:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2021-05-02 23:04:02,058 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2021-05-02 23:04:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:02,058 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2021-05-02 23:04:02,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 44 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 42 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:04:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2021-05-02 23:04:02,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-05-02 23:04:02,058 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:02,058 INFO L523 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:02,058 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-05-02 23:04:02,058 INFO L428 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:02,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:02,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1575144170, now seen corresponding path program 30 times [2021-05-02 23:04:02,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:02,059 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [99386910] [2021-05-02 23:04:02,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:02,065 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_598 1) v_main_~n~0_123) (= 4 v_main_~i~0_598)) InVars {main_~i~0=v_main_~i~0_598, main_~n~0=v_main_~n~0_123} OutVars{main_~i~0=v_main_~i~0_598, main_~n~0=v_main_~n~0_123} AuxVars[] AssignedVars[] [2021-05-02 23:04:02,066 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:04:02,078 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:02,080 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:02,088 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:02,089 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:02,091 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:04:02,100 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_600)) (<= (+ v_main_~i~0_600 1) v_main_~n~0_124)) InVars {main_~i~0=v_main_~i~0_600, main_~n~0=v_main_~n~0_124} OutVars{main_~i~0=v_main_~i~0_600, main_~n~0=v_main_~n~0_124} AuxVars[] AssignedVars[] [2021-05-02 23:04:02,101 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:04:02,114 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:02,115 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:02,125 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:04:02,130 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:04:02,146 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:04:02,168 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:02,170 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_602 v_main_~n~0_125) (not (= 4 v_main_~i~0_602))) InVars {main_~i~0=v_main_~i~0_602, main_~n~0=v_main_~n~0_125} OutVars{main_~i~0=v_main_~i~0_602, main_~n~0=v_main_~n~0_125} AuxVars[] AssignedVars[] [2021-05-02 23:04:02,171 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:04:02,172 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:02,174 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:02,185 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:02,191 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:02,216 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:04:02,240 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_604 v_main_~n~0_126) (= 4 v_main_~i~0_604)) InVars {main_~i~0=v_main_~i~0_604, main_~n~0=v_main_~n~0_126} OutVars{main_~i~0=v_main_~i~0_604, main_~n~0=v_main_~n~0_126} AuxVars[] AssignedVars[] [2021-05-02 23:04:02,241 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:04:02,255 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:02,257 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:02,268 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:02,270 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:02,272 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:04:02,282 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:02,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:02,351 INFO 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:04:02,353 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:02,437 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:03,358 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:03,358 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [99386910] [2021-05-02 23:04:03,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [99386910] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:03,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:03,361 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2021-05-02 23:04:03,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473565336] [2021-05-02 23:04:03,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-05-02 23:04:03,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:03,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-05-02 23:04:03,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2115, Unknown=0, NotChecked=0, Total=2256 [2021-05-02 23:04:03,362 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 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:04:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:05,366 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2021-05-02 23:04:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-05-02 23:04:05,366 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 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:04:05,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:05,367 INFO L225 Difference]: With dead ends: 74 [2021-05-02 23:04:05,367 INFO L226 Difference]: Without dead ends: 69 [2021-05-02 23:04:05,367 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1914 ImplicationChecksByTransitivity, 2134.7ms TimeCoverageRelationStatistics Valid=333, Invalid=6977, Unknown=0, NotChecked=0, Total=7310 [2021-05-02 23:04:05,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-02 23:04:05,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-05-02 23:04:05,373 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:04:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2021-05-02 23:04:05,373 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 65 [2021-05-02 23:04:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:05,374 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2021-05-02 23:04:05,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 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:04:05,374 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2021-05-02 23:04:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-02 23:04:05,374 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:05,374 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 17, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:05,374 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-05-02 23:04:05,374 INFO L428 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:05,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:05,374 INFO L82 PathProgramCache]: Analyzing trace with hash -143296213, now seen corresponding path program 31 times [2021-05-02 23:04:05,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:05,375 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [844277043] [2021-05-02 23:04:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:05,380 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_626 1) v_main_~n~0_127) (= 4 v_main_~i~0_626)) InVars {main_~i~0=v_main_~i~0_626, main_~n~0=v_main_~n~0_127} OutVars{main_~i~0=v_main_~i~0_626, main_~n~0=v_main_~n~0_127} AuxVars[] AssignedVars[] [2021-05-02 23:04:05,381 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:04:05,394 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:05,396 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:05,405 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:05,407 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:05,409 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:04:05,418 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_628)) (<= (+ v_main_~i~0_628 1) v_main_~n~0_128)) InVars {main_~i~0=v_main_~i~0_628, main_~n~0=v_main_~n~0_128} OutVars{main_~i~0=v_main_~i~0_628, main_~n~0=v_main_~n~0_128} AuxVars[] AssignedVars[] [2021-05-02 23:04:05,420 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:04:05,433 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:05,435 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:05,445 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:04:05,451 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:04:05,467 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:04:05,490 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:05,492 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_630 v_main_~n~0_129) (not (= 4 v_main_~i~0_630))) InVars {main_~i~0=v_main_~i~0_630, main_~n~0=v_main_~n~0_129} OutVars{main_~i~0=v_main_~i~0_630, main_~n~0=v_main_~n~0_129} AuxVars[] AssignedVars[] [2021-05-02 23:04:05,494 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:04:05,507 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:05,508 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:05,522 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:05,528 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:05,544 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:04:05,572 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_632 v_main_~n~0_130) (= 4 v_main_~i~0_632)) InVars {main_~i~0=v_main_~i~0_632, main_~n~0=v_main_~n~0_130} OutVars{main_~i~0=v_main_~i~0_632, main_~n~0=v_main_~n~0_130} AuxVars[] AssignedVars[] [2021-05-02 23:04:05,574 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:04:05,574 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:05,575 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:05,584 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:05,586 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:05,596 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:04:05,604 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:05,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:05,676 INFO 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:04:05,678 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:06,655 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:06,655 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [844277043] [2021-05-02 23:04:06,655 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [844277043] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:06,655 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:06,655 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2021-05-02 23:04:06,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941666391] [2021-05-02 23:04:06,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2021-05-02 23:04:06,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:06,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-05-02 23:04:06,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2208, Unknown=0, NotChecked=0, Total=2352 [2021-05-02 23:04:06,656 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 46 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 44 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:08,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:08,692 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2021-05-02 23:04:08,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-05-02 23:04:08,693 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 44 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-05-02 23:04:08,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:08,693 INFO L225 Difference]: With dead ends: 79 [2021-05-02 23:04:08,693 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 23:04:08,693 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1996 ImplicationChecksByTransitivity, 2138.6ms TimeCoverageRelationStatistics Valid=341, Invalid=7315, Unknown=0, NotChecked=0, Total=7656 [2021-05-02 23:04:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 23:04:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2021-05-02 23:04:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2021-05-02 23:04:08,699 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2021-05-02 23:04:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:08,700 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2021-05-02 23:04:08,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 46 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 44 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:08,700 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2021-05-02 23:04:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-05-02 23:04:08,700 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:08,700 INFO L523 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:08,700 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2021-05-02 23:04:08,700 INFO L428 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:08,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:08,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1631711149, now seen corresponding path program 32 times [2021-05-02 23:04:08,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:08,700 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1023636889] [2021-05-02 23:04:08,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:08,712 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_654) (<= (+ v_main_~i~0_654 1) v_main_~n~0_131)) InVars {main_~i~0=v_main_~i~0_654, main_~n~0=v_main_~n~0_131} OutVars{main_~i~0=v_main_~i~0_654, main_~n~0=v_main_~n~0_131} AuxVars[] AssignedVars[] [2021-05-02 23:04:08,713 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:04:08,726 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:08,727 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:08,737 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:08,738 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:08,740 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:04:08,749 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_656)) (<= (+ v_main_~i~0_656 1) v_main_~n~0_132)) InVars {main_~i~0=v_main_~i~0_656, main_~n~0=v_main_~n~0_132} OutVars{main_~i~0=v_main_~i~0_656, main_~n~0=v_main_~n~0_132} AuxVars[] AssignedVars[] [2021-05-02 23:04:08,750 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:04:08,763 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:08,773 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:08,783 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:04:08,789 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:04:08,805 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:04:08,827 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:08,831 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_658 v_main_~n~0_133) (not (= 4 v_main_~i~0_658))) InVars {main_~i~0=v_main_~i~0_658, main_~n~0=v_main_~n~0_133} OutVars{main_~i~0=v_main_~i~0_658, main_~n~0=v_main_~n~0_133} AuxVars[] AssignedVars[] [2021-05-02 23:04:08,834 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:04:08,847 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:08,850 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:08,860 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:08,865 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:08,881 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:04:08,905 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_660 v_main_~n~0_134) (= 4 v_main_~i~0_660)) InVars {main_~i~0=v_main_~i~0_660, main_~n~0=v_main_~n~0_134} OutVars{main_~i~0=v_main_~i~0_660, main_~n~0=v_main_~n~0_134} AuxVars[] AssignedVars[] [2021-05-02 23:04:08,907 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:04:08,908 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:08,909 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:08,917 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:08,919 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:08,929 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:04:08,936 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:09,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:09,037 INFO 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:04:09,039 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:10,126 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:10,126 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1023636889] [2021-05-02 23:04:10,127 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1023636889] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:10,127 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:10,127 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2021-05-02 23:04:10,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874221816] [2021-05-02 23:04:10,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2021-05-02 23:04:10,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:10,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-05-02 23:04:10,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2021-05-02 23:04:10,127 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 47 states, 46 states have (on average 1.391304347826087) internal successors, (64), 45 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:12,397 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2021-05-02 23:04:12,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-05-02 23:04:12,398 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.391304347826087) internal successors, (64), 45 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2021-05-02 23:04:12,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:12,398 INFO L225 Difference]: With dead ends: 77 [2021-05-02 23:04:12,398 INFO L226 Difference]: Without dead ends: 72 [2021-05-02 23:04:12,399 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 2403.5ms TimeCoverageRelationStatistics Valid=316, Invalid=7694, Unknown=0, NotChecked=0, Total=8010 [2021-05-02 23:04:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-02 23:04:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-05-02 23:04:12,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2021-05-02 23:04:12,405 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 68 [2021-05-02 23:04:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:12,405 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2021-05-02 23:04:12,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 47 states, 46 states have (on average 1.391304347826087) internal successors, (64), 45 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2021-05-02 23:04:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-02 23:04:12,406 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:12,406 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 18, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:12,406 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2021-05-02 23:04:12,406 INFO L428 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:12,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:12,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1416395144, now seen corresponding path program 33 times [2021-05-02 23:04:12,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:12,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1892412290] [2021-05-02 23:04:12,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:12,414 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_683 1) v_main_~n~0_135) (= 4 v_main_~i~0_683)) InVars {main_~i~0=v_main_~i~0_683, main_~n~0=v_main_~n~0_135} OutVars{main_~i~0=v_main_~i~0_683, main_~n~0=v_main_~n~0_135} AuxVars[] AssignedVars[] [2021-05-02 23:04:12,416 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:04:12,428 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:12,441 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:12,453 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:12,455 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:12,456 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:04:12,465 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_685)) (<= (+ v_main_~i~0_685 1) v_main_~n~0_136)) InVars {main_~i~0=v_main_~i~0_685, main_~n~0=v_main_~n~0_136} OutVars{main_~i~0=v_main_~i~0_685, main_~n~0=v_main_~n~0_136} AuxVars[] AssignedVars[] [2021-05-02 23:04:12,467 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:04:12,479 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:12,484 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:12,501 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:04:12,506 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:04:12,522 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:04:12,545 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:12,547 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_687)) (<= v_main_~i~0_687 v_main_~n~0_137)) InVars {main_~i~0=v_main_~i~0_687, main_~n~0=v_main_~n~0_137} OutVars{main_~i~0=v_main_~i~0_687, main_~n~0=v_main_~n~0_137} AuxVars[] AssignedVars[] [2021-05-02 23:04:12,548 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:04:12,549 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:12,550 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:12,560 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:12,566 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:12,593 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:04:12,618 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_689 v_main_~n~0_138) (= 4 v_main_~i~0_689)) InVars {main_~i~0=v_main_~i~0_689, main_~n~0=v_main_~n~0_138} OutVars{main_~i~0=v_main_~i~0_689, main_~n~0=v_main_~n~0_138} AuxVars[] AssignedVars[] [2021-05-02 23:04:12,619 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:04:12,620 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:12,621 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:12,630 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:12,632 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:12,642 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:04:12,650 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:12,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:12,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:04:12,715 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:12,793 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:13,780 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:13,780 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1892412290] [2021-05-02 23:04:13,781 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1892412290] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:13,781 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:13,781 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2021-05-02 23:04:13,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438846878] [2021-05-02 23:04:13,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2021-05-02 23:04:13,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:13,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-05-02 23:04:13,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2401, Unknown=0, NotChecked=0, Total=2550 [2021-05-02 23:04:13,782 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 48 states, 47 states have (on average 1.425531914893617) internal successors, (67), 46 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:04:16,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:16,030 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2021-05-02 23:04:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-05-02 23:04:16,030 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.425531914893617) internal successors, (67), 46 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:04:16,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:16,030 INFO L225 Difference]: With dead ends: 82 [2021-05-02 23:04:16,031 INFO L226 Difference]: Without dead ends: 74 [2021-05-02 23:04:16,031 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 2319.3ms TimeCoverageRelationStatistics Valid=355, Invalid=8017, Unknown=0, NotChecked=0, Total=8372 [2021-05-02 23:04:16,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-02 23:04:16,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2021-05-02 23:04:16,037 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:04:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2021-05-02 23:04:16,037 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2021-05-02 23:04:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:16,038 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2021-05-02 23:04:16,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 48 states, 47 states have (on average 1.425531914893617) internal successors, (67), 46 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:04:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2021-05-02 23:04:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-05-02 23:04:16,038 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:16,038 INFO L523 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:16,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2021-05-02 23:04:16,038 INFO L428 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:16,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:16,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1103564790, now seen corresponding path program 34 times [2021-05-02 23:04:16,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:16,039 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [302455712] [2021-05-02 23:04:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:16,044 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_712 1) v_main_~n~0_139) (= 4 v_main_~i~0_712)) InVars {main_~i~0=v_main_~i~0_712, main_~n~0=v_main_~n~0_139} OutVars{main_~i~0=v_main_~i~0_712, main_~n~0=v_main_~n~0_139} AuxVars[] AssignedVars[] [2021-05-02 23:04:16,045 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:04:16,058 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:16,060 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:16,070 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:16,072 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:16,073 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:04:16,083 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_714)) (<= (+ v_main_~i~0_714 1) v_main_~n~0_140)) InVars {main_~i~0=v_main_~i~0_714, main_~n~0=v_main_~n~0_140} OutVars{main_~i~0=v_main_~i~0_714, main_~n~0=v_main_~n~0_140} AuxVars[] AssignedVars[] [2021-05-02 23:04:16,084 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:04:16,097 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:16,100 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:16,109 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:04:16,115 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:04:16,131 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:04:16,153 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:16,155 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_716 v_main_~n~0_141) (not (= 4 v_main_~i~0_716))) InVars {main_~i~0=v_main_~i~0_716, main_~n~0=v_main_~n~0_141} OutVars{main_~i~0=v_main_~i~0_716, main_~n~0=v_main_~n~0_141} AuxVars[] AssignedVars[] [2021-05-02 23:04:16,157 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:04:16,158 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:16,159 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:16,169 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:16,174 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:16,202 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:04:16,226 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_718 v_main_~n~0_142) (= 4 v_main_~i~0_718)) InVars {main_~i~0=v_main_~i~0_718, main_~n~0=v_main_~n~0_142} OutVars{main_~i~0=v_main_~i~0_718, main_~n~0=v_main_~n~0_142} AuxVars[] AssignedVars[] [2021-05-02 23:04:16,227 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:04:16,228 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:16,229 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:16,239 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:16,241 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:16,251 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:04:16,259 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:16,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:16,326 INFO 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:04:16,329 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:16,414 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:17,515 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:17,515 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [302455712] [2021-05-02 23:04:17,515 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [302455712] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:17,515 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:17,515 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2021-05-02 23:04:17,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296187568] [2021-05-02 23:04:17,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2021-05-02 23:04:17,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:17,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-05-02 23:04:17,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2021-05-02 23:04:17,516 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 49 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 47 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:04:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:19,905 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2021-05-02 23:04:19,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-05-02 23:04:19,906 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 47 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:04:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:19,906 INFO L225 Difference]: With dead ends: 80 [2021-05-02 23:04:19,907 INFO L226 Difference]: Without dead ends: 75 [2021-05-02 23:04:19,907 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2289 ImplicationChecksByTransitivity, 2515.3ms TimeCoverageRelationStatistics Valid=361, Invalid=8381, Unknown=0, NotChecked=0, Total=8742 [2021-05-02 23:04:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-02 23:04:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-02 23:04:19,913 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:04:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2021-05-02 23:04:19,914 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 71 [2021-05-02 23:04:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:19,914 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2021-05-02 23:04:19,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 49 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 47 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:04:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2021-05-02 23:04:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-02 23:04:19,914 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:19,914 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 19, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:19,914 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2021-05-02 23:04:19,914 INFO L428 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:19,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:19,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1069563893, now seen corresponding path program 35 times [2021-05-02 23:04:19,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:19,915 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [38520767] [2021-05-02 23:04:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:19,921 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_742) (<= (+ v_main_~i~0_742 1) v_main_~n~0_143)) InVars {main_~i~0=v_main_~i~0_742, main_~n~0=v_main_~n~0_143} OutVars{main_~i~0=v_main_~i~0_742, main_~n~0=v_main_~n~0_143} AuxVars[] AssignedVars[] [2021-05-02 23:04:19,922 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:04:19,935 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:19,936 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:19,945 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:19,947 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:19,949 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:04:19,959 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_744)) (<= (+ v_main_~i~0_744 1) v_main_~n~0_144)) InVars {main_~i~0=v_main_~i~0_744, main_~n~0=v_main_~n~0_144} OutVars{main_~i~0=v_main_~i~0_744, main_~n~0=v_main_~n~0_144} AuxVars[] AssignedVars[] [2021-05-02 23:04:19,960 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:04:19,961 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:19,965 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:19,976 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:04:19,982 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:04:20,010 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:04:20,034 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:20,036 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_746)) (<= v_main_~i~0_746 v_main_~n~0_145)) InVars {main_~i~0=v_main_~i~0_746, main_~n~0=v_main_~n~0_145} OutVars{main_~i~0=v_main_~i~0_746, main_~n~0=v_main_~n~0_145} AuxVars[] AssignedVars[] [2021-05-02 23:04:20,038 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:04:20,039 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:20,041 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:20,051 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:20,057 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:20,083 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:04:20,108 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_748) (<= v_main_~i~0_748 v_main_~n~0_146)) InVars {main_~i~0=v_main_~i~0_748, main_~n~0=v_main_~n~0_146} OutVars{main_~i~0=v_main_~i~0_748, main_~n~0=v_main_~n~0_146} AuxVars[] AssignedVars[] [2021-05-02 23:04:20,109 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:04:20,110 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:20,111 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:20,121 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:20,123 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:20,134 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:04:20,142 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:20,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:04:20,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:20,300 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:21,408 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:21,408 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [38520767] [2021-05-02 23:04:21,408 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [38520767] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:21,408 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:21,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2021-05-02 23:04:21,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115875092] [2021-05-02 23:04:21,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2021-05-02 23:04:21,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:21,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-05-02 23:04:21,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2602, Unknown=0, NotChecked=0, Total=2756 [2021-05-02 23:04:21,409 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 48 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:23,959 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2021-05-02 23:04:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-05-02 23:04:23,960 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 48 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2021-05-02 23:04:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:23,960 INFO L225 Difference]: With dead ends: 85 [2021-05-02 23:04:23,960 INFO L226 Difference]: Without dead ends: 77 [2021-05-02 23:04:23,961 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 2595.4ms TimeCoverageRelationStatistics Valid=369, Invalid=8751, Unknown=0, NotChecked=0, Total=9120 [2021-05-02 23:04:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-02 23:04:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2021-05-02 23:04:23,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2021-05-02 23:04:23,968 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2021-05-02 23:04:23,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:23,968 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2021-05-02 23:04:23,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 48 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2021-05-02 23:04:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-05-02 23:04:23,969 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:23,969 INFO L523 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:23,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2021-05-02 23:04:23,969 INFO L428 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:23,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:23,969 INFO L82 PathProgramCache]: Analyzing trace with hash 705443469, now seen corresponding path program 36 times [2021-05-02 23:04:23,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:23,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1449594182] [2021-05-02 23:04:23,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:23,989 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_772 1) v_main_~n~0_147) (= 4 v_main_~i~0_772)) InVars {main_~i~0=v_main_~i~0_772, main_~n~0=v_main_~n~0_147} OutVars{main_~i~0=v_main_~i~0_772, main_~n~0=v_main_~n~0_147} AuxVars[] AssignedVars[] [2021-05-02 23:04:23,990 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:04:24,004 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:24,005 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:24,015 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:24,017 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:24,021 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:04:24,031 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_774)) (<= (+ v_main_~i~0_774 1) v_main_~n~0_148)) InVars {main_~i~0=v_main_~i~0_774, main_~n~0=v_main_~n~0_148} OutVars{main_~i~0=v_main_~i~0_774, main_~n~0=v_main_~n~0_148} AuxVars[] AssignedVars[] [2021-05-02 23:04:24,033 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:04:24,048 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:24,050 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:24,063 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:04:24,070 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:04:24,091 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:04:24,118 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:24,120 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_776 v_main_~n~0_149) (not (= 4 v_main_~i~0_776))) InVars {main_~i~0=v_main_~i~0_776, main_~n~0=v_main_~n~0_149} OutVars{main_~i~0=v_main_~i~0_776, main_~n~0=v_main_~n~0_149} AuxVars[] AssignedVars[] [2021-05-02 23:04:24,121 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:04:24,137 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:24,138 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:24,148 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:24,155 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:24,173 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:04:24,199 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_778 v_main_~n~0_150) (= 4 v_main_~i~0_778)) InVars {main_~i~0=v_main_~i~0_778, main_~n~0=v_main_~n~0_150} OutVars{main_~i~0=v_main_~i~0_778, main_~n~0=v_main_~n~0_150} AuxVars[] AssignedVars[] [2021-05-02 23:04:24,201 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:04:24,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:24,216 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:24,227 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:24,229 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:24,231 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:04:24,239 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:24,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:24,321 INFO 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:04:24,323 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:24,410 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:25,757 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:25,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1449594182] [2021-05-02 23:04:25,758 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1449594182] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:25,758 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:25,758 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2021-05-02 23:04:25,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978604403] [2021-05-02 23:04:25,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-05-02 23:04:25,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:25,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-05-02 23:04:25,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2724, Unknown=0, NotChecked=0, Total=2862 [2021-05-02 23:04:25,759 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 49 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:28,648 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2021-05-02 23:04:28,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-05-02 23:04:28,649 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.4) internal successors, (70), 49 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2021-05-02 23:04:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:28,650 INFO L225 Difference]: With dead ends: 83 [2021-05-02 23:04:28,650 INFO L226 Difference]: Without dead ends: 78 [2021-05-02 23:04:28,650 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2061 ImplicationChecksByTransitivity, 3116.4ms TimeCoverageRelationStatistics Valid=340, Invalid=9166, Unknown=0, NotChecked=0, Total=9506 [2021-05-02 23:04:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-05-02 23:04:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-05-02 23:04:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2021-05-02 23:04:28,659 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 74 [2021-05-02 23:04:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:28,659 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2021-05-02 23:04:28,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 51 states, 50 states have (on average 1.4) internal successors, (70), 49 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2021-05-02 23:04:28,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-02 23:04:28,659 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:28,659 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:28,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2021-05-02 23:04:28,660 INFO L428 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:28,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:28,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2140817064, now seen corresponding path program 37 times [2021-05-02 23:04:28,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:28,660 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1433560491] [2021-05-02 23:04:28,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:28,666 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_803 1) v_main_~n~0_151) (= 4 v_main_~i~0_803)) InVars {main_~i~0=v_main_~i~0_803, main_~n~0=v_main_~n~0_151} OutVars{main_~i~0=v_main_~i~0_803, main_~n~0=v_main_~n~0_151} AuxVars[] AssignedVars[] [2021-05-02 23:04:28,667 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:04:28,668 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:28,669 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:28,678 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:28,680 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:28,692 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:04:28,701 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_805)) (<= (+ v_main_~i~0_805 1) v_main_~n~0_152)) InVars {main_~i~0=v_main_~i~0_805, main_~n~0=v_main_~n~0_152} OutVars{main_~i~0=v_main_~i~0_805, main_~n~0=v_main_~n~0_152} AuxVars[] AssignedVars[] [2021-05-02 23:04:28,703 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:04:28,717 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:28,718 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:28,728 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:04:28,734 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:04:28,751 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:04:28,779 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:28,781 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_807)) (<= v_main_~i~0_807 v_main_~n~0_153)) InVars {main_~i~0=v_main_~i~0_807, main_~n~0=v_main_~n~0_153} OutVars{main_~i~0=v_main_~i~0_807, main_~n~0=v_main_~n~0_153} AuxVars[] AssignedVars[] [2021-05-02 23:04:28,782 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:04:28,796 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:28,797 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:28,807 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:28,813 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:28,829 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:04:28,855 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_809) (<= v_main_~i~0_809 v_main_~n~0_154)) InVars {main_~i~0=v_main_~i~0_809, main_~n~0=v_main_~n~0_154} OutVars{main_~i~0=v_main_~i~0_809, main_~n~0=v_main_~n~0_154} AuxVars[] AssignedVars[] [2021-05-02 23:04:28,856 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:04:28,869 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:28,870 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:28,887 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:28,889 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:28,891 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:04:28,900 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:28,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:28,979 INFO 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:04:28,981 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:30,236 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:30,236 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1433560491] [2021-05-02 23:04:30,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1433560491] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:30,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:30,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2021-05-02 23:04:30,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562007591] [2021-05-02 23:04:30,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2021-05-02 23:04:30,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:30,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-05-02 23:04:30,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2021-05-02 23:04:30,237 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 52 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 50 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:04:32,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:32,945 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2021-05-02 23:04:32,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-05-02 23:04:32,945 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 50 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:04:32,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:32,946 INFO L225 Difference]: With dead ends: 88 [2021-05-02 23:04:32,946 INFO L226 Difference]: Without dead ends: 80 [2021-05-02 23:04:32,946 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2525 ImplicationChecksByTransitivity, 2755.8ms TimeCoverageRelationStatistics Valid=383, Invalid=9517, Unknown=0, NotChecked=0, Total=9900 [2021-05-02 23:04:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-05-02 23:04:32,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2021-05-02 23:04:32,953 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:04:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2021-05-02 23:04:32,954 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2021-05-02 23:04:32,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:32,954 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2021-05-02 23:04:32,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 52 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 50 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:04:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2021-05-02 23:04:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-05-02 23:04:32,954 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:32,954 INFO L523 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:32,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2021-05-02 23:04:32,954 INFO L428 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:32,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:32,955 INFO L82 PathProgramCache]: Analyzing trace with hash -379142870, now seen corresponding path program 38 times [2021-05-02 23:04:32,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:32,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1147903984] [2021-05-02 23:04:32,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:32,961 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_834) (<= (+ v_main_~i~0_834 1) v_main_~n~0_155)) InVars {main_~i~0=v_main_~i~0_834, main_~n~0=v_main_~n~0_155} OutVars{main_~i~0=v_main_~i~0_834, main_~n~0=v_main_~n~0_155} AuxVars[] AssignedVars[] [2021-05-02 23:04:32,963 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:04:32,976 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:32,978 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:32,987 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:32,989 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:32,991 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:04:33,001 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_836 1) v_main_~n~0_156) (not (= 4 v_main_~i~0_836))) InVars {main_~i~0=v_main_~i~0_836, main_~n~0=v_main_~n~0_156} OutVars{main_~i~0=v_main_~i~0_836, main_~n~0=v_main_~n~0_156} AuxVars[] AssignedVars[] [2021-05-02 23:04:33,002 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:04:33,016 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:33,018 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:33,028 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:04:33,034 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:04:33,052 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:04:33,076 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:33,078 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_838 v_main_~n~0_157) (not (= 4 v_main_~i~0_838))) InVars {main_~i~0=v_main_~i~0_838, main_~n~0=v_main_~n~0_157} OutVars{main_~i~0=v_main_~i~0_838, main_~n~0=v_main_~n~0_157} AuxVars[] AssignedVars[] [2021-05-02 23:04:33,079 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:04:33,094 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:33,097 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:33,110 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:33,116 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:33,135 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:04:33,166 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_840) (<= v_main_~i~0_840 v_main_~n~0_158)) InVars {main_~i~0=v_main_~i~0_840, main_~n~0=v_main_~n~0_158} OutVars{main_~i~0=v_main_~i~0_840, main_~n~0=v_main_~n~0_158} AuxVars[] AssignedVars[] [2021-05-02 23:04:33,167 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:04:33,182 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:33,183 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:33,194 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:33,196 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:33,198 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:04:33,206 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:33,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:33,279 INFO 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:04:33,281 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:33,364 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:34,684 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:34,684 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1147903984] [2021-05-02 23:04:34,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1147903984] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:34,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:34,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2021-05-02 23:04:34,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70046262] [2021-05-02 23:04:34,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2021-05-02 23:04:34,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:34,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-05-02 23:04:34,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2919, Unknown=0, NotChecked=0, Total=3080 [2021-05-02 23:04:34,686 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 53 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 51 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:04:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:37,609 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2021-05-02 23:04:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-05-02 23:04:37,609 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 51 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:04:37,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:37,610 INFO L225 Difference]: With dead ends: 86 [2021-05-02 23:04:37,610 INFO L226 Difference]: Without dead ends: 81 [2021-05-02 23:04:37,610 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2702 ImplicationChecksByTransitivity, 3013.3ms TimeCoverageRelationStatistics Valid=389, Invalid=9913, Unknown=0, NotChecked=0, Total=10302 [2021-05-02 23:04:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-05-02 23:04:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2021-05-02 23:04:37,618 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:04:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2021-05-02 23:04:37,618 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 77 [2021-05-02 23:04:37,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:37,618 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2021-05-02 23:04:37,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 53 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 51 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:04:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2021-05-02 23:04:37,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-02 23:04:37,619 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:37,619 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:37,619 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2021-05-02 23:04:37,619 INFO L428 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:37,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:37,619 INFO L82 PathProgramCache]: Analyzing trace with hash -2026807573, now seen corresponding path program 39 times [2021-05-02 23:04:37,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:37,619 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [175220714] [2021-05-02 23:04:37,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:37,625 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_866) (<= (+ v_main_~i~0_866 1) v_main_~n~0_159)) InVars {main_~i~0=v_main_~i~0_866, main_~n~0=v_main_~n~0_159} OutVars{main_~i~0=v_main_~i~0_866, main_~n~0=v_main_~n~0_159} AuxVars[] AssignedVars[] [2021-05-02 23:04:37,627 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:04:37,627 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:37,638 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:37,648 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:37,650 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:37,661 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:04:37,671 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_868)) (<= (+ v_main_~i~0_868 1) v_main_~n~0_160)) InVars {main_~i~0=v_main_~i~0_868, main_~n~0=v_main_~n~0_160} OutVars{main_~i~0=v_main_~i~0_868, main_~n~0=v_main_~n~0_160} AuxVars[] AssignedVars[] [2021-05-02 23:04:37,672 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:04:37,673 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:37,674 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:37,684 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:04:37,690 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:04:37,720 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:04:37,744 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:37,746 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_870)) (<= v_main_~i~0_870 v_main_~n~0_161)) InVars {main_~i~0=v_main_~i~0_870, main_~n~0=v_main_~n~0_161} OutVars{main_~i~0=v_main_~i~0_870, main_~n~0=v_main_~n~0_161} AuxVars[] AssignedVars[] [2021-05-02 23:04:37,747 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:04:37,748 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:37,749 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:37,760 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:37,767 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:37,794 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:04:37,820 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_872) (<= v_main_~i~0_872 v_main_~n~0_162)) InVars {main_~i~0=v_main_~i~0_872, main_~n~0=v_main_~n~0_162} OutVars{main_~i~0=v_main_~i~0_872, main_~n~0=v_main_~n~0_162} AuxVars[] AssignedVars[] [2021-05-02 23:04:37,821 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:04:37,834 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:37,836 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:37,844 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:37,846 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:37,848 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:04:37,856 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:37,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:37,929 INFO 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:04:37,932 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:39,337 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:39,337 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [175220714] [2021-05-02 23:04:39,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [175220714] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:39,337 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:39,337 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2021-05-02 23:04:39,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4265179] [2021-05-02 23:04:39,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2021-05-02 23:04:39,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:39,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-05-02 23:04:39,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=3028, Unknown=0, NotChecked=0, Total=3192 [2021-05-02 23:04:39,338 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 54 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 52 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:42,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:42,343 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2021-05-02 23:04:42,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-05-02 23:04:42,344 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 52 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2021-05-02 23:04:42,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:42,344 INFO L225 Difference]: With dead ends: 91 [2021-05-02 23:04:42,345 INFO L226 Difference]: Without dead ends: 83 [2021-05-02 23:04:42,345 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2774 ImplicationChecksByTransitivity, 3068.3ms TimeCoverageRelationStatistics Valid=397, Invalid=10315, Unknown=0, NotChecked=0, Total=10712 [2021-05-02 23:04:42,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-05-02 23:04:42,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2021-05-02 23:04:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2021-05-02 23:04:42,353 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2021-05-02 23:04:42,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:42,353 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2021-05-02 23:04:42,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 54 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 52 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:42,353 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2021-05-02 23:04:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-05-02 23:04:42,353 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:42,353 INFO L523 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:42,353 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2021-05-02 23:04:42,354 INFO L428 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:42,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:42,354 INFO L82 PathProgramCache]: Analyzing trace with hash -251800211, now seen corresponding path program 40 times [2021-05-02 23:04:42,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:42,354 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1475614745] [2021-05-02 23:04:42,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:42,360 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_898 1) v_main_~n~0_163) (= 4 v_main_~i~0_898)) InVars {main_~i~0=v_main_~i~0_898, main_~n~0=v_main_~n~0_163} OutVars{main_~i~0=v_main_~i~0_898, main_~n~0=v_main_~n~0_163} AuxVars[] AssignedVars[] [2021-05-02 23:04:42,362 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:04:42,362 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:42,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:42,374 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:42,376 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:42,389 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:04:42,399 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= 4 v_main_~i~0_900)) (<= (+ v_main_~i~0_900 1) v_main_~n~0_164)) InVars {main_~i~0=v_main_~i~0_900, main_~n~0=v_main_~n~0_164} OutVars{main_~i~0=v_main_~i~0_900, main_~n~0=v_main_~n~0_164} AuxVars[] AssignedVars[] [2021-05-02 23:04:42,401 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:04:42,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:42,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:42,415 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:04:42,421 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:04:42,451 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:04:42,477 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:42,479 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_902 v_main_~n~0_165) (not (= 4 v_main_~i~0_902))) InVars {main_~i~0=v_main_~i~0_902, main_~n~0=v_main_~n~0_165} OutVars{main_~i~0=v_main_~i~0_902, main_~n~0=v_main_~n~0_165} AuxVars[] AssignedVars[] [2021-05-02 23:04:42,480 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:04:42,496 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:42,497 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:42,509 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:42,516 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:42,534 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:04:42,561 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_904) (<= v_main_~i~0_904 v_main_~n~0_166)) InVars {main_~i~0=v_main_~i~0_904, main_~n~0=v_main_~n~0_166} OutVars{main_~i~0=v_main_~i~0_904, main_~n~0=v_main_~n~0_166} AuxVars[] AssignedVars[] [2021-05-02 23:04:42,562 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:04:42,577 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:42,579 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:42,590 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:42,592 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:42,594 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:04:42,603 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:42,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:42,761 INFO 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:04:42,763 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:42,851 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:44,394 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:44,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1475614745] [2021-05-02 23:04:44,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1475614745] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:44,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:44,395 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2021-05-02 23:04:44,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047902007] [2021-05-02 23:04:44,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2021-05-02 23:04:44,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:44,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-05-02 23:04:44,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=3146, Unknown=0, NotChecked=0, Total=3306 [2021-05-02 23:04:44,395 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 55 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 53 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:47,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:47,647 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2021-05-02 23:04:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-05-02 23:04:47,648 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 53 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2021-05-02 23:04:47,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:47,648 INFO L225 Difference]: With dead ends: 89 [2021-05-02 23:04:47,649 INFO L226 Difference]: Without dead ends: 84 [2021-05-02 23:04:47,649 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2708 ImplicationChecksByTransitivity, 3477.6ms TimeCoverageRelationStatistics Valid=392, Invalid=10738, Unknown=0, NotChecked=0, Total=11130 [2021-05-02 23:04:47,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-05-02 23:04:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-05-02 23:04:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.0253164556962024) internal successors, (81), 79 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2021-05-02 23:04:47,657 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 80 [2021-05-02 23:04:47,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:47,657 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2021-05-02 23:04:47,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 55 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 53 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:04:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2021-05-02 23:04:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-02 23:04:47,657 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:47,657 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:47,658 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2021-05-02 23:04:47,658 INFO L428 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:47,658 INFO L82 PathProgramCache]: Analyzing trace with hash -817775672, now seen corresponding path program 41 times [2021-05-02 23:04:47,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:47,658 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1711012853] [2021-05-02 23:04:47,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:47,665 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= 4 v_main_~i~0_931) (<= (+ v_main_~i~0_931 1) v_main_~n~0_167)) InVars {main_~i~0=v_main_~i~0_931, main_~n~0=v_main_~n~0_167} OutVars{main_~i~0=v_main_~i~0_931, main_~n~0=v_main_~n~0_167} AuxVars[] AssignedVars[] [2021-05-02 23:04:47,666 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:04:47,667 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:47,668 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:47,679 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:47,681 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:47,692 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:04:47,702 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_933 1) v_main_~n~0_168) (not (= 4 v_main_~i~0_933))) InVars {main_~i~0=v_main_~i~0_933, main_~n~0=v_main_~n~0_168} OutVars{main_~i~0=v_main_~i~0_933, main_~n~0=v_main_~n~0_168} AuxVars[] AssignedVars[] [2021-05-02 23:04:47,705 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:04:47,719 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:47,721 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:47,732 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:04:47,738 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:04:47,756 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:04:47,781 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:47,783 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_935 v_main_~n~0_169) (not (= 4 v_main_~i~0_935))) InVars {main_~i~0=v_main_~i~0_935, main_~n~0=v_main_~n~0_169} OutVars{main_~i~0=v_main_~i~0_935, main_~n~0=v_main_~n~0_169} AuxVars[] AssignedVars[] [2021-05-02 23:04:47,784 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:04:47,785 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:47,792 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:47,803 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:47,810 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:47,841 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:04:47,870 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_937 v_main_~n~0_170) (= 4 v_main_~i~0_937)) InVars {main_~i~0=v_main_~i~0_937, main_~n~0=v_main_~n~0_170} OutVars{main_~i~0=v_main_~i~0_937, main_~n~0=v_main_~n~0_170} AuxVars[] AssignedVars[] [2021-05-02 23:04:47,872 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:04:47,889 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:47,891 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:47,901 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:47,903 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:47,905 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:04:47,914 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:48,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:48,011 INFO 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:04:48,013 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:48,105 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:49,677 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:49,678 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1711012853] [2021-05-02 23:04:49,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1711012853] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:49,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:49,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2021-05-02 23:04:49,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112469771] [2021-05-02 23:04:49,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2021-05-02 23:04:49,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:49,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2021-05-02 23:04:49,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=3274, Unknown=0, NotChecked=0, Total=3422 [2021-05-02 23:04:49,679 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand has 56 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 54 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:04:53,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:53,182 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2021-05-02 23:04:53,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-05-02 23:04:53,182 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 54 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:04:53,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:53,183 INFO L225 Difference]: With dead ends: 94 [2021-05-02 23:04:53,183 INFO L226 Difference]: Without dead ends: 86 [2021-05-02 23:04:53,183 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 3661.2ms TimeCoverageRelationStatistics Valid=370, Invalid=11186, Unknown=0, NotChecked=0, Total=11556 [2021-05-02 23:04:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-05-02 23:04:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2021-05-02 23:04:53,191 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:04:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2021-05-02 23:04:53,191 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2021-05-02 23:04:53,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:53,191 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2021-05-02 23:04:53,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 56 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 54 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:04:53,191 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2021-05-02 23:04:53,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-05-02 23:04:53,192 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:53,192 INFO L523 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:53,192 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2021-05-02 23:04:53,192 INFO L428 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:53,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:53,192 INFO L82 PathProgramCache]: Analyzing trace with hash 957231690, now seen corresponding path program 42 times [2021-05-02 23:04:53,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:53,192 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1302713757] [2021-05-02 23:04:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:53,202 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_964 1) v_main_~n~0_171) (= 4 v_main_~i~0_964)) InVars {main_~i~0=v_main_~i~0_964, main_~n~0=v_main_~n~0_171} OutVars{main_~i~0=v_main_~i~0_964, main_~n~0=v_main_~n~0_171} AuxVars[] AssignedVars[] [2021-05-02 23:04:53,204 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:04:53,218 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:53,219 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:53,229 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:53,231 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:53,232 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:04:53,242 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_966 1) v_main_~n~0_172) (not (= 4 v_main_~i~0_966))) InVars {main_~i~0=v_main_~i~0_966, main_~n~0=v_main_~n~0_172} OutVars{main_~i~0=v_main_~i~0_966, main_~n~0=v_main_~n~0_172} AuxVars[] AssignedVars[] [2021-05-02 23:04:53,244 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:04:53,245 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:53,246 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:53,256 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:04:53,263 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:04:53,294 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:04:53,319 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:53,321 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_968 v_main_~n~0_173) (not (= 4 v_main_~i~0_968))) InVars {main_~i~0=v_main_~i~0_968, main_~n~0=v_main_~n~0_173} OutVars{main_~i~0=v_main_~i~0_968, main_~n~0=v_main_~n~0_173} AuxVars[] AssignedVars[] [2021-05-02 23:04:53,323 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:04:53,337 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:53,338 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:53,348 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:53,354 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:53,372 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:04:53,400 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_970 v_main_~n~0_174) (= 4 v_main_~i~0_970)) InVars {main_~i~0=v_main_~i~0_970, main_~n~0=v_main_~n~0_174} OutVars{main_~i~0=v_main_~i~0_970, main_~n~0=v_main_~n~0_174} AuxVars[] AssignedVars[] [2021-05-02 23:04:53,401 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:04:53,402 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:53,404 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:53,414 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:53,416 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:53,429 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:04:53,438 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:53,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:04:53,596 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:53,680 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:04:55,186 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:04:55,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1302713757] [2021-05-02 23:04:55,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1302713757] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:04:55,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:04:55,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2021-05-02 23:04:55,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672385743] [2021-05-02 23:04:55,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2021-05-02 23:04:55,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:04:55,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-05-02 23:04:55,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3375, Unknown=0, NotChecked=0, Total=3540 [2021-05-02 23:04:55,187 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 57 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 55 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:04:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:04:58,659 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2021-05-02 23:04:58,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-05-02 23:04:58,659 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 55 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:04:58,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:04:58,660 INFO L225 Difference]: With dead ends: 92 [2021-05-02 23:04:58,660 INFO L226 Difference]: Without dead ends: 87 [2021-05-02 23:04:58,661 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2875 ImplicationChecksByTransitivity, 3556.1ms TimeCoverageRelationStatistics Valid=406, Invalid=11584, Unknown=0, NotChecked=0, Total=11990 [2021-05-02 23:04:58,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-05-02 23:04:58,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-05-02 23:04:58,675 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:04:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2021-05-02 23:04:58,676 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 83 [2021-05-02 23:04:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:04:58,676 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2021-05-02 23:04:58,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 57 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 55 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:04:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2021-05-02 23:04:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-05-02 23:04:58,676 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:04:58,676 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:04:58,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2021-05-02 23:04:58,676 INFO L428 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:04:58,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:04:58,677 INFO L82 PathProgramCache]: Analyzing trace with hash -144157237, now seen corresponding path program 43 times [2021-05-02 23:04:58,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:04:58,677 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [704193233] [2021-05-02 23:04:58,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:04:58,684 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_998 1) v_main_~n~0_175) (= 4 v_main_~i~0_998)) InVars {main_~i~0=v_main_~i~0_998, main_~n~0=v_main_~n~0_175} OutVars{main_~i~0=v_main_~i~0_998, main_~n~0=v_main_~n~0_175} AuxVars[] AssignedVars[] [2021-05-02 23:04:58,685 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:04:58,686 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:58,687 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:58,699 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:58,701 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:58,713 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:04:58,725 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1000 4)) (<= (+ v_main_~i~0_1000 1) v_main_~n~0_176)) InVars {main_~i~0=v_main_~i~0_1000, main_~n~0=v_main_~n~0_176} OutVars{main_~i~0=v_main_~i~0_1000, main_~n~0=v_main_~n~0_176} AuxVars[] AssignedVars[] [2021-05-02 23:04:58,726 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:04:58,741 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:58,742 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:58,754 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:04:58,760 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:04:58,778 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:04:58,804 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:58,806 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1002 4)) (<= v_main_~i~0_1002 v_main_~n~0_177)) InVars {main_~i~0=v_main_~i~0_1002, main_~n~0=v_main_~n~0_177} OutVars{main_~i~0=v_main_~i~0_1002, main_~n~0=v_main_~n~0_177} AuxVars[] AssignedVars[] [2021-05-02 23:04:58,807 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:04:58,822 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:58,823 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:58,834 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:04:58,841 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:04:58,859 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:04:58,886 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1004 4) (<= v_main_~i~0_1004 v_main_~n~0_178)) InVars {main_~i~0=v_main_~i~0_1004, main_~n~0=v_main_~n~0_178} OutVars{main_~i~0=v_main_~i~0_1004, main_~n~0=v_main_~n~0_178} AuxVars[] AssignedVars[] [2021-05-02 23:04:58,887 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:04:58,888 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:58,890 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:04:58,901 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:04:58,903 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:04:58,915 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:04:58,924 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:04:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:58,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:04:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:04:58,997 INFO 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:04:58,999 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:00,659 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:00,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [704193233] [2021-05-02 23:05:00,659 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [704193233] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:00,659 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:00,659 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2021-05-02 23:05:00,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370984254] [2021-05-02 23:05:00,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-05-02 23:05:00,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:00,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-05-02 23:05:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3486, Unknown=0, NotChecked=0, Total=3660 [2021-05-02 23:05:00,660 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 58 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 56 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:04,282 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2021-05-02 23:05:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-05-02 23:05:04,283 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 56 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2021-05-02 23:05:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:04,284 INFO L225 Difference]: With dead ends: 97 [2021-05-02 23:05:04,284 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 23:05:04,284 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3612.4ms TimeCoverageRelationStatistics Valid=425, Invalid=12007, Unknown=0, NotChecked=0, Total=12432 [2021-05-02 23:05:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 23:05:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-05-02 23:05:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2021-05-02 23:05:04,293 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2021-05-02 23:05:04,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:04,293 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2021-05-02 23:05:04,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 58 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 56 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2021-05-02 23:05:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-05-02 23:05:04,293 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:04,293 INFO L523 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:04,294 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2021-05-02 23:05:04,294 INFO L428 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:04,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:04,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1630850125, now seen corresponding path program 44 times [2021-05-02 23:05:04,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:04,294 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [179526681] [2021-05-02 23:05:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:04,302 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1032 4) (<= (+ v_main_~i~0_1032 1) v_main_~n~0_179)) InVars {main_~i~0=v_main_~i~0_1032, main_~n~0=v_main_~n~0_179} OutVars{main_~i~0=v_main_~i~0_1032, main_~n~0=v_main_~n~0_179} AuxVars[] AssignedVars[] [2021-05-02 23:05:04,304 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:05:04,319 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:04,320 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:04,331 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:04,333 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:04,335 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:05:04,346 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1034 4)) (<= (+ v_main_~i~0_1034 1) v_main_~n~0_180)) InVars {main_~i~0=v_main_~i~0_1034, main_~n~0=v_main_~n~0_180} OutVars{main_~i~0=v_main_~i~0_1034, main_~n~0=v_main_~n~0_180} AuxVars[] AssignedVars[] [2021-05-02 23:05:04,347 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:05:04,365 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:04,367 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:04,378 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:05:04,384 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:05:04,402 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:05:04,429 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:04,431 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1036 v_main_~n~0_181) (not (= v_main_~i~0_1036 4))) InVars {main_~i~0=v_main_~i~0_1036, main_~n~0=v_main_~n~0_181} OutVars{main_~i~0=v_main_~i~0_1036, main_~n~0=v_main_~n~0_181} AuxVars[] AssignedVars[] [2021-05-02 23:05:04,433 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:05:04,434 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:04,435 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:04,447 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:04,453 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:04,485 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:05:04,517 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1038 v_main_~n~0_182) (= v_main_~i~0_1038 4)) InVars {main_~i~0=v_main_~i~0_1038, main_~n~0=v_main_~n~0_182} OutVars{main_~i~0=v_main_~i~0_1038, main_~n~0=v_main_~n~0_182} AuxVars[] AssignedVars[] [2021-05-02 23:05:04,518 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:05:04,533 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:04,535 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:04,546 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:04,549 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:04,551 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:05:04,560 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:04,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:04,636 INFO 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:05:04,639 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:06,363 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:06,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [179526681] [2021-05-02 23:05:06,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [179526681] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:06,363 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:06,363 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2021-05-02 23:05:06,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44539511] [2021-05-02 23:05:06,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2021-05-02 23:05:06,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:06,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-05-02 23:05:06,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3606, Unknown=0, NotChecked=0, Total=3782 [2021-05-02 23:05:06,364 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 59 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 57 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:10,130 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2021-05-02 23:05:10,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-05-02 23:05:10,131 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 57 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2021-05-02 23:05:10,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:10,131 INFO L225 Difference]: With dead ends: 95 [2021-05-02 23:05:10,131 INFO L226 Difference]: Without dead ends: 90 [2021-05-02 23:05:10,132 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 3747.5ms TimeCoverageRelationStatistics Valid=431, Invalid=12451, Unknown=0, NotChecked=0, Total=12882 [2021-05-02 23:05:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-05-02 23:05:10,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-05-02 23:05:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 85 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2021-05-02 23:05:10,141 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 86 [2021-05-02 23:05:10,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:10,141 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2021-05-02 23:05:10,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 59 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 57 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:10,141 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2021-05-02 23:05:10,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-02 23:05:10,141 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:10,142 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:10,142 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2021-05-02 23:05:10,142 INFO L428 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:10,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:10,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1535432936, now seen corresponding path program 45 times [2021-05-02 23:05:10,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:10,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [54980456] [2021-05-02 23:05:10,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:10,149 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1067 1) v_main_~n~0_183) (= v_main_~i~0_1067 4)) InVars {main_~i~0=v_main_~i~0_1067, main_~n~0=v_main_~n~0_183} OutVars{main_~i~0=v_main_~i~0_1067, main_~n~0=v_main_~n~0_183} AuxVars[] AssignedVars[] [2021-05-02 23:05:10,151 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:05:10,166 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:10,168 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:10,178 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:10,180 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:10,183 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:05:10,197 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1069 1) v_main_~n~0_184) (not (= v_main_~i~0_1069 4))) InVars {main_~i~0=v_main_~i~0_1069, main_~n~0=v_main_~n~0_184} OutVars{main_~i~0=v_main_~i~0_1069, main_~n~0=v_main_~n~0_184} AuxVars[] AssignedVars[] [2021-05-02 23:05:10,198 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:05:10,199 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:10,201 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:10,214 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:05:10,222 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:05:10,256 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:05:10,286 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:10,289 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1071 4)) (<= v_main_~i~0_1071 v_main_~n~0_185)) InVars {main_~i~0=v_main_~i~0_1071, main_~n~0=v_main_~n~0_185} OutVars{main_~i~0=v_main_~i~0_1071, main_~n~0=v_main_~n~0_185} AuxVars[] AssignedVars[] [2021-05-02 23:05:10,290 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:05:10,291 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:10,293 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:10,306 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:10,313 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:10,349 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:05:10,382 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1073 v_main_~n~0_186) (= v_main_~i~0_1073 4)) InVars {main_~i~0=v_main_~i~0_1073, main_~n~0=v_main_~n~0_186} OutVars{main_~i~0=v_main_~i~0_1073, main_~n~0=v_main_~n~0_186} AuxVars[] AssignedVars[] [2021-05-02 23:05:10,383 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:05:10,399 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:10,400 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:10,413 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:10,416 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:10,418 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:05:10,428 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:10,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:10,541 INFO 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:05:10,544 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:12,407 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:12,407 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [54980456] [2021-05-02 23:05:12,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [54980456] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:12,407 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:12,408 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2021-05-02 23:05:12,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752833733] [2021-05-02 23:05:12,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2021-05-02 23:05:12,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:12,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2021-05-02 23:05:12,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3733, Unknown=0, NotChecked=0, Total=3906 [2021-05-02 23:05:12,409 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 58 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:05:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:16,467 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2021-05-02 23:05:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-05-02 23:05:16,467 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 58 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:05:16,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:16,468 INFO L225 Difference]: With dead ends: 100 [2021-05-02 23:05:16,468 INFO L226 Difference]: Without dead ends: 92 [2021-05-02 23:05:16,469 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3188 ImplicationChecksByTransitivity, 4056.6ms TimeCoverageRelationStatistics Valid=428, Invalid=12912, Unknown=0, NotChecked=0, Total=13340 [2021-05-02 23:05:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-05-02 23:05:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2021-05-02 23:05:16,477 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:05:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2021-05-02 23:05:16,478 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2021-05-02 23:05:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:16,478 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2021-05-02 23:05:16,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 60 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 58 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:05:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2021-05-02 23:05:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-05-02 23:05:16,478 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:16,478 INFO L523 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:16,479 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2021-05-02 23:05:16,479 INFO L428 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:16,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:16,479 INFO L82 PathProgramCache]: Analyzing trace with hash -984526998, now seen corresponding path program 46 times [2021-05-02 23:05:16,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:16,479 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1005495167] [2021-05-02 23:05:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:16,486 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1102 4) (<= (+ v_main_~i~0_1102 1) v_main_~n~0_187)) InVars {main_~i~0=v_main_~i~0_1102, main_~n~0=v_main_~n~0_187} OutVars{main_~i~0=v_main_~i~0_1102, main_~n~0=v_main_~n~0_187} AuxVars[] AssignedVars[] [2021-05-02 23:05:16,487 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:05:16,503 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:16,508 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:16,517 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:16,519 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:16,521 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:05:16,532 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1104 1) v_main_~n~0_188) (not (= v_main_~i~0_1104 4))) InVars {main_~i~0=v_main_~i~0_1104, main_~n~0=v_main_~n~0_188} OutVars{main_~i~0=v_main_~i~0_1104, main_~n~0=v_main_~n~0_188} AuxVars[] AssignedVars[] [2021-05-02 23:05:16,534 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:05:16,535 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:16,537 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:16,550 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:05:16,557 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:05:16,590 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:05:16,617 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:16,619 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1106 4)) (<= v_main_~i~0_1106 v_main_~n~0_189)) InVars {main_~i~0=v_main_~i~0_1106, main_~n~0=v_main_~n~0_189} OutVars{main_~i~0=v_main_~i~0_1106, main_~n~0=v_main_~n~0_189} AuxVars[] AssignedVars[] [2021-05-02 23:05:16,620 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:05:16,636 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:16,641 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:16,653 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:16,660 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:16,679 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:05:16,708 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1108 4) (<= v_main_~i~0_1108 v_main_~n~0_190)) InVars {main_~i~0=v_main_~i~0_1108, main_~n~0=v_main_~n~0_190} OutVars{main_~i~0=v_main_~i~0_1108, main_~n~0=v_main_~n~0_190} AuxVars[] AssignedVars[] [2021-05-02 23:05:16,713 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:05:16,714 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:16,716 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:16,728 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:16,731 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:16,745 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:05:16,754 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:16,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:05:16,914 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:17,009 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:18,926 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:18,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1005495167] [2021-05-02 23:05:18,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1005495167] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:18,926 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:18,926 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2021-05-02 23:05:18,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118733341] [2021-05-02 23:05:18,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2021-05-02 23:05:18,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:18,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-05-02 23:05:18,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3857, Unknown=0, NotChecked=0, Total=4032 [2021-05-02 23:05:18,927 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 61 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 59 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:05:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:23,201 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2021-05-02 23:05:23,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-05-02 23:05:23,201 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 59 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:05:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:23,202 INFO L225 Difference]: With dead ends: 98 [2021-05-02 23:05:23,202 INFO L226 Difference]: Without dead ends: 93 [2021-05-02 23:05:23,203 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3329 ImplicationChecksByTransitivity, 4362.5ms TimeCoverageRelationStatistics Valid=434, Invalid=13372, Unknown=0, NotChecked=0, Total=13806 [2021-05-02 23:05:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-02 23:05:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-05-02 23:05:23,211 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:05:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2021-05-02 23:05:23,212 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 89 [2021-05-02 23:05:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:23,212 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2021-05-02 23:05:23,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 61 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 59 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:05:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2021-05-02 23:05:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-05-02 23:05:23,213 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:23,213 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 25, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:23,213 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2021-05-02 23:05:23,213 INFO L428 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:23,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1837278379, now seen corresponding path program 47 times [2021-05-02 23:05:23,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:23,213 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [357520474] [2021-05-02 23:05:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:23,220 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1138 4) (<= (+ v_main_~i~0_1138 1) v_main_~n~0_191)) InVars {main_~i~0=v_main_~i~0_1138, main_~n~0=v_main_~n~0_191} OutVars{main_~i~0=v_main_~i~0_1138, main_~n~0=v_main_~n~0_191} AuxVars[] AssignedVars[] [2021-05-02 23:05:23,222 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:05:23,238 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:23,239 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:23,250 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:23,253 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:23,255 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:05:23,266 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1140 4)) (<= (+ v_main_~i~0_1140 1) v_main_~n~0_192)) InVars {main_~i~0=v_main_~i~0_1140, main_~n~0=v_main_~n~0_192} OutVars{main_~i~0=v_main_~i~0_1140, main_~n~0=v_main_~n~0_192} AuxVars[] AssignedVars[] [2021-05-02 23:05:23,268 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:05:23,269 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:23,270 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:23,282 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:05:23,289 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:05:23,322 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:05:23,350 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:23,352 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1142 v_main_~n~0_193) (not (= v_main_~i~0_1142 4))) InVars {main_~i~0=v_main_~i~0_1142, main_~n~0=v_main_~n~0_193} OutVars{main_~i~0=v_main_~i~0_1142, main_~n~0=v_main_~n~0_193} AuxVars[] AssignedVars[] [2021-05-02 23:05:23,353 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:05:23,354 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:23,356 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:23,368 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:23,375 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:23,408 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:05:23,439 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1144 v_main_~n~0_194) (= v_main_~i~0_1144 4)) InVars {main_~i~0=v_main_~i~0_1144, main_~n~0=v_main_~n~0_194} OutVars{main_~i~0=v_main_~i~0_1144, main_~n~0=v_main_~n~0_194} AuxVars[] AssignedVars[] [2021-05-02 23:05:23,441 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:05:23,456 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:23,458 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:23,469 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:23,472 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:23,474 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:05:23,483 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:23,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:23,577 INFO 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:05:23,580 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:23,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:25,682 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:25,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [357520474] [2021-05-02 23:05:25,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [357520474] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:25,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:25,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2021-05-02 23:05:25,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31712098] [2021-05-02 23:05:25,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2021-05-02 23:05:25,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:25,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2021-05-02 23:05:25,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3976, Unknown=0, NotChecked=0, Total=4160 [2021-05-02 23:05:25,683 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 62 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 60 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:30,213 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2021-05-02 23:05:30,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-05-02 23:05:30,214 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 60 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2021-05-02 23:05:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:30,214 INFO L225 Difference]: With dead ends: 103 [2021-05-02 23:05:30,214 INFO L226 Difference]: Without dead ends: 95 [2021-05-02 23:05:30,215 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3636 ImplicationChecksByTransitivity, 4492.2ms TimeCoverageRelationStatistics Valid=453, Invalid=13827, Unknown=0, NotChecked=0, Total=14280 [2021-05-02 23:05:30,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-05-02 23:05:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2021-05-02 23:05:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2021-05-02 23:05:30,224 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2021-05-02 23:05:30,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:30,224 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2021-05-02 23:05:30,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 62 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 60 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2021-05-02 23:05:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-05-02 23:05:30,225 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:30,225 INFO L523 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:30,225 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2021-05-02 23:05:30,225 INFO L428 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:30,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:30,225 INFO L82 PathProgramCache]: Analyzing trace with hash -682681555, now seen corresponding path program 48 times [2021-05-02 23:05:30,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:30,225 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [686231360] [2021-05-02 23:05:30,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:30,232 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1174 4) (<= (+ v_main_~i~0_1174 1) v_main_~n~0_195)) InVars {main_~i~0=v_main_~i~0_1174, main_~n~0=v_main_~n~0_195} OutVars{main_~i~0=v_main_~i~0_1174, main_~n~0=v_main_~n~0_195} AuxVars[] AssignedVars[] [2021-05-02 23:05:30,234 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:05:30,250 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:30,252 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:30,262 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:30,265 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:30,267 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:05:30,278 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1176 1) v_main_~n~0_196) (not (= v_main_~i~0_1176 4))) InVars {main_~i~0=v_main_~i~0_1176, main_~n~0=v_main_~n~0_196} OutVars{main_~i~0=v_main_~i~0_1176, main_~n~0=v_main_~n~0_196} AuxVars[] AssignedVars[] [2021-05-02 23:05:30,279 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:05:30,280 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:30,282 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:30,294 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:05:30,302 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:05:30,340 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:05:30,371 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:30,374 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1178 v_main_~n~0_197) (not (= v_main_~i~0_1178 4))) InVars {main_~i~0=v_main_~i~0_1178, main_~n~0=v_main_~n~0_197} OutVars{main_~i~0=v_main_~i~0_1178, main_~n~0=v_main_~n~0_197} AuxVars[] AssignedVars[] [2021-05-02 23:05:30,375 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:05:30,377 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:30,379 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:30,393 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:30,400 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:30,439 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:05:30,469 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1180 v_main_~n~0_198) (= v_main_~i~0_1180 4)) InVars {main_~i~0=v_main_~i~0_1180, main_~n~0=v_main_~n~0_198} OutVars{main_~i~0=v_main_~i~0_1180, main_~n~0=v_main_~n~0_198} AuxVars[] AssignedVars[] [2021-05-02 23:05:30,471 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:05:30,487 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:30,501 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:30,513 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:30,516 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:30,518 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:05:30,528 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:30,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:05:30,614 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:30,724 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:32,782 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:32,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [686231360] [2021-05-02 23:05:32,782 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [686231360] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:32,782 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:32,782 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2021-05-02 23:05:32,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815860064] [2021-05-02 23:05:32,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2021-05-02 23:05:32,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:32,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-05-02 23:05:32,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4104, Unknown=0, NotChecked=0, Total=4290 [2021-05-02 23:05:32,783 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 63 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 61 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:37,531 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2021-05-02 23:05:37,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-05-02 23:05:37,532 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 61 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2021-05-02 23:05:37,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:37,532 INFO L225 Difference]: With dead ends: 101 [2021-05-02 23:05:37,532 INFO L226 Difference]: Without dead ends: 96 [2021-05-02 23:05:37,533 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3759 ImplicationChecksByTransitivity, 4682.4ms TimeCoverageRelationStatistics Valid=459, Invalid=14303, Unknown=0, NotChecked=0, Total=14762 [2021-05-02 23:05:37,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-05-02 23:05:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-05-02 23:05:37,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2021-05-02 23:05:37,558 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 92 [2021-05-02 23:05:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:37,559 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2021-05-02 23:05:37,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 63 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 61 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:05:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2021-05-02 23:05:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-02 23:05:37,559 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:37,559 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:37,559 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable245 [2021-05-02 23:05:37,559 INFO L428 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:37,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:37,560 INFO L82 PathProgramCache]: Analyzing trace with hash 453352968, now seen corresponding path program 49 times [2021-05-02 23:05:37,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:37,560 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1228031347] [2021-05-02 23:05:37,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:37,567 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1211 4) (<= (+ v_main_~i~0_1211 1) v_main_~n~0_199)) InVars {main_~i~0=v_main_~i~0_1211, main_~n~0=v_main_~n~0_199} OutVars{main_~i~0=v_main_~i~0_1211, main_~n~0=v_main_~n~0_199} AuxVars[] AssignedVars[] [2021-05-02 23:05:37,569 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:05:37,570 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:37,571 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:37,583 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:37,586 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:37,601 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:05:37,613 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1213 4)) (<= (+ v_main_~i~0_1213 1) v_main_~n~0_200)) InVars {main_~i~0=v_main_~i~0_1213, main_~n~0=v_main_~n~0_200} OutVars{main_~i~0=v_main_~i~0_1213, main_~n~0=v_main_~n~0_200} AuxVars[] AssignedVars[] [2021-05-02 23:05:37,615 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:05:37,616 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:37,617 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:37,632 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:05:37,640 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:05:37,677 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:05:37,707 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:37,710 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1215 4)) (<= v_main_~i~0_1215 v_main_~n~0_201)) InVars {main_~i~0=v_main_~i~0_1215, main_~n~0=v_main_~n~0_201} OutVars{main_~i~0=v_main_~i~0_1215, main_~n~0=v_main_~n~0_201} AuxVars[] AssignedVars[] [2021-05-02 23:05:37,711 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:05:37,729 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:37,731 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:37,744 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:37,752 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:37,773 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:05:37,804 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1217 v_main_~n~0_202) (= v_main_~i~0_1217 4)) InVars {main_~i~0=v_main_~i~0_1217, main_~n~0=v_main_~n~0_202} OutVars{main_~i~0=v_main_~i~0_1217, main_~n~0=v_main_~n~0_202} AuxVars[] AssignedVars[] [2021-05-02 23:05:37,806 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:05:37,807 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:37,809 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:37,821 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:37,823 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:37,838 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:05:37,848 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:37,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:37,993 INFO 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:05:37,996 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:38,105 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:40,455 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:40,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1228031347] [2021-05-02 23:05:40,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1228031347] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:40,456 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:40,456 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2021-05-02 23:05:40,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229878478] [2021-05-02 23:05:40,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-02 23:05:40,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:40,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-02 23:05:40,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=4239, Unknown=0, NotChecked=0, Total=4422 [2021-05-02 23:05:40,457 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 64 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 62 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:05:45,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:45,682 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2021-05-02 23:05:45,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-05-02 23:05:45,683 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 62 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:05:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:45,683 INFO L225 Difference]: With dead ends: 106 [2021-05-02 23:05:45,684 INFO L226 Difference]: Without dead ends: 98 [2021-05-02 23:05:45,684 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3649 ImplicationChecksByTransitivity, 5286.6ms TimeCoverageRelationStatistics Valid=456, Invalid=14796, Unknown=0, NotChecked=0, Total=15252 [2021-05-02 23:05:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-02 23:05:45,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2021-05-02 23:05:45,694 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:05:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2021-05-02 23:05:45,694 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2021-05-02 23:05:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:45,695 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2021-05-02 23:05:45,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 62 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:05:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2021-05-02 23:05:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-05-02 23:05:45,695 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:45,695 INFO L523 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:45,695 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2021-05-02 23:05:45,695 INFO L428 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:45,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:45,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2066606966, now seen corresponding path program 50 times [2021-05-02 23:05:45,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:45,696 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [595225118] [2021-05-02 23:05:45,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:45,704 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1248 4) (<= (+ v_main_~i~0_1248 1) v_main_~n~0_203)) InVars {main_~i~0=v_main_~i~0_1248, main_~n~0=v_main_~n~0_203} OutVars{main_~i~0=v_main_~i~0_1248, main_~n~0=v_main_~n~0_203} AuxVars[] AssignedVars[] [2021-05-02 23:05:45,706 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:05:45,725 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:45,727 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:45,743 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:45,746 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:45,749 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:05:45,764 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1250 4)) (<= (+ v_main_~i~0_1250 1) v_main_~n~0_204)) InVars {main_~i~0=v_main_~i~0_1250, main_~n~0=v_main_~n~0_204} OutVars{main_~i~0=v_main_~i~0_1250, main_~n~0=v_main_~n~0_204} AuxVars[] AssignedVars[] [2021-05-02 23:05:45,766 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:05:45,787 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:45,789 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:45,804 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:05:45,813 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:05:45,838 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:05:45,876 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:45,879 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1252 4)) (<= v_main_~i~0_1252 v_main_~n~0_205)) InVars {main_~i~0=v_main_~i~0_1252, main_~n~0=v_main_~n~0_205} OutVars{main_~i~0=v_main_~i~0_1252, main_~n~0=v_main_~n~0_205} AuxVars[] AssignedVars[] [2021-05-02 23:05:45,881 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:05:45,882 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:45,884 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:45,911 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:45,921 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:45,968 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:05:46,010 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1254 v_main_~n~0_206) (= v_main_~i~0_1254 4)) InVars {main_~i~0=v_main_~i~0_1254, main_~n~0=v_main_~n~0_206} OutVars{main_~i~0=v_main_~i~0_1254, main_~n~0=v_main_~n~0_206} AuxVars[] AssignedVars[] [2021-05-02 23:05:46,012 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:05:46,013 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:46,015 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:46,031 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:46,034 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:46,051 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:05:46,064 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:46,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:46,174 INFO 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:05:46,177 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:46,299 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:48,833 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:48,833 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [595225118] [2021-05-02 23:05:48,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [595225118] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:48,833 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:48,833 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2021-05-02 23:05:48,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839583729] [2021-05-02 23:05:48,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2021-05-02 23:05:48,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:48,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-05-02 23:05:48,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=4390, Unknown=0, NotChecked=0, Total=4556 [2021-05-02 23:05:48,834 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 65 states, 64 states have (on average 1.421875) internal successors, (91), 63 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:05:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:05:54,690 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2021-05-02 23:05:54,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-05-02 23:05:54,691 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.421875) internal successors, (91), 63 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:05:54,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:05:54,692 INFO L225 Difference]: With dead ends: 104 [2021-05-02 23:05:54,692 INFO L226 Difference]: Without dead ends: 99 [2021-05-02 23:05:54,693 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3092 ImplicationChecksByTransitivity, 5956.3ms TimeCoverageRelationStatistics Valid=424, Invalid=15326, Unknown=0, NotChecked=0, Total=15750 [2021-05-02 23:05:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-02 23:05:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-05-02 23:05:54,703 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:05:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2021-05-02 23:05:54,704 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 95 [2021-05-02 23:05:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:05:54,704 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2021-05-02 23:05:54,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 65 states, 64 states have (on average 1.421875) internal successors, (91), 63 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:05:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2021-05-02 23:05:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-05-02 23:05:54,704 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:05:54,704 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 27, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:05:54,705 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2021-05-02 23:05:54,705 INFO L428 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:05:54,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:05:54,705 INFO L82 PathProgramCache]: Analyzing trace with hash -677491829, now seen corresponding path program 51 times [2021-05-02 23:05:54,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:05:54,705 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1838574112] [2021-05-02 23:05:54,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:05:54,714 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1286 1) v_main_~n~0_207) (= v_main_~i~0_1286 4)) InVars {main_~i~0=v_main_~i~0_1286, main_~n~0=v_main_~n~0_207} OutVars{main_~i~0=v_main_~i~0_1286, main_~n~0=v_main_~n~0_207} AuxVars[] AssignedVars[] [2021-05-02 23:05:54,716 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:05:54,717 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:54,719 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:54,739 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:54,742 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:54,759 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:05:54,776 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1288 4)) (<= (+ v_main_~i~0_1288 1) v_main_~n~0_208)) InVars {main_~i~0=v_main_~i~0_1288, main_~n~0=v_main_~n~0_208} OutVars{main_~i~0=v_main_~i~0_1288, main_~n~0=v_main_~n~0_208} AuxVars[] AssignedVars[] [2021-05-02 23:05:54,778 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:05:54,779 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:54,781 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:54,795 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:05:54,805 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:05:54,845 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:05:54,883 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:54,886 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1290 4)) (<= v_main_~i~0_1290 v_main_~n~0_209)) InVars {main_~i~0=v_main_~i~0_1290, main_~n~0=v_main_~n~0_209} OutVars{main_~i~0=v_main_~i~0_1290, main_~n~0=v_main_~n~0_209} AuxVars[] AssignedVars[] [2021-05-02 23:05:54,888 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:05:54,889 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:54,891 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:54,908 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:05:54,917 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:05:54,958 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:05:54,999 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1292 4) (<= v_main_~i~0_1292 v_main_~n~0_210)) InVars {main_~i~0=v_main_~i~0_1292, main_~n~0=v_main_~n~0_210} OutVars{main_~i~0=v_main_~i~0_1292, main_~n~0=v_main_~n~0_210} AuxVars[] AssignedVars[] [2021-05-02 23:05:55,001 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:05:55,023 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:55,025 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:05:55,040 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:05:55,044 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:05:55,046 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:05:55,059 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:05:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:55,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:05:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:05:55,153 INFO 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:05:55,157 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:05:58,030 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:05:58,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1838574112] [2021-05-02 23:05:58,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1838574112] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:05:58,030 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:05:58,030 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2021-05-02 23:05:58,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240918110] [2021-05-02 23:05:58,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2021-05-02 23:05:58,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:05:58,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-05-02 23:05:58,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=4498, Unknown=0, NotChecked=0, Total=4692 [2021-05-02 23:05:58,031 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 66 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 64 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:06:04,382 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2021-05-02 23:06:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-05-02 23:06:04,383 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 64 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2021-05-02 23:06:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:06:04,384 INFO L225 Difference]: With dead ends: 109 [2021-05-02 23:06:04,384 INFO L226 Difference]: Without dead ends: 101 [2021-05-02 23:06:04,385 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4093 ImplicationChecksByTransitivity, 6161.5ms TimeCoverageRelationStatistics Valid=481, Invalid=15775, Unknown=0, NotChecked=0, Total=16256 [2021-05-02 23:06:04,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-02 23:06:04,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2021-05-02 23:06:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.0210526315789474) internal successors, (97), 95 states have internal predecessors, (97), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2021-05-02 23:06:04,399 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2021-05-02 23:06:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:06:04,399 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2021-05-02 23:06:04,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 66 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 64 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2021-05-02 23:06:04,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-05-02 23:06:04,400 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:06:04,400 INFO L523 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:06:04,400 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2021-05-02 23:06:04,400 INFO L428 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:06:04,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:06:04,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1097515533, now seen corresponding path program 52 times [2021-05-02 23:06:04,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:06:04,400 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [210293576] [2021-05-02 23:06:04,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:06:04,409 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1324 4) (<= (+ v_main_~i~0_1324 1) v_main_~n~0_211)) InVars {main_~i~0=v_main_~i~0_1324, main_~n~0=v_main_~n~0_211} OutVars{main_~i~0=v_main_~i~0_1324, main_~n~0=v_main_~n~0_211} AuxVars[] AssignedVars[] [2021-05-02 23:06:04,411 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:06:04,413 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:04,415 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:04,428 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:04,431 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:04,450 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:06:04,465 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1326 4)) (<= (+ v_main_~i~0_1326 1) v_main_~n~0_212)) InVars {main_~i~0=v_main_~i~0_1326, main_~n~0=v_main_~n~0_212} OutVars{main_~i~0=v_main_~i~0_1326, main_~n~0=v_main_~n~0_212} AuxVars[] AssignedVars[] [2021-05-02 23:06:04,466 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:06:04,468 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:04,470 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:04,485 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:06:04,495 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:06:04,537 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:06:04,576 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:04,579 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1328 v_main_~n~0_213) (not (= v_main_~i~0_1328 4))) InVars {main_~i~0=v_main_~i~0_1328, main_~n~0=v_main_~n~0_213} OutVars{main_~i~0=v_main_~i~0_1328, main_~n~0=v_main_~n~0_213} AuxVars[] AssignedVars[] [2021-05-02 23:06:04,581 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:06:04,582 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:04,584 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:04,599 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:04,608 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:04,653 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:06:04,693 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1330 v_main_~n~0_214) (= v_main_~i~0_1330 4)) InVars {main_~i~0=v_main_~i~0_1330, main_~n~0=v_main_~n~0_214} OutVars{main_~i~0=v_main_~i~0_1330, main_~n~0=v_main_~n~0_214} AuxVars[] AssignedVars[] [2021-05-02 23:06:04,694 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:06:04,695 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:04,697 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:04,711 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:06:04,714 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:06:04,729 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:06:04,740 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:04,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:06:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:04,846 INFO 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:06:04,850 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:06:04,988 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:06:08,439 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:06:08,439 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [210293576] [2021-05-02 23:06:08,439 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [210293576] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:06:08,439 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:06:08,439 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2021-05-02 23:06:08,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556517069] [2021-05-02 23:06:08,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2021-05-02 23:06:08,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:06:08,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2021-05-02 23:06:08,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=4634, Unknown=0, NotChecked=0, Total=4830 [2021-05-02 23:06:08,441 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 67 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 65 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:06:15,004 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2021-05-02 23:06:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-05-02 23:06:15,005 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 65 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2021-05-02 23:06:15,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:06:15,006 INFO L225 Difference]: With dead ends: 107 [2021-05-02 23:06:15,006 INFO L226 Difference]: Without dead ends: 102 [2021-05-02 23:06:15,006 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4302 ImplicationChecksByTransitivity, 7020.3ms TimeCoverageRelationStatistics Valid=487, Invalid=16283, Unknown=0, NotChecked=0, Total=16770 [2021-05-02 23:06:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-05-02 23:06:15,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-05-02 23:06:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2021-05-02 23:06:15,025 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 98 [2021-05-02 23:06:15,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:06:15,026 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2021-05-02 23:06:15,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 67 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 65 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2021-05-02 23:06:15,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-05-02 23:06:15,026 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:06:15,026 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 28, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:06:15,026 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265 [2021-05-02 23:06:15,026 INFO L428 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:06:15,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:06:15,027 INFO L82 PathProgramCache]: Analyzing trace with hash 48630568, now seen corresponding path program 53 times [2021-05-02 23:06:15,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:06:15,027 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [737933529] [2021-05-02 23:06:15,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:06:15,035 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1363 1) v_main_~n~0_215) (= v_main_~i~0_1363 4)) InVars {main_~i~0=v_main_~i~0_1363, main_~n~0=v_main_~n~0_215} OutVars{main_~i~0=v_main_~i~0_1363, main_~n~0=v_main_~n~0_215} AuxVars[] AssignedVars[] [2021-05-02 23:06:15,037 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:06:15,038 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:15,041 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:15,062 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:15,065 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:15,086 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:06:15,103 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1365 4)) (<= (+ v_main_~i~0_1365 1) v_main_~n~0_216)) InVars {main_~i~0=v_main_~i~0_1365, main_~n~0=v_main_~n~0_216} OutVars{main_~i~0=v_main_~i~0_1365, main_~n~0=v_main_~n~0_216} AuxVars[] AssignedVars[] [2021-05-02 23:06:15,105 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:06:15,107 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:15,109 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:15,126 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:06:15,137 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:06:15,184 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:06:15,226 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:15,229 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1367 4)) (<= v_main_~i~0_1367 v_main_~n~0_217)) InVars {main_~i~0=v_main_~i~0_1367, main_~n~0=v_main_~n~0_217} OutVars{main_~i~0=v_main_~i~0_1367, main_~n~0=v_main_~n~0_217} AuxVars[] AssignedVars[] [2021-05-02 23:06:15,231 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:06:15,252 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:15,254 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:15,271 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:15,280 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:15,307 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:06:15,350 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1369 v_main_~n~0_218) (= v_main_~i~0_1369 4)) InVars {main_~i~0=v_main_~i~0_1369, main_~n~0=v_main_~n~0_218} OutVars{main_~i~0=v_main_~i~0_1369, main_~n~0=v_main_~n~0_218} AuxVars[] AssignedVars[] [2021-05-02 23:06:15,352 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:06:15,353 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:15,355 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:15,372 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:06:15,375 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:06:15,393 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:06:15,404 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:15,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:06:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:06:15,515 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:06:15,634 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:06:18,743 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:06:18,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [737933529] [2021-05-02 23:06:18,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [737933529] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:06:18,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:06:18,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2021-05-02 23:06:18,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787173587] [2021-05-02 23:06:18,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2021-05-02 23:06:18,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:06:18,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2021-05-02 23:06:18,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=4798, Unknown=0, NotChecked=0, Total=4970 [2021-05-02 23:06:18,745 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand has 68 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 66 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:06:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:06:26,076 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2021-05-02 23:06:26,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-05-02 23:06:26,077 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 66 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:06:26,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:06:26,078 INFO L225 Difference]: With dead ends: 112 [2021-05-02 23:06:26,078 INFO L226 Difference]: Without dead ends: 104 [2021-05-02 23:06:26,079 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3359 ImplicationChecksByTransitivity, 7290.4ms TimeCoverageRelationStatistics Valid=442, Invalid=16850, Unknown=0, NotChecked=0, Total=17292 [2021-05-02 23:06:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-05-02 23:06:26,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2021-05-02 23:06:26,090 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:06:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2021-05-02 23:06:26,090 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 101 [2021-05-02 23:06:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:06:26,090 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2021-05-02 23:06:26,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 68 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 66 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:06:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2021-05-02 23:06:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-05-02 23:06:26,091 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:06:26,091 INFO L523 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:06:26,091 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2021-05-02 23:06:26,091 INFO L428 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:06:26,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:06:26,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1823637930, now seen corresponding path program 54 times [2021-05-02 23:06:26,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:06:26,091 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [293072079] [2021-05-02 23:06:26,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:06:26,100 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1402 4) (<= (+ v_main_~i~0_1402 1) v_main_~n~0_219)) InVars {main_~i~0=v_main_~i~0_1402, main_~n~0=v_main_~n~0_219} OutVars{main_~i~0=v_main_~i~0_1402, main_~n~0=v_main_~n~0_219} AuxVars[] AssignedVars[] [2021-05-02 23:06:26,102 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:06:26,123 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:26,125 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:26,140 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:26,144 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:26,147 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:06:26,163 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1404 1) v_main_~n~0_220) (not (= v_main_~i~0_1404 4))) InVars {main_~i~0=v_main_~i~0_1404, main_~n~0=v_main_~n~0_220} OutVars{main_~i~0=v_main_~i~0_1404, main_~n~0=v_main_~n~0_220} AuxVars[] AssignedVars[] [2021-05-02 23:06:26,165 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:06:26,166 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:26,168 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:26,184 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:06:26,193 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:06:26,239 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:06:26,278 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:26,281 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1406 4)) (<= v_main_~i~0_1406 v_main_~n~0_221)) InVars {main_~i~0=v_main_~i~0_1406, main_~n~0=v_main_~n~0_221} OutVars{main_~i~0=v_main_~i~0_1406, main_~n~0=v_main_~n~0_221} AuxVars[] AssignedVars[] [2021-05-02 23:06:26,283 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:06:26,305 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:26,307 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:26,321 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:26,330 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:26,360 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:06:26,402 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1408 4) (<= v_main_~i~0_1408 v_main_~n~0_222)) InVars {main_~i~0=v_main_~i~0_1408, main_~n~0=v_main_~n~0_222} OutVars{main_~i~0=v_main_~i~0_1408, main_~n~0=v_main_~n~0_222} AuxVars[] AssignedVars[] [2021-05-02 23:06:26,404 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:06:26,427 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:26,429 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:26,442 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:06:26,445 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:06:26,448 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:06:26,462 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:26,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:06:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:06:26,585 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:06:26,718 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:06:30,219 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:06:30,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [293072079] [2021-05-02 23:06:30,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [293072079] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:06:30,220 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:06:30,220 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2021-05-02 23:06:30,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268180578] [2021-05-02 23:06:30,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2021-05-02 23:06:30,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:06:30,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2021-05-02 23:06:30,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=4938, Unknown=0, NotChecked=0, Total=5112 [2021-05-02 23:06:30,221 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 69 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 67 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:06:30,539 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2021-05-02 23:06:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:06:38,251 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2021-05-02 23:06:38,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-05-02 23:06:38,252 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 67 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:06:38,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:06:38,253 INFO L225 Difference]: With dead ends: 110 [2021-05-02 23:06:38,253 INFO L226 Difference]: Without dead ends: 105 [2021-05-02 23:06:38,254 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3510 ImplicationChecksByTransitivity, 8068.8ms TimeCoverageRelationStatistics Valid=448, Invalid=17374, Unknown=0, NotChecked=0, Total=17822 [2021-05-02 23:06:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-05-02 23:06:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-05-02 23:06:38,264 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:06:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2021-05-02 23:06:38,265 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 101 [2021-05-02 23:06:38,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:06:38,265 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2021-05-02 23:06:38,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 69 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 67 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:06:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2021-05-02 23:06:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-05-02 23:06:38,265 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:06:38,265 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 29, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:06:38,266 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2021-05-02 23:06:38,266 INFO L428 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:06:38,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:06:38,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1789310357, now seen corresponding path program 55 times [2021-05-02 23:06:38,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:06:38,266 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1236769352] [2021-05-02 23:06:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:06:38,277 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1442 1) v_main_~n~0_223) (= v_main_~i~0_1442 4)) InVars {main_~i~0=v_main_~i~0_1442, main_~n~0=v_main_~n~0_223} OutVars{main_~i~0=v_main_~i~0_1442, main_~n~0=v_main_~n~0_223} AuxVars[] AssignedVars[] [2021-05-02 23:06:38,279 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:06:38,304 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:38,307 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:38,325 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:38,329 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:38,333 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:06:38,354 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1444 1) v_main_~n~0_224) (not (= v_main_~i~0_1444 4))) InVars {main_~i~0=v_main_~i~0_1444, main_~n~0=v_main_~n~0_224} OutVars{main_~i~0=v_main_~i~0_1444, main_~n~0=v_main_~n~0_224} AuxVars[] AssignedVars[] [2021-05-02 23:06:38,356 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:06:38,357 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:38,359 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:38,380 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:06:38,396 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:06:38,454 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:06:38,503 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:38,507 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1446 v_main_~n~0_225) (not (= v_main_~i~0_1446 4))) InVars {main_~i~0=v_main_~i~0_1446, main_~n~0=v_main_~n~0_225} OutVars{main_~i~0=v_main_~i~0_1446, main_~n~0=v_main_~n~0_225} AuxVars[] AssignedVars[] [2021-05-02 23:06:38,509 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:06:38,535 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:38,537 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:38,556 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:38,567 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:38,599 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:06:38,648 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1448 v_main_~n~0_226) (= v_main_~i~0_1448 4)) InVars {main_~i~0=v_main_~i~0_1448, main_~n~0=v_main_~n~0_226} OutVars{main_~i~0=v_main_~i~0_1448, main_~n~0=v_main_~n~0_226} AuxVars[] AssignedVars[] [2021-05-02 23:06:38,650 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:06:38,672 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:38,674 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:38,689 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:06:38,692 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:06:38,695 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:06:38,708 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:38,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:06:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:38,859 INFO 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:06:38,863 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:06:42,921 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:06:42,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1236769352] [2021-05-02 23:06:42,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1236769352] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:06:42,921 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:06:42,921 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2021-05-02 23:06:42,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361515381] [2021-05-02 23:06:42,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2021-05-02 23:06:42,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:06:42,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-05-02 23:06:42,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=5080, Unknown=0, NotChecked=0, Total=5256 [2021-05-02 23:06:42,922 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 70 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 68 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:43,245 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2021-05-02 23:06:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:06:51,817 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2021-05-02 23:06:51,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-05-02 23:06:51,818 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 68 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2021-05-02 23:06:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:06:51,819 INFO L225 Difference]: With dead ends: 115 [2021-05-02 23:06:51,819 INFO L226 Difference]: Without dead ends: 107 [2021-05-02 23:06:51,820 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 8931.6ms TimeCoverageRelationStatistics Valid=454, Invalid=17906, Unknown=0, NotChecked=0, Total=18360 [2021-05-02 23:06:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-05-02 23:06:51,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2021-05-02 23:06:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.0198019801980198) internal successors, (103), 101 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2021-05-02 23:06:51,831 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2021-05-02 23:06:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:06:51,831 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2021-05-02 23:06:51,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 70 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 68 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2021-05-02 23:06:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-05-02 23:06:51,832 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:06:51,832 INFO L523 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:06:51,832 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2021-05-02 23:06:51,832 INFO L428 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:06:51,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:06:51,832 INFO L82 PathProgramCache]: Analyzing trace with hash -14302995, now seen corresponding path program 56 times [2021-05-02 23:06:51,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:06:51,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1143867840] [2021-05-02 23:06:51,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:06:51,846 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1482 4) (<= (+ v_main_~i~0_1482 1) v_main_~n~0_227)) InVars {main_~i~0=v_main_~i~0_1482, main_~n~0=v_main_~n~0_227} OutVars{main_~i~0=v_main_~i~0_1482, main_~n~0=v_main_~n~0_227} AuxVars[] AssignedVars[] [2021-05-02 23:06:51,848 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:06:51,869 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:51,871 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:51,887 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:51,890 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:51,894 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:06:51,912 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1484 4)) (<= (+ v_main_~i~0_1484 1) v_main_~n~0_228)) InVars {main_~i~0=v_main_~i~0_1484, main_~n~0=v_main_~n~0_228} OutVars{main_~i~0=v_main_~i~0_1484, main_~n~0=v_main_~n~0_228} AuxVars[] AssignedVars[] [2021-05-02 23:06:51,914 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:06:51,916 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:51,918 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:51,935 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:06:51,943 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:06:51,993 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:06:52,036 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:52,040 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1486 v_main_~n~0_229) (not (= v_main_~i~0_1486 4))) InVars {main_~i~0=v_main_~i~0_1486, main_~n~0=v_main_~n~0_229} OutVars{main_~i~0=v_main_~i~0_1486, main_~n~0=v_main_~n~0_229} AuxVars[] AssignedVars[] [2021-05-02 23:06:52,042 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:06:52,043 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:52,046 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:52,062 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:06:52,072 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:06:52,121 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:06:52,171 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1488 4) (<= v_main_~i~0_1488 v_main_~n~0_230)) InVars {main_~i~0=v_main_~i~0_1488, main_~n~0=v_main_~n~0_230} OutVars{main_~i~0=v_main_~i~0_1488, main_~n~0=v_main_~n~0_230} AuxVars[] AssignedVars[] [2021-05-02 23:06:52,173 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:06:52,174 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:52,176 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:06:52,190 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:06:52,194 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:06:52,213 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:06:52,227 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:06:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:52,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:06:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:06:52,374 INFO 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:06:52,377 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:06:56,465 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:06:56,466 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1143867840] [2021-05-02 23:06:56,466 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1143867840] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:06:56,466 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:06:56,466 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2021-05-02 23:06:56,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149022342] [2021-05-02 23:06:56,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2021-05-02 23:06:56,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:06:56,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2021-05-02 23:06:56,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=5196, Unknown=0, NotChecked=0, Total=5402 [2021-05-02 23:06:56,467 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 71 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 69 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:06:56,789 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-05-02 23:07:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:07:05,382 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2021-05-02 23:07:05,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-05-02 23:07:05,384 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 69 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2021-05-02 23:07:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:07:05,384 INFO L225 Difference]: With dead ends: 113 [2021-05-02 23:07:05,384 INFO L226 Difference]: Without dead ends: 108 [2021-05-02 23:07:05,385 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4793 ImplicationChecksByTransitivity, 8644.7ms TimeCoverageRelationStatistics Valid=515, Invalid=18391, Unknown=0, NotChecked=0, Total=18906 [2021-05-02 23:07:05,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-05-02 23:07:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-05-02 23:07:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.0194174757281553) internal successors, (105), 103 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:07:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2021-05-02 23:07:05,397 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 104 [2021-05-02 23:07:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:07:05,397 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2021-05-02 23:07:05,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 71 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 69 states have internal predecessors, (100), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:07:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2021-05-02 23:07:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-02 23:07:05,398 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:07:05,398 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:07:05,398 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable285 [2021-05-02 23:07:05,398 INFO L428 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:07:05,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:07:05,398 INFO L82 PathProgramCache]: Analyzing trace with hash 650649672, now seen corresponding path program 57 times [2021-05-02 23:07:05,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:07:05,399 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [486921460] [2021-05-02 23:07:05,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:07:05,416 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1523 4) (<= (+ v_main_~i~0_1523 1) v_main_~n~0_231)) InVars {main_~i~0=v_main_~i~0_1523, main_~n~0=v_main_~n~0_231} OutVars{main_~i~0=v_main_~i~0_1523, main_~n~0=v_main_~n~0_231} AuxVars[] AssignedVars[] [2021-05-02 23:07:05,418 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:07:05,443 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:05,445 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:05,464 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:07:05,468 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:07:05,471 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:07:05,490 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1525 4)) (<= (+ v_main_~i~0_1525 1) v_main_~n~0_232)) InVars {main_~i~0=v_main_~i~0_1525, main_~n~0=v_main_~n~0_232} OutVars{main_~i~0=v_main_~i~0_1525, main_~n~0=v_main_~n~0_232} AuxVars[] AssignedVars[] [2021-05-02 23:07:05,492 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:07:05,493 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:05,498 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:05,516 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:07:05,527 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:07:05,582 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:07:05,629 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:07:05,633 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1527 v_main_~n~0_233) (not (= v_main_~i~0_1527 4))) InVars {main_~i~0=v_main_~i~0_1527, main_~n~0=v_main_~n~0_233} OutVars{main_~i~0=v_main_~i~0_1527, main_~n~0=v_main_~n~0_233} AuxVars[] AssignedVars[] [2021-05-02 23:07:05,635 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:07:05,636 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:05,640 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:05,658 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:07:05,670 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:07:05,716 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:07:05,766 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1529 4) (<= v_main_~i~0_1529 v_main_~n~0_234)) InVars {main_~i~0=v_main_~i~0_1529, main_~n~0=v_main_~n~0_234} OutVars{main_~i~0=v_main_~i~0_1529, main_~n~0=v_main_~n~0_234} AuxVars[] AssignedVars[] [2021-05-02 23:07:05,768 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:07:05,769 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:05,772 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:05,790 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:07:05,794 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:07:05,817 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:07:05,835 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:07:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:05,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:07:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:05,972 INFO 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:07:05,976 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:07:06,146 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:07:10,634 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:07:10,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [486921460] [2021-05-02 23:07:10,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [486921460] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:07:10,635 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:07:10,635 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2021-05-02 23:07:10,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145483120] [2021-05-02 23:07:10,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2021-05-02 23:07:10,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:07:10,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2021-05-02 23:07:10,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=5341, Unknown=0, NotChecked=0, Total=5550 [2021-05-02 23:07:10,636 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand has 72 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 70 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:07:11,021 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-05-02 23:07:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:07:19,983 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2021-05-02 23:07:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-05-02 23:07:19,984 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 70 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:07:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:07:19,985 INFO L225 Difference]: With dead ends: 118 [2021-05-02 23:07:19,985 INFO L226 Difference]: Without dead ends: 110 [2021-05-02 23:07:19,986 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4902 ImplicationChecksByTransitivity, 9393.8ms TimeCoverageRelationStatistics Valid=523, Invalid=18937, Unknown=0, NotChecked=0, Total=19460 [2021-05-02 23:07:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-05-02 23:07:19,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2021-05-02 23:07:19,997 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:07:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2021-05-02 23:07:19,997 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2021-05-02 23:07:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:07:19,998 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2021-05-02 23:07:19,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 72 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 70 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:07:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2021-05-02 23:07:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-05-02 23:07:19,998 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:07:19,998 INFO L523 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:07:19,998 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290 [2021-05-02 23:07:19,998 INFO L428 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:07:19,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:07:19,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1869310262, now seen corresponding path program 58 times [2021-05-02 23:07:19,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:07:19,999 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1571356406] [2021-05-02 23:07:19,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:07:20,009 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1564 1) v_main_~n~0_235) (= v_main_~i~0_1564 4)) InVars {main_~i~0=v_main_~i~0_1564, main_~n~0=v_main_~n~0_235} OutVars{main_~i~0=v_main_~i~0_1564, main_~n~0=v_main_~n~0_235} AuxVars[] AssignedVars[] [2021-05-02 23:07:20,011 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:07:20,012 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:20,015 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:20,030 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:07:20,034 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:07:20,056 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:07:20,075 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1566 1) v_main_~n~0_236) (not (= v_main_~i~0_1566 4))) InVars {main_~i~0=v_main_~i~0_1566, main_~n~0=v_main_~n~0_236} OutVars{main_~i~0=v_main_~i~0_1566, main_~n~0=v_main_~n~0_236} AuxVars[] AssignedVars[] [2021-05-02 23:07:20,077 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:07:20,101 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:20,103 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:20,122 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:07:20,133 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:07:20,163 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:07:20,211 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:07:20,215 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1568 v_main_~n~0_237) (not (= v_main_~i~0_1568 4))) InVars {main_~i~0=v_main_~i~0_1568, main_~n~0=v_main_~n~0_237} OutVars{main_~i~0=v_main_~i~0_1568, main_~n~0=v_main_~n~0_237} AuxVars[] AssignedVars[] [2021-05-02 23:07:20,217 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:07:20,218 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:20,220 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:20,239 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:07:20,249 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:07:20,304 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:07:20,352 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1570 4) (<= v_main_~i~0_1570 v_main_~n~0_238)) InVars {main_~i~0=v_main_~i~0_1570, main_~n~0=v_main_~n~0_238} OutVars{main_~i~0=v_main_~i~0_1570, main_~n~0=v_main_~n~0_238} AuxVars[] AssignedVars[] [2021-05-02 23:07:20,354 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:07:20,379 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:20,382 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:20,399 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:07:20,402 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:07:20,406 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:07:20,422 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:07:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:20,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:07:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:20,575 INFO 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:07:20,579 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:07:25,377 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:07:25,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1571356406] [2021-05-02 23:07:25,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1571356406] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:07:25,377 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:07:25,377 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [73] imperfect sequences [] total 73 [2021-05-02 23:07:25,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262226978] [2021-05-02 23:07:25,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2021-05-02 23:07:25,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:07:25,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-05-02 23:07:25,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=5518, Unknown=0, NotChecked=0, Total=5700 [2021-05-02 23:07:25,378 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 73 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 71 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:07:25,725 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2021-05-02 23:07:35,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:07:35,726 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2021-05-02 23:07:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2021-05-02 23:07:35,728 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 71 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:07:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:07:35,729 INFO L225 Difference]: With dead ends: 116 [2021-05-02 23:07:35,729 INFO L226 Difference]: Without dead ends: 111 [2021-05-02 23:07:35,729 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3886 ImplicationChecksByTransitivity, 10407.3ms TimeCoverageRelationStatistics Valid=472, Invalid=19550, Unknown=0, NotChecked=0, Total=20022 [2021-05-02 23:07:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-05-02 23:07:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-05-02 23:07:35,741 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:07:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2021-05-02 23:07:35,742 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 107 [2021-05-02 23:07:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:07:35,742 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2021-05-02 23:07:35,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 73 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 71 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:07:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2021-05-02 23:07:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-05-02 23:07:35,742 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:07:35,742 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:07:35,743 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable295 [2021-05-02 23:07:35,743 INFO L428 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:07:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:07:35,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1473356107, now seen corresponding path program 59 times [2021-05-02 23:07:35,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:07:35,743 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [486706903] [2021-05-02 23:07:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:07:35,753 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1606 1) v_main_~n~0_239) (= v_main_~i~0_1606 4)) InVars {main_~i~0=v_main_~i~0_1606, main_~n~0=v_main_~n~0_239} OutVars{main_~i~0=v_main_~i~0_1606, main_~n~0=v_main_~n~0_239} AuxVars[] AssignedVars[] [2021-05-02 23:07:35,755 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:07:35,757 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:35,759 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:35,776 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:07:35,780 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:07:35,801 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:07:35,822 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1608 4)) (<= (+ v_main_~i~0_1608 1) v_main_~n~0_240)) InVars {main_~i~0=v_main_~i~0_1608, main_~n~0=v_main_~n~0_240} OutVars{main_~i~0=v_main_~i~0_1608, main_~n~0=v_main_~n~0_240} AuxVars[] AssignedVars[] [2021-05-02 23:07:35,824 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:07:35,826 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:35,828 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:35,851 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:07:35,863 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:07:35,918 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:07:35,966 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:07:35,970 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1610 4)) (<= v_main_~i~0_1610 v_main_~n~0_241)) InVars {main_~i~0=v_main_~i~0_1610, main_~n~0=v_main_~n~0_241} OutVars{main_~i~0=v_main_~i~0_1610, main_~n~0=v_main_~n~0_241} AuxVars[] AssignedVars[] [2021-05-02 23:07:35,972 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:07:35,974 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:35,976 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:35,997 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:07:36,009 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:07:36,064 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:07:36,119 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1612 4) (<= v_main_~i~0_1612 v_main_~n~0_242)) InVars {main_~i~0=v_main_~i~0_1612, main_~n~0=v_main_~n~0_242} OutVars{main_~i~0=v_main_~i~0_1612, main_~n~0=v_main_~n~0_242} AuxVars[] AssignedVars[] [2021-05-02 23:07:36,121 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:07:36,122 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:36,125 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:36,145 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:07:36,150 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:07:36,173 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:07:36,189 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:07:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:36,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:07:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:36,333 INFO 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:07:36,338 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:07:41,198 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:07:41,198 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [486706903] [2021-05-02 23:07:41,198 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [486706903] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:07:41,199 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:07:41,199 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2021-05-02 23:07:41,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172057051] [2021-05-02 23:07:41,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2021-05-02 23:07:41,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:07:41,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2021-05-02 23:07:41,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=5638, Unknown=0, NotChecked=0, Total=5852 [2021-05-02 23:07:41,200 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 74 states, 73 states have (on average 1.452054794520548) internal successors, (106), 72 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:07:41,578 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-05-02 23:07:51,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:07:51,795 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2021-05-02 23:07:51,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2021-05-02 23:07:51,796 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 1.452054794520548) internal successors, (106), 72 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2021-05-02 23:07:51,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:07:51,797 INFO L225 Difference]: With dead ends: 121 [2021-05-02 23:07:51,797 INFO L226 Difference]: Without dead ends: 113 [2021-05-02 23:07:51,798 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5183 ImplicationChecksByTransitivity, 10216.4ms TimeCoverageRelationStatistics Valid=537, Invalid=20055, Unknown=0, NotChecked=0, Total=20592 [2021-05-02 23:07:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-05-02 23:07:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2021-05-02 23:07:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:07:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2021-05-02 23:07:51,811 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2021-05-02 23:07:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:07:51,816 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2021-05-02 23:07:51,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 74 states, 73 states have (on average 1.452054794520548) internal successors, (106), 72 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:07:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2021-05-02 23:07:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-05-02 23:07:51,816 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:07:51,816 INFO L523 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:07:51,817 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2021-05-02 23:07:51,817 INFO L428 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:07:51,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:07:51,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1046603827, now seen corresponding path program 60 times [2021-05-02 23:07:51,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:07:51,817 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1914870300] [2021-05-02 23:07:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:07:51,828 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1648 4) (<= (+ v_main_~i~0_1648 1) v_main_~n~0_243)) InVars {main_~i~0=v_main_~i~0_1648, main_~n~0=v_main_~n~0_243} OutVars{main_~i~0=v_main_~i~0_1648, main_~n~0=v_main_~n~0_243} AuxVars[] AssignedVars[] [2021-05-02 23:07:51,830 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:07:51,857 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:51,859 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:51,877 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:07:51,881 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:07:51,884 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:07:51,904 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1650 4)) (<= (+ v_main_~i~0_1650 1) v_main_~n~0_244)) InVars {main_~i~0=v_main_~i~0_1650, main_~n~0=v_main_~n~0_244} OutVars{main_~i~0=v_main_~i~0_1650, main_~n~0=v_main_~n~0_244} AuxVars[] AssignedVars[] [2021-05-02 23:07:51,907 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:07:51,909 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:51,911 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:51,932 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:07:51,944 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:07:51,999 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:07:52,060 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:07:52,064 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1652 4)) (<= v_main_~i~0_1652 v_main_~n~0_245)) InVars {main_~i~0=v_main_~i~0_1652, main_~n~0=v_main_~n~0_245} OutVars{main_~i~0=v_main_~i~0_1652, main_~n~0=v_main_~n~0_245} AuxVars[] AssignedVars[] [2021-05-02 23:07:52,067 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:07:52,069 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:52,071 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:52,093 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:07:52,105 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:07:52,163 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:07:52,223 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1654 v_main_~n~0_246) (= v_main_~i~0_1654 4)) InVars {main_~i~0=v_main_~i~0_1654, main_~n~0=v_main_~n~0_246} OutVars{main_~i~0=v_main_~i~0_1654, main_~n~0=v_main_~n~0_246} AuxVars[] AssignedVars[] [2021-05-02 23:07:52,225 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:07:52,252 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:52,255 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:07:52,278 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:07:52,282 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:07:52,287 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:07:52,309 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:07:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:52,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:07:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:07:52,478 INFO 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:07:52,482 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:07:57,878 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:07:57,879 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1914870300] [2021-05-02 23:07:57,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1914870300] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:07:57,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:07:57,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2021-05-02 23:07:57,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309349947] [2021-05-02 23:07:57,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2021-05-02 23:07:57,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:07:57,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-05-02 23:07:57,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=5790, Unknown=0, NotChecked=0, Total=6006 [2021-05-02 23:07:57,880 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand has 75 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 73 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:07:58,292 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-05-02 23:08:11,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:08:11,233 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2021-05-02 23:08:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-05-02 23:08:11,235 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 73 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2021-05-02 23:08:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:08:11,236 INFO L225 Difference]: With dead ends: 119 [2021-05-02 23:08:11,236 INFO L226 Difference]: Without dead ends: 114 [2021-05-02 23:08:11,237 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5290 ImplicationChecksByTransitivity, 12052.4ms TimeCoverageRelationStatistics Valid=543, Invalid=20627, Unknown=0, NotChecked=0, Total=21170 [2021-05-02 23:08:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-05-02 23:08:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-05-02 23:08:11,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.018348623853211) internal successors, (111), 109 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:08:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2021-05-02 23:08:11,251 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 110 [2021-05-02 23:08:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:08:11,251 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2021-05-02 23:08:11,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 75 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 73 states have internal predecessors, (106), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:08:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2021-05-02 23:08:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-02 23:08:11,251 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:08:11,252 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 32, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:08:11,252 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable305 [2021-05-02 23:08:11,252 INFO L428 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:08:11,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:08:11,252 INFO L82 PathProgramCache]: Analyzing trace with hash -657597080, now seen corresponding path program 61 times [2021-05-02 23:08:11,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:08:11,252 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [811040416] [2021-05-02 23:08:11,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:08:11,266 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1691 4) (<= (+ v_main_~i~0_1691 1) v_main_~n~0_247)) InVars {main_~i~0=v_main_~i~0_1691, main_~n~0=v_main_~n~0_247} OutVars{main_~i~0=v_main_~i~0_1691, main_~n~0=v_main_~n~0_247} AuxVars[] AssignedVars[] [2021-05-02 23:08:11,269 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:08:11,270 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:11,273 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:11,294 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:08:11,300 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:08:11,328 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:08:11,356 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1693 4)) (<= (+ v_main_~i~0_1693 1) v_main_~n~0_248)) InVars {main_~i~0=v_main_~i~0_1693, main_~n~0=v_main_~n~0_248} OutVars{main_~i~0=v_main_~i~0_1693, main_~n~0=v_main_~n~0_248} AuxVars[] AssignedVars[] [2021-05-02 23:08:11,359 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:08:11,360 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:11,363 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:11,388 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:08:11,402 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:08:11,470 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:08:11,535 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:08:11,540 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1695 v_main_~n~0_249) (not (= v_main_~i~0_1695 4))) InVars {main_~i~0=v_main_~i~0_1695, main_~n~0=v_main_~n~0_249} OutVars{main_~i~0=v_main_~i~0_1695, main_~n~0=v_main_~n~0_249} AuxVars[] AssignedVars[] [2021-05-02 23:08:11,542 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:08:11,544 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:11,546 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:11,570 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:08:11,584 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:08:11,660 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:08:11,735 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1697 v_main_~n~0_250) (= v_main_~i~0_1697 4)) InVars {main_~i~0=v_main_~i~0_1697, main_~n~0=v_main_~n~0_250} OutVars{main_~i~0=v_main_~i~0_1697, main_~n~0=v_main_~n~0_250} AuxVars[] AssignedVars[] [2021-05-02 23:08:11,738 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:08:11,739 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:11,742 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:11,766 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:08:11,770 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:08:11,798 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:08:11,820 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:08:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:08:12,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:08:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:08:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:08:12,077 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:08:12,205 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2021-05-02 23:08:12,314 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:08:18,857 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:08:18,858 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [811040416] [2021-05-02 23:08:18,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [811040416] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:08:18,858 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:08:18,858 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [76] imperfect sequences [] total 76 [2021-05-02 23:08:18,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929297548] [2021-05-02 23:08:18,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2021-05-02 23:08:18,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:08:18,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-05-02 23:08:18,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5949, Unknown=0, NotChecked=0, Total=6162 [2021-05-02 23:08:18,859 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand has 76 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 74 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:08:19,387 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-05-02 23:08:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:08:32,446 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2021-05-02 23:08:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-05-02 23:08:32,448 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 74 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:08:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:08:32,449 INFO L225 Difference]: With dead ends: 124 [2021-05-02 23:08:32,449 INFO L226 Difference]: Without dead ends: 116 [2021-05-02 23:08:32,450 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5117 ImplicationChecksByTransitivity, 13607.9ms TimeCoverageRelationStatistics Valid=541, Invalid=21215, Unknown=0, NotChecked=0, Total=21756 [2021-05-02 23:08:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-05-02 23:08:32,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-05-02 23:08:32,467 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:08:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2021-05-02 23:08:32,467 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 113 [2021-05-02 23:08:32,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:08:32,467 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2021-05-02 23:08:32,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 76 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 74 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:08:32,467 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2021-05-02 23:08:32,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-05-02 23:08:32,468 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:08:32,468 INFO L523 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:08:32,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2021-05-02 23:08:32,468 INFO L428 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:08:32,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:08:32,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1117410282, now seen corresponding path program 62 times [2021-05-02 23:08:32,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:08:32,468 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [577015746] [2021-05-02 23:08:32,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:08:32,480 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1734 4) (<= (+ v_main_~i~0_1734 1) v_main_~n~0_251)) InVars {main_~i~0=v_main_~i~0_1734, main_~n~0=v_main_~n~0_251} OutVars{main_~i~0=v_main_~i~0_1734, main_~n~0=v_main_~n~0_251} AuxVars[] AssignedVars[] [2021-05-02 23:08:32,483 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:08:32,511 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:32,514 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:32,531 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:08:32,535 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:08:32,538 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:08:32,563 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1736 1) v_main_~n~0_252) (not (= v_main_~i~0_1736 4))) InVars {main_~i~0=v_main_~i~0_1736, main_~n~0=v_main_~n~0_252} OutVars{main_~i~0=v_main_~i~0_1736, main_~n~0=v_main_~n~0_252} AuxVars[] AssignedVars[] [2021-05-02 23:08:32,565 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:08:32,567 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:32,569 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:32,592 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:08:32,605 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:08:32,673 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:08:32,726 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:08:32,730 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1738 v_main_~n~0_253) (not (= v_main_~i~0_1738 4))) InVars {main_~i~0=v_main_~i~0_1738, main_~n~0=v_main_~n~0_253} OutVars{main_~i~0=v_main_~i~0_1738, main_~n~0=v_main_~n~0_253} AuxVars[] AssignedVars[] [2021-05-02 23:08:32,732 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:08:32,761 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:32,763 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:32,782 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:08:32,796 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:08:32,835 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:08:32,903 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1740 v_main_~n~0_254) (= v_main_~i~0_1740 4)) InVars {main_~i~0=v_main_~i~0_1740, main_~n~0=v_main_~n~0_254} OutVars{main_~i~0=v_main_~i~0_1740, main_~n~0=v_main_~n~0_254} AuxVars[] AssignedVars[] [2021-05-02 23:08:32,905 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:08:32,907 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:32,909 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:32,931 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:08:32,935 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:08:32,959 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:08:32,978 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:08:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:08:33,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:08:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:08:33,143 INFO 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:08:33,147 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:08:33,339 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:08:40,521 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:08:40,522 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [577015746] [2021-05-02 23:08:40,522 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [577015746] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:08:40,522 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:08:40,522 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2021-05-02 23:08:40,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373311896] [2021-05-02 23:08:40,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2021-05-02 23:08:40,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:08:40,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-05-02 23:08:40,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=6130, Unknown=0, NotChecked=0, Total=6320 [2021-05-02 23:08:40,523 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 77 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 75 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:08:41,079 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2021-05-02 23:08:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:08:57,043 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2021-05-02 23:08:57,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2021-05-02 23:08:57,046 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 75 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:08:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:08:57,046 INFO L225 Difference]: With dead ends: 122 [2021-05-02 23:08:57,046 INFO L226 Difference]: Without dead ends: 117 [2021-05-02 23:08:57,048 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4254 ImplicationChecksByTransitivity, 16163.0ms TimeCoverageRelationStatistics Valid=496, Invalid=21854, Unknown=0, NotChecked=0, Total=22350 [2021-05-02 23:08:57,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-05-02 23:08:57,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-05-02 23:08:57,061 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:08:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2021-05-02 23:08:57,062 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 113 [2021-05-02 23:08:57,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:08:57,062 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2021-05-02 23:08:57,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 77 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 75 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:08:57,062 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2021-05-02 23:08:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-05-02 23:08:57,062 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:08:57,063 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 33, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:08:57,063 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315 [2021-05-02 23:08:57,063 INFO L428 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:08:57,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:08:57,063 INFO L82 PathProgramCache]: Analyzing trace with hash 27611179, now seen corresponding path program 63 times [2021-05-02 23:08:57,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:08:57,063 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2119209381] [2021-05-02 23:08:57,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:08:57,086 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1778 4) (<= (+ v_main_~i~0_1778 1) v_main_~n~0_255)) InVars {main_~i~0=v_main_~i~0_1778, main_~n~0=v_main_~n~0_255} OutVars{main_~i~0=v_main_~i~0_1778, main_~n~0=v_main_~n~0_255} AuxVars[] AssignedVars[] [2021-05-02 23:08:57,088 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:08:57,121 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:57,124 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:57,148 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:08:57,154 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:08:57,158 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:08:57,186 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1780 1) v_main_~n~0_256) (not (= v_main_~i~0_1780 4))) InVars {main_~i~0=v_main_~i~0_1780, main_~n~0=v_main_~n~0_256} OutVars{main_~i~0=v_main_~i~0_1780, main_~n~0=v_main_~n~0_256} AuxVars[] AssignedVars[] [2021-05-02 23:08:57,189 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:08:57,191 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:57,194 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:57,222 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:08:57,237 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:08:57,324 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:08:57,407 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:08:57,413 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1782 4)) (<= v_main_~i~0_1782 v_main_~n~0_257)) InVars {main_~i~0=v_main_~i~0_1782, main_~n~0=v_main_~n~0_257} OutVars{main_~i~0=v_main_~i~0_1782, main_~n~0=v_main_~n~0_257} AuxVars[] AssignedVars[] [2021-05-02 23:08:57,415 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:08:57,454 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:57,457 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:57,482 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:08:57,497 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:08:57,545 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:08:57,625 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1784 v_main_~n~0_258) (= v_main_~i~0_1784 4)) InVars {main_~i~0=v_main_~i~0_1784, main_~n~0=v_main_~n~0_258} OutVars{main_~i~0=v_main_~i~0_1784, main_~n~0=v_main_~n~0_258} AuxVars[] AssignedVars[] [2021-05-02 23:08:57,628 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:08:57,629 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:57,633 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:08:57,656 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:08:57,662 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:08:57,695 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:08:57,719 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:08:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:08:57,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:08:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:08:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:08:57,940 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:08:58,077 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2021-05-02 23:08:58,207 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:09:06,541 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:09:06,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2119209381] [2021-05-02 23:09:06,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2119209381] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:09:06,541 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:09:06,541 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [78] imperfect sequences [] total 78 [2021-05-02 23:09:06,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483156281] [2021-05-02 23:09:06,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2021-05-02 23:09:06,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:09:06,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2021-05-02 23:09:06,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=6288, Unknown=0, NotChecked=0, Total=6480 [2021-05-02 23:09:06,543 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand has 78 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 76 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:09:07,300 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2021-05-02 23:09:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:09:25,053 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2021-05-02 23:09:25,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-05-02 23:09:25,056 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 76 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2021-05-02 23:09:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:09:25,056 INFO L225 Difference]: With dead ends: 127 [2021-05-02 23:09:25,057 INFO L226 Difference]: Without dead ends: 119 [2021-05-02 23:09:25,058 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4332 ImplicationChecksByTransitivity, 18381.1ms TimeCoverageRelationStatistics Valid=502, Invalid=22450, Unknown=0, NotChecked=0, Total=22952 [2021-05-02 23:09:25,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-02 23:09:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2021-05-02 23:09:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.0176991150442478) internal successors, (115), 113 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:09:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2021-05-02 23:09:25,072 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 116 [2021-05-02 23:09:25,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:09:25,072 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2021-05-02 23:09:25,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 78 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 76 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:09:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2021-05-02 23:09:25,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-05-02 23:09:25,072 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:09:25,073 INFO L523 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:09:25,073 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable320 [2021-05-02 23:09:25,073 INFO L428 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:09:25,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:09:25,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1802618541, now seen corresponding path program 64 times [2021-05-02 23:09:25,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:09:25,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [760440855] [2021-05-02 23:09:25,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:09:25,098 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1822 1) v_main_~n~0_259) (= v_main_~i~0_1822 4)) InVars {main_~i~0=v_main_~i~0_1822, main_~n~0=v_main_~n~0_259} OutVars{main_~i~0=v_main_~i~0_1822, main_~n~0=v_main_~n~0_259} AuxVars[] AssignedVars[] [2021-05-02 23:09:25,100 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:09:25,102 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:25,106 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:25,135 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:09:25,142 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:09:25,178 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:09:25,209 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1824 4)) (<= (+ v_main_~i~0_1824 1) v_main_~n~0_260)) InVars {main_~i~0=v_main_~i~0_1824, main_~n~0=v_main_~n~0_260} OutVars{main_~i~0=v_main_~i~0_1824, main_~n~0=v_main_~n~0_260} AuxVars[] AssignedVars[] [2021-05-02 23:09:25,212 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:09:25,215 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:25,219 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:25,246 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:09:25,264 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:09:25,359 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:09:25,463 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-02 23:09:25,467 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:09:25,476 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1826 v_main_~n~0_261) (not (= v_main_~i~0_1826 4))) InVars {main_~i~0=v_main_~i~0_1826, main_~n~0=v_main_~n~0_261} OutVars{main_~i~0=v_main_~i~0_1826, main_~n~0=v_main_~n~0_261} AuxVars[] AssignedVars[] [2021-05-02 23:09:25,480 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:09:25,483 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:25,488 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:25,521 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:09:25,540 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:09:25,626 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:09:25,709 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1828 4) (<= v_main_~i~0_1828 v_main_~n~0_262)) InVars {main_~i~0=v_main_~i~0_1828, main_~n~0=v_main_~n~0_262} OutVars{main_~i~0=v_main_~i~0_1828, main_~n~0=v_main_~n~0_262} AuxVars[] AssignedVars[] [2021-05-02 23:09:25,711 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:09:25,748 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:25,752 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:25,777 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:09:25,782 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:09:25,788 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:09:25,813 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:09:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:09:26,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:09:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:09:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:09:26,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:09:26,250 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2021-05-02 23:09:26,397 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:09:34,526 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:09:34,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [760440855] [2021-05-02 23:09:34,526 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [760440855] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:09:34,526 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:09:34,526 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [79] imperfect sequences [] total 79 [2021-05-02 23:09:34,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337143692] [2021-05-02 23:09:34,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2021-05-02 23:09:34,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:09:34,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2021-05-02 23:09:34,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=6422, Unknown=0, NotChecked=0, Total=6642 [2021-05-02 23:09:34,528 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand has 79 states, 78 states have (on average 1.435897435897436) internal successors, (112), 77 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:09:35,203 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-05-02 23:09:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:09:54,906 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2021-05-02 23:09:54,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-05-02 23:09:54,910 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 1.435897435897436) internal successors, (112), 77 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2021-05-02 23:09:54,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:09:54,911 INFO L225 Difference]: With dead ends: 125 [2021-05-02 23:09:54,911 INFO L226 Difference]: Without dead ends: 120 [2021-05-02 23:09:54,912 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5601 ImplicationChecksByTransitivity, 18459.2ms TimeCoverageRelationStatistics Valid=561, Invalid=23001, Unknown=0, NotChecked=0, Total=23562 [2021-05-02 23:09:54,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-05-02 23:09:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2021-05-02 23:09:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.017391304347826) internal successors, (117), 115 states have internal predecessors, (117), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:09:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2021-05-02 23:09:54,933 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 116 [2021-05-02 23:09:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:09:54,933 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2021-05-02 23:09:54,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 79 states, 78 states have (on average 1.435897435897436) internal successors, (112), 77 states have internal predecessors, (112), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:09:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2021-05-02 23:09:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-05-02 23:09:54,934 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:09:54,934 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 34, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:09:54,934 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable325 [2021-05-02 23:09:54,934 INFO L428 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:09:54,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:09:54,934 INFO L82 PathProgramCache]: Analyzing trace with hash -912702840, now seen corresponding path program 65 times [2021-05-02 23:09:54,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:09:54,934 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821175258] [2021-05-02 23:09:54,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:09:54,954 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1867 4) (<= (+ v_main_~i~0_1867 1) v_main_~n~0_263)) InVars {main_~i~0=v_main_~i~0_1867, main_~n~0=v_main_~n~0_263} OutVars{main_~i~0=v_main_~i~0_1867, main_~n~0=v_main_~n~0_263} AuxVars[] AssignedVars[] [2021-05-02 23:09:54,957 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:09:54,997 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:55,001 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:55,033 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:09:55,040 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:09:55,045 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:09:55,082 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1869 4)) (<= (+ v_main_~i~0_1869 1) v_main_~n~0_264)) InVars {main_~i~0=v_main_~i~0_1869, main_~n~0=v_main_~n~0_264} OutVars{main_~i~0=v_main_~i~0_1869, main_~n~0=v_main_~n~0_264} AuxVars[] AssignedVars[] [2021-05-02 23:09:55,091 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:09:55,093 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:55,097 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:55,132 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:09:55,152 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:09:55,243 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:09:55,331 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:09:55,336 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1871 4)) (<= v_main_~i~0_1871 v_main_~n~0_265)) InVars {main_~i~0=v_main_~i~0_1871, main_~n~0=v_main_~n~0_265} OutVars{main_~i~0=v_main_~i~0_1871, main_~n~0=v_main_~n~0_265} AuxVars[] AssignedVars[] [2021-05-02 23:09:55,339 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:09:55,341 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:55,344 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:55,372 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:09:55,391 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:09:55,477 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:09:55,565 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1873 v_main_~n~0_266) (= v_main_~i~0_1873 4)) InVars {main_~i~0=v_main_~i~0_1873, main_~n~0=v_main_~n~0_266} OutVars{main_~i~0=v_main_~i~0_1873, main_~n~0=v_main_~n~0_266} AuxVars[] AssignedVars[] [2021-05-02 23:09:55,568 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:09:55,570 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:55,574 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:09:55,602 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:09:55,608 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:09:55,646 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:09:55,674 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:09:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:09:55,827 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2021-05-02 23:09:55,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:09:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:09:55,945 INFO 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:09:55,950 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:09:56,115 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2021-05-02 23:09:56,243 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:10:07,090 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:10:07,090 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821175258] [2021-05-02 23:10:07,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [821175258] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:10:07,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:10:07,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2021-05-02 23:10:07,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593831443] [2021-05-02 23:10:07,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2021-05-02 23:10:07,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:10:07,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2021-05-02 23:10:07,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=6583, Unknown=0, NotChecked=0, Total=6806 [2021-05-02 23:10:07,092 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand has 80 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 78 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:10:08,244 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-05-02 23:10:29,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:10:29,614 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2021-05-02 23:10:29,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-05-02 23:10:29,618 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 78 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:10:29,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:10:29,618 INFO L225 Difference]: With dead ends: 130 [2021-05-02 23:10:29,618 INFO L226 Difference]: Without dead ends: 122 [2021-05-02 23:10:29,620 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5706 ImplicationChecksByTransitivity, 22250.0ms TimeCoverageRelationStatistics Valid=568, Invalid=23612, Unknown=0, NotChecked=0, Total=24180 [2021-05-02 23:10:29,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-05-02 23:10:29,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2021-05-02 23:10:29,634 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:10:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2021-05-02 23:10:29,635 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 119 [2021-05-02 23:10:29,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:10:29,635 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2021-05-02 23:10:29,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 80 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 78 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:10:29,635 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2021-05-02 23:10:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-05-02 23:10:29,636 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:10:29,636 INFO L523 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:10:29,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2021-05-02 23:10:29,636 INFO L428 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:10:29,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:10:29,636 INFO L82 PathProgramCache]: Analyzing trace with hash 862304522, now seen corresponding path program 66 times [2021-05-02 23:10:29,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:10:29,636 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1990705942] [2021-05-02 23:10:29,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:10:29,653 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1912 1) v_main_~n~0_267) (= v_main_~i~0_1912 4)) InVars {main_~i~0=v_main_~i~0_1912, main_~n~0=v_main_~n~0_267} OutVars{main_~i~0=v_main_~i~0_1912, main_~n~0=v_main_~n~0_267} AuxVars[] AssignedVars[] [2021-05-02 23:10:29,656 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:10:29,658 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:29,662 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:29,698 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:10:29,705 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:10:29,756 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:10:29,810 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_1914 4)) (<= (+ v_main_~i~0_1914 1) v_main_~n~0_268)) InVars {main_~i~0=v_main_~i~0_1914, main_~n~0=v_main_~n~0_268} OutVars{main_~i~0=v_main_~i~0_1914, main_~n~0=v_main_~n~0_268} AuxVars[] AssignedVars[] [2021-05-02 23:10:29,812 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:10:29,815 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:29,821 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:29,861 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:10:29,885 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:10:29,990 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:10:30,096 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-02 23:10:30,100 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:10:30,107 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1916 v_main_~n~0_269) (not (= v_main_~i~0_1916 4))) InVars {main_~i~0=v_main_~i~0_1916, main_~n~0=v_main_~n~0_269} OutVars{main_~i~0=v_main_~i~0_1916, main_~n~0=v_main_~n~0_269} AuxVars[] AssignedVars[] [2021-05-02 23:10:30,109 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:10:30,111 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:30,115 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:30,148 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:10:30,167 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:10:30,262 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:10:30,367 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1918 v_main_~n~0_270) (= v_main_~i~0_1918 4)) InVars {main_~i~0=v_main_~i~0_1918, main_~n~0=v_main_~n~0_270} OutVars{main_~i~0=v_main_~i~0_1918, main_~n~0=v_main_~n~0_270} AuxVars[] AssignedVars[] [2021-05-02 23:10:30,370 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:10:30,372 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:30,376 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:10:30,406 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:10:30,412 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:10:30,449 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:10:30,482 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:10:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:10:30,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:10:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:10:30,773 INFO 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:10:30,778 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:10:30,909 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 23 [2021-05-02 23:10:41,435 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:10:41,435 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1990705942] [2021-05-02 23:10:41,436 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1990705942] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:10:41,436 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:10:41,436 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [81] imperfect sequences [] total 81 [2021-05-02 23:10:41,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815949610] [2021-05-02 23:10:41,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2021-05-02 23:10:41,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:10:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2021-05-02 23:10:41,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=6774, Unknown=0, NotChecked=0, Total=6972 [2021-05-02 23:10:41,437 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand has 81 states, 80 states have (on average 1.4375) internal successors, (115), 79 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:10:42,202 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2021-05-02 23:11:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:11:06,647 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2021-05-02 23:11:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2021-05-02 23:11:06,652 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 80 states have (on average 1.4375) internal successors, (115), 79 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:11:06,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:11:06,653 INFO L225 Difference]: With dead ends: 128 [2021-05-02 23:11:06,653 INFO L226 Difference]: Without dead ends: 123 [2021-05-02 23:11:06,654 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4652 ImplicationChecksByTransitivity, 23898.6ms TimeCoverageRelationStatistics Valid=520, Invalid=24286, Unknown=0, NotChecked=0, Total=24806 [2021-05-02 23:11:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-05-02 23:11:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-05-02 23:11:06,669 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:11:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2021-05-02 23:11:06,669 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 119 [2021-05-02 23:11:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:11:06,669 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2021-05-02 23:11:06,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 81 states, 80 states have (on average 1.4375) internal successors, (115), 79 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:11:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2021-05-02 23:11:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-05-02 23:11:06,670 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:11:06,670 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 35, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:11:06,670 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable335 [2021-05-02 23:11:06,670 INFO L428 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:11:06,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:11:06,671 INFO L82 PathProgramCache]: Analyzing trace with hash -2030938357, now seen corresponding path program 67 times [2021-05-02 23:11:06,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:11:06,671 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1379834464] [2021-05-02 23:11:06,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:11:06,689 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1958 4) (<= (+ v_main_~i~0_1958 1) v_main_~n~0_271)) InVars {main_~i~0=v_main_~i~0_1958, main_~n~0=v_main_~n~0_271} OutVars{main_~i~0=v_main_~i~0_1958, main_~n~0=v_main_~n~0_271} AuxVars[] AssignedVars[] [2021-05-02 23:11:06,692 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:11:06,743 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:06,748 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:06,789 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:11:06,797 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:11:06,803 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:11:06,829 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_1960 1) v_main_~n~0_272) (not (= v_main_~i~0_1960 4))) InVars {main_~i~0=v_main_~i~0_1960, main_~n~0=v_main_~n~0_272} OutVars{main_~i~0=v_main_~i~0_1960, main_~n~0=v_main_~n~0_272} AuxVars[] AssignedVars[] [2021-05-02 23:11:06,831 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:11:06,882 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:06,886 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:06,920 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:11:06,942 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:11:07,005 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:11:07,106 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:11:07,114 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_1962 v_main_~n~0_273) (not (= v_main_~i~0_1962 4))) InVars {main_~i~0=v_main_~i~0_1962, main_~n~0=v_main_~n~0_273} OutVars{main_~i~0=v_main_~i~0_1962, main_~n~0=v_main_~n~0_273} AuxVars[] AssignedVars[] [2021-05-02 23:11:07,117 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:11:07,119 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:07,123 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:07,162 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:11:07,185 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:11:07,303 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:11:07,412 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_1964 4) (<= v_main_~i~0_1964 v_main_~n~0_274)) InVars {main_~i~0=v_main_~i~0_1964, main_~n~0=v_main_~n~0_274} OutVars{main_~i~0=v_main_~i~0_1964, main_~n~0=v_main_~n~0_274} AuxVars[] AssignedVars[] [2021-05-02 23:11:07,414 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:11:07,417 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:07,421 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:07,457 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:11:07,464 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:11:07,512 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:11:07,556 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:11:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:11:07,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:11:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:11:07,996 INFO 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:11:08,003 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:11:08,249 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2021-05-02 23:11:08,422 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:11:20,919 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:11:20,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1379834464] [2021-05-02 23:11:20,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1379834464] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:11:20,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:11:20,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [82] imperfect sequences [] total 82 [2021-05-02 23:11:20,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935014292] [2021-05-02 23:11:20,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2021-05-02 23:11:20,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:11:20,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2021-05-02 23:11:20,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=6940, Unknown=0, NotChecked=0, Total=7140 [2021-05-02 23:11:20,922 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand has 82 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 80 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:11:21,976 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49 [2021-05-02 23:11:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:11:50,102 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2021-05-02 23:11:50,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-05-02 23:11:50,107 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 80 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2021-05-02 23:11:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:11:50,107 INFO L225 Difference]: With dead ends: 133 [2021-05-02 23:11:50,108 INFO L226 Difference]: Without dead ends: 125 [2021-05-02 23:11:50,109 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4754 ImplicationChecksByTransitivity, 28202.4ms TimeCoverageRelationStatistics Valid=526, Invalid=24914, Unknown=0, NotChecked=0, Total=25440 [2021-05-02 23:11:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-05-02 23:11:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2021-05-02 23:11:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.0168067226890756) internal successors, (121), 119 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:11:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2021-05-02 23:11:50,125 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 122 [2021-05-02 23:11:50,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:11:50,125 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2021-05-02 23:11:50,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 82 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 80 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:11:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2021-05-02 23:11:50,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-05-02 23:11:50,125 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:11:50,126 INFO L523 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:11:50,126 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340 [2021-05-02 23:11:50,126 INFO L428 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:11:50,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:11:50,126 INFO L82 PathProgramCache]: Analyzing trace with hash -255930995, now seen corresponding path program 68 times [2021-05-02 23:11:50,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:11:50,126 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [434810246] [2021-05-02 23:11:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:11:50,147 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_2004 1) v_main_~n~0_275) (= v_main_~i~0_2004 4)) InVars {main_~i~0=v_main_~i~0_2004, main_~n~0=v_main_~n~0_275} OutVars{main_~i~0=v_main_~i~0_2004, main_~n~0=v_main_~n~0_275} AuxVars[] AssignedVars[] [2021-05-02 23:11:50,150 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:11:50,152 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:50,157 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:50,194 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:11:50,201 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:11:50,251 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:11:50,305 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_2006 1) v_main_~n~0_276) (not (= v_main_~i~0_2006 4))) InVars {main_~i~0=v_main_~i~0_2006, main_~n~0=v_main_~n~0_276} OutVars{main_~i~0=v_main_~i~0_2006, main_~n~0=v_main_~n~0_276} AuxVars[] AssignedVars[] [2021-05-02 23:11:50,308 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:11:50,364 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:50,368 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:50,411 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:11:50,435 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:11:50,504 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:11:50,625 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-02 23:11:50,631 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:11:50,637 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_2008 4)) (<= v_main_~i~0_2008 v_main_~n~0_277)) InVars {main_~i~0=v_main_~i~0_2008, main_~n~0=v_main_~n~0_277} OutVars{main_~i~0=v_main_~i~0_2008, main_~n~0=v_main_~n~0_277} AuxVars[] AssignedVars[] [2021-05-02 23:11:50,640 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:11:50,692 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:50,696 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:50,736 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:11:50,760 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:11:50,831 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:11:50,946 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-05-02 23:11:50,959 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_2010 4) (<= v_main_~i~0_2010 v_main_~n~0_278)) InVars {main_~i~0=v_main_~i~0_2010, main_~n~0=v_main_~n~0_278} OutVars{main_~i~0=v_main_~i~0_2010, main_~n~0=v_main_~n~0_278} AuxVars[] AssignedVars[] [2021-05-02 23:11:50,962 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:11:51,012 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:51,016 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:11:51,049 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:11:51,057 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:11:51,064 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:11:51,105 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:11:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:11:51,310 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2021-05-02 23:11:51,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:11:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:11:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:11:51,542 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:11:51,749 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 23 [2021-05-02 23:12:04,152 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:12:04,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [434810246] [2021-05-02 23:12:04,152 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [434810246] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:12:04,152 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:12:04,152 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2021-05-02 23:12:04,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66830454] [2021-05-02 23:12:04,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2021-05-02 23:12:04,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:12:04,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2021-05-02 23:12:04,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=7080, Unknown=0, NotChecked=0, Total=7310 [2021-05-02 23:12:04,154 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand has 83 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 81 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:12:05,052 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-05-02 23:12:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:12:34,917 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2021-05-02 23:12:34,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-05-02 23:12:34,924 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 81 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2021-05-02 23:12:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:12:34,925 INFO L225 Difference]: With dead ends: 131 [2021-05-02 23:12:34,925 INFO L226 Difference]: Without dead ends: 126 [2021-05-02 23:12:34,926 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6152 ImplicationChecksByTransitivity, 27078.7ms TimeCoverageRelationStatistics Valid=589, Invalid=25493, Unknown=0, NotChecked=0, Total=26082 [2021-05-02 23:12:34,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-05-02 23:12:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-05-02 23:12:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.0165289256198347) internal successors, (123), 121 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:12:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2021-05-02 23:12:34,944 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 122 [2021-05-02 23:12:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:12:34,944 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2021-05-02 23:12:34,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 83 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 81 states have internal predecessors, (118), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:12:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2021-05-02 23:12:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-02 23:12:34,945 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:12:34,945 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 36, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:12:34,945 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable345 [2021-05-02 23:12:34,945 INFO L428 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:12:34,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:12:34,945 INFO L82 PathProgramCache]: Analyzing trace with hash 676089768, now seen corresponding path program 69 times [2021-05-02 23:12:34,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:12:34,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1461616224] [2021-05-02 23:12:34,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:12:34,965 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_2051 1) v_main_~n~0_279) (= v_main_~i~0_2051 4)) InVars {main_~i~0=v_main_~i~0_2051, main_~n~0=v_main_~n~0_279} OutVars{main_~i~0=v_main_~i~0_2051, main_~n~0=v_main_~n~0_279} AuxVars[] AssignedVars[] [2021-05-02 23:12:34,967 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:12:35,012 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:35,016 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:35,059 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:12:35,066 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:12:35,075 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:12:35,126 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_2053 4)) (<= (+ v_main_~i~0_2053 1) v_main_~n~0_280)) InVars {main_~i~0=v_main_~i~0_2053, main_~n~0=v_main_~n~0_280} OutVars{main_~i~0=v_main_~i~0_2053, main_~n~0=v_main_~n~0_280} AuxVars[] AssignedVars[] [2021-05-02 23:12:35,129 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:12:35,132 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:35,136 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:35,174 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:12:35,202 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:12:35,329 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:12:35,491 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-02 23:12:35,498 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:12:35,507 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_2055 4)) (<= v_main_~i~0_2055 v_main_~n~0_281)) InVars {main_~i~0=v_main_~i~0_2055, main_~n~0=v_main_~n~0_281} OutVars{main_~i~0=v_main_~i~0_2055, main_~n~0=v_main_~n~0_281} AuxVars[] AssignedVars[] [2021-05-02 23:12:35,511 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:12:35,514 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:35,520 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:35,568 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:12:35,598 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:12:35,734 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:12:35,906 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-05-02 23:12:35,919 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_2057 v_main_~n~0_282) (= v_main_~i~0_2057 4)) InVars {main_~i~0=v_main_~i~0_2057, main_~n~0=v_main_~n~0_282} OutVars{main_~i~0=v_main_~i~0_2057, main_~n~0=v_main_~n~0_282} AuxVars[] AssignedVars[] [2021-05-02 23:12:35,922 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:12:35,924 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:35,931 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:12:35,968 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:12:35,976 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:12:36,029 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:12:36,076 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:12:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:12:36,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:12:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:12:36,410 INFO 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:12:36,417 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:12:36,613 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 23 [2021-05-02 23:12:50,660 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:12:50,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1461616224] [2021-05-02 23:12:50,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1461616224] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:12:50,660 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:12:50,661 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [84] imperfect sequences [] total 84 [2021-05-02 23:12:50,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164266096] [2021-05-02 23:12:50,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2021-05-02 23:12:50,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:12:50,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-05-02 23:12:50,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=7243, Unknown=0, NotChecked=0, Total=7482 [2021-05-02 23:12:50,662 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand has 84 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 82 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:12:51,792 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-05-02 23:13:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:13:22,246 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2021-05-02 23:13:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-05-02 23:13:22,250 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 82 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:13:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:13:22,251 INFO L225 Difference]: With dead ends: 136 [2021-05-02 23:13:22,251 INFO L226 Difference]: Without dead ends: 128 [2021-05-02 23:13:22,253 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6705 ImplicationChecksByTransitivity, 29128.4ms TimeCoverageRelationStatistics Valid=607, Invalid=26125, Unknown=0, NotChecked=0, Total=26732 [2021-05-02 23:13:22,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-05-02 23:13:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2021-05-02 23:13:22,269 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:13:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2021-05-02 23:13:22,269 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 125 [2021-05-02 23:13:22,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:13:22,269 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2021-05-02 23:13:22,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 84 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 82 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:13:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2021-05-02 23:13:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-05-02 23:13:22,270 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:13:22,270 INFO L523 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:13:22,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2021-05-02 23:13:22,270 INFO L428 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:13:22,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:13:22,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1843870166, now seen corresponding path program 70 times [2021-05-02 23:13:22,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:13:22,271 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [877903829] [2021-05-02 23:13:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:13:22,289 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_2098 4) (<= (+ v_main_~i~0_2098 1) v_main_~n~0_283)) InVars {main_~i~0=v_main_~i~0_2098, main_~n~0=v_main_~n~0_283} OutVars{main_~i~0=v_main_~i~0_2098, main_~n~0=v_main_~n~0_283} AuxVars[] AssignedVars[] [2021-05-02 23:13:22,292 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:13:22,348 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:13:22,352 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:13:22,391 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:13:22,400 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:13:22,407 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:13:22,452 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_2100 4)) (<= (+ v_main_~i~0_2100 1) v_main_~n~0_284)) InVars {main_~i~0=v_main_~i~0_2100, main_~n~0=v_main_~n~0_284} OutVars{main_~i~0=v_main_~i~0_2100, main_~n~0=v_main_~n~0_284} AuxVars[] AssignedVars[] [2021-05-02 23:13:22,456 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:13:22,508 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:13:22,513 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:13:22,554 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:13:22,581 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:13:22,652 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:13:22,771 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-02 23:13:22,776 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:13:22,783 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_2102 4)) (<= v_main_~i~0_2102 v_main_~n~0_285)) InVars {main_~i~0=v_main_~i~0_2102, main_~n~0=v_main_~n~0_285} OutVars{main_~i~0=v_main_~i~0_2102, main_~n~0=v_main_~n~0_285} AuxVars[] AssignedVars[] [2021-05-02 23:13:22,787 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:13:22,848 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:13:22,853 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:13:22,896 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:13:22,923 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:13:23,005 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:13:23,118 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-05-02 23:13:23,132 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_2104 v_main_~n~0_286) (= v_main_~i~0_2104 4)) InVars {main_~i~0=v_main_~i~0_2104, main_~n~0=v_main_~n~0_286} OutVars{main_~i~0=v_main_~i~0_2104, main_~n~0=v_main_~n~0_286} AuxVars[] AssignedVars[] [2021-05-02 23:13:23,135 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:13:23,185 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:13:23,190 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:13:23,234 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:13:23,244 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:13:23,254 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:13:23,302 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:13:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:13:23,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:13:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:13:23,631 INFO 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:13:23,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:13:23,860 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 23 [2021-05-02 23:13:40,017 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:13:40,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [877903829] [2021-05-02 23:13:40,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [877903829] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:13:40,017 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:13:40,017 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [85] imperfect sequences [] total 85 [2021-05-02 23:13:40,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906145182] [2021-05-02 23:13:40,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2021-05-02 23:13:40,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:13:40,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2021-05-02 23:13:40,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=7415, Unknown=0, NotChecked=0, Total=7656 [2021-05-02 23:13:40,019 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 85 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 83 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:13:41,087 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2021-05-02 23:14:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:14:17,377 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2021-05-02 23:14:17,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-05-02 23:14:17,383 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 83 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:14:17,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:14:17,384 INFO L225 Difference]: With dead ends: 134 [2021-05-02 23:14:17,384 INFO L226 Difference]: Without dead ends: 129 [2021-05-02 23:14:17,385 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6866 ImplicationChecksByTransitivity, 33324.4ms TimeCoverageRelationStatistics Valid=613, Invalid=26777, Unknown=0, NotChecked=0, Total=27390 [2021-05-02 23:14:17,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-05-02 23:14:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-05-02 23:14:17,403 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:14:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2021-05-02 23:14:17,404 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 125 [2021-05-02 23:14:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:14:17,404 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2021-05-02 23:14:17,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 85 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 83 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:14:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2021-05-02 23:14:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-05-02 23:14:17,405 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:14:17,405 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 37, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:14:17,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable355 [2021-05-02 23:14:17,405 INFO L428 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:14:17,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:14:17,406 INFO L82 PathProgramCache]: Analyzing trace with hash -849955349, now seen corresponding path program 71 times [2021-05-02 23:14:17,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:14:17,406 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [336953813] [2021-05-02 23:14:17,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:14:17,430 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_2146 1) v_main_~n~0_287) (= v_main_~i~0_2146 4)) InVars {main_~i~0=v_main_~i~0_2146, main_~n~0=v_main_~n~0_287} OutVars{main_~i~0=v_main_~i~0_2146, main_~n~0=v_main_~n~0_287} AuxVars[] AssignedVars[] [2021-05-02 23:14:17,433 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:14:17,435 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:17,439 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:17,476 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:14:17,484 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:14:17,532 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:14:17,576 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_2148 1) v_main_~n~0_288) (not (= v_main_~i~0_2148 4))) InVars {main_~i~0=v_main_~i~0_2148, main_~n~0=v_main_~n~0_288} OutVars{main_~i~0=v_main_~i~0_2148, main_~n~0=v_main_~n~0_288} AuxVars[] AssignedVars[] [2021-05-02 23:14:17,579 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:14:17,581 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:17,585 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:17,628 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:14:17,655 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:14:17,795 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:14:17,926 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-02 23:14:17,930 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:14:17,938 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_2150 v_main_~n~0_289) (not (= v_main_~i~0_2150 4))) InVars {main_~i~0=v_main_~i~0_2150, main_~n~0=v_main_~n~0_289} OutVars{main_~i~0=v_main_~i~0_2150, main_~n~0=v_main_~n~0_289} AuxVars[] AssignedVars[] [2021-05-02 23:14:17,941 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:14:17,991 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:17,996 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:18,036 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:14:18,062 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:14:18,136 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:14:18,264 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-05-02 23:14:18,278 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_2152 v_main_~n~0_290) (= v_main_~i~0_2152 4)) InVars {main_~i~0=v_main_~i~0_2152, main_~n~0=v_main_~n~0_290} OutVars{main_~i~0=v_main_~i~0_2152, main_~n~0=v_main_~n~0_290} AuxVars[] AssignedVars[] [2021-05-02 23:14:18,281 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:14:18,336 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:18,341 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:14:18,381 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:14:18,389 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:14:18,398 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:14:18,443 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:14:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:14:18,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:14:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:14:18,781 INFO 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:14:18,788 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:14:19,069 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2021-05-02 23:14:19,250 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-05-02 23:14:19,255 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:14:19,449 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 16 [2021-05-02 23:14:37,808 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:14:37,808 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [336953813] [2021-05-02 23:14:37,809 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [336953813] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:14:37,809 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:14:37,809 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [86] imperfect sequences [] total 86 [2021-05-02 23:14:37,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115953019] [2021-05-02 23:14:37,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2021-05-02 23:14:37,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:14:37,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2021-05-02 23:14:37,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=7588, Unknown=0, NotChecked=0, Total=7832 [2021-05-02 23:14:37,810 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand has 86 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 84 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:14:39,340 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-05-02 23:15:16,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:15:16,305 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2021-05-02 23:15:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2021-05-02 23:15:16,311 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 84 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2021-05-02 23:15:16,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:15:16,312 INFO L225 Difference]: With dead ends: 139 [2021-05-02 23:15:16,312 INFO L226 Difference]: Without dead ends: 131 [2021-05-02 23:15:16,314 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 34 SyntacticMatches, 8 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7010 ImplicationChecksByTransitivity, 36322.9ms TimeCoverageRelationStatistics Valid=621, Invalid=27435, Unknown=0, NotChecked=0, Total=28056 [2021-05-02 23:15:16,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-05-02 23:15:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2021-05-02 23:15:16,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.016) internal successors, (127), 125 states have internal predecessors, (127), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:15:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2021-05-02 23:15:16,332 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 128 [2021-05-02 23:15:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:15:16,332 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2021-05-02 23:15:16,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 86 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 84 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:15:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2021-05-02 23:15:16,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-05-02 23:15:16,333 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:15:16,333 INFO L523 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:15:16,333 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2021-05-02 23:15:16,333 INFO L428 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:15:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:15:16,333 INFO L82 PathProgramCache]: Analyzing trace with hash 925052013, now seen corresponding path program 72 times [2021-05-02 23:15:16,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:15:16,333 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [644465788] [2021-05-02 23:15:16,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:15:16,352 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_2194 4) (<= (+ v_main_~i~0_2194 1) v_main_~n~0_291)) InVars {main_~i~0=v_main_~i~0_2194, main_~n~0=v_main_~n~0_291} OutVars{main_~i~0=v_main_~i~0_2194, main_~n~0=v_main_~n~0_291} AuxVars[] AssignedVars[] [2021-05-02 23:15:16,367 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:15:16,413 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:16,416 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:16,450 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:15:16,457 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:15:16,465 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:15:16,513 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_2196 1) v_main_~n~0_292) (not (= v_main_~i~0_2196 4))) InVars {main_~i~0=v_main_~i~0_2196, main_~n~0=v_main_~n~0_292} OutVars{main_~i~0=v_main_~i~0_2196, main_~n~0=v_main_~n~0_292} AuxVars[] AssignedVars[] [2021-05-02 23:15:16,516 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:15:16,518 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:16,522 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:16,561 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:15:16,587 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:15:16,714 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:15:16,858 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-05-02 23:15:16,865 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:15:16,874 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_2198 v_main_~n~0_293) (not (= v_main_~i~0_2198 4))) InVars {main_~i~0=v_main_~i~0_2198, main_~n~0=v_main_~n~0_293} OutVars{main_~i~0=v_main_~i~0_2198, main_~n~0=v_main_~n~0_293} AuxVars[] AssignedVars[] [2021-05-02 23:15:16,877 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:15:16,931 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:16,937 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:16,982 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:15:17,009 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:15:17,090 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:15:17,247 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-05-02 23:15:17,260 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_2200 v_main_~n~0_294) (= v_main_~i~0_2200 4)) InVars {main_~i~0=v_main_~i~0_2200, main_~n~0=v_main_~n~0_294} OutVars{main_~i~0=v_main_~i~0_2200, main_~n~0=v_main_~n~0_294} AuxVars[] AssignedVars[] [2021-05-02 23:15:17,263 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:15:17,266 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:17,270 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:17,323 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:15:17,332 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:15:17,395 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:15:17,450 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:15:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:15:17,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:15:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:15:17,867 INFO 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:15:17,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:15:18,127 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2021-05-02 23:15:18,325 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2021-05-02 23:15:18,329 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:15:18,528 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 16 [2021-05-02 23:15:33,399 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:15:33,400 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [644465788] [2021-05-02 23:15:33,400 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [644465788] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:15:33,400 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:15:33,400 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [87] imperfect sequences [] total 87 [2021-05-02 23:15:33,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169153800] [2021-05-02 23:15:33,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2021-05-02 23:15:33,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:15:33,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2021-05-02 23:15:33,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=7764, Unknown=0, NotChecked=0, Total=8010 [2021-05-02 23:15:33,402 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand has 87 states, 86 states have (on average 1.441860465116279) internal successors, (124), 85 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:15:34,568 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-05-02 23:15:56,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:15:56,059 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2021-05-02 23:15:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-05-02 23:15:56,062 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 86 states have (on average 1.441860465116279) internal successors, (124), 85 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 128 [2021-05-02 23:15:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:15:56,062 INFO L225 Difference]: With dead ends: 137 [2021-05-02 23:15:56,062 INFO L226 Difference]: Without dead ends: 132 [2021-05-02 23:15:56,063 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7203 ImplicationChecksByTransitivity, 26293.3ms TimeCoverageRelationStatistics Valid=627, Invalid=28103, Unknown=0, NotChecked=0, Total=28730 [2021-05-02 23:15:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-05-02 23:15:56,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-05-02 23:15:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.015748031496063) internal successors, (129), 127 states have internal predecessors, (129), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:15:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2021-05-02 23:15:56,080 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 128 [2021-05-02 23:15:56,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:15:56,080 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2021-05-02 23:15:56,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 87 states, 86 states have (on average 1.441860465116279) internal successors, (124), 85 states have internal predecessors, (124), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:15:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2021-05-02 23:15:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-05-02 23:15:56,081 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:15:56,081 INFO L523 BasicCegarLoop]: trace histogram [40, 40, 38, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:15:56,081 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable365 [2021-05-02 23:15:56,081 INFO L428 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:15:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:15:56,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1031207736, now seen corresponding path program 73 times [2021-05-02 23:15:56,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:15:56,082 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1040319893] [2021-05-02 23:15:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:15:56,095 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= (+ v_main_~i~0_2243 1) v_main_~n~0_295) (= v_main_~i~0_2243 4)) InVars {main_~i~0=v_main_~i~0_2243, main_~n~0=v_main_~n~0_295} OutVars{main_~i~0=v_main_~i~0_2243, main_~n~0=v_main_~n~0_295} AuxVars[] AssignedVars[] [2021-05-02 23:15:56,098 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size [2021-05-02 23:15:56,099 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:56,102 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:56,131 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:15:56,137 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:15:56,171 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 94.3 percent of original size 82 [2021-05-02 23:15:56,202 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (not (= v_main_~i~0_2245 4)) (<= (+ v_main_~i~0_2245 1) v_main_~n~0_296)) InVars {main_~i~0=v_main_~i~0_2245, main_~n~0=v_main_~n~0_296} OutVars{main_~i~0=v_main_~i~0_2245, main_~n~0=v_main_~n~0_296} AuxVars[] AssignedVars[] [2021-05-02 23:15:56,204 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size [2021-05-02 23:15:56,205 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:56,208 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:56,235 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-05-02 23:15:56,253 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-05-02 23:15:56,334 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 92.3 percent of original size 84 [2021-05-02 23:15:56,408 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:15:56,412 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (<= v_main_~i~0_2247 v_main_~n~0_297) (not (= v_main_~i~0_2247 4))) InVars {main_~i~0=v_main_~i~0_2247, main_~n~0=v_main_~n~0_297} OutVars{main_~i~0=v_main_~i~0_2247, main_~n~0=v_main_~n~0_297} AuxVars[] AssignedVars[] [2021-05-02 23:15:56,414 WARN L240 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size [2021-05-02 23:15:56,446 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:56,449 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:56,473 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-05-02 23:15:56,488 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-05-02 23:15:56,537 WARN L245 tifierPushTermWalker]: treesize reduction 7, result has 91.8 percent of original size 78 [2021-05-02 23:15:56,628 INFO L181 rdanLoopAcceleration]: Guard: Formula: (and (= v_main_~i~0_2249 4) (<= v_main_~i~0_2249 v_main_~n~0_298)) InVars {main_~i~0=v_main_~i~0_2249, main_~n~0=v_main_~n~0_298} OutVars{main_~i~0=v_main_~i~0_2249, main_~n~0=v_main_~n~0_298} AuxVars[] AssignedVars[] [2021-05-02 23:15:56,643 WARN L240 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size [2021-05-02 23:15:56,675 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:56,677 WARN L240 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size [2021-05-02 23:15:56,699 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-05-02 23:15:56,704 WARN L245 tifierPushTermWalker]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-05-02 23:15:56,708 WARN L245 tifierPushTermWalker]: treesize reduction 5, result has 93.8 percent of original size 76 [2021-05-02 23:15:56,730 INFO L212 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2021-05-02 23:15:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:15:56,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:15:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:15:56,923 INFO 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:15:56,928 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:15:57,076 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2021-05-02 23:15:57,212 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 23:16:06,995 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:16:06,996 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1040319893] [2021-05-02 23:16:06,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1040319893] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:16:06,996 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:16:06,996 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [88] imperfect sequences [] total 88 [2021-05-02 23:16:06,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297489929] [2021-05-02 23:16:06,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2021-05-02 23:16:06,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:16:06,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2021-05-02 23:16:06,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=7978, Unknown=0, NotChecked=0, Total=8190 [2021-05-02 23:16:06,997 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand has 88 states, 87 states have (on average 1.4597701149425288) internal successors, (127), 86 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:16:07,832 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 49